Talk:Carmichael 3 strong pseudoprimes: Difference between revisions
Talk:Carmichael 3 strong pseudoprimes (view source)
Revision as of 12:57, 17 November 2017
, 6 years agoUndo revision 256051 by Dinosaur (talk) see https://www.wordhippo.com/what-is/the-plural-of/division.html "In more general, commonly used, contexts, the plural form will also be division"
(Undo revision 256051 by Dinosaur (talk) see https://www.wordhippo.com/what-is/the-plural-of/division.html "In more general, commonly used, contexts, the plural form will also be division") |
|||
| (3 intermediate revisions by 2 users not shown) | |||
Line 4:
or, in mathematical notation (possibly not rendered),
:<math>\frac{1}{\sqrt{5}}\left[\left(\frac{1 + \sqrt{5}}{2}\right)^n - \left(\frac{1 - \sqrt{5}}{2}\right)^n\right]</math>
::All the division in this task should result in an integer value. So the best solution is probably to throw/raise an exception if it doesn't.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 12:29, 24 October 2017 (UTC)
==What model MOD is your MOD?==
Line 35 ⟶ 36:
61 181 5521 60957361</pre>
Which turns out to be when the two terms have remainders of one.
:-p squared means -p*p. -p**2 or -p^2 may depend on the language's operator precedence. Use brackets if in doubt. mod of a negative numbers have caused me more problems than I anticipated. We have discussed them on another task to which I would link if I could find it. We concluded that C defined it as a remainder function and many languages have followed suit. It is used here to mean the mathematical modulus function. I think this is another solution to the solutions suggested somewhere else on RC. I promise than any further task using mod of a negative number will include a health warning!--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 11:51, 23 October 2017 (UTC)
==Formula in Fortran contribution invisible to most browsers==
| |||