Wagstaff primes: Difference between revisions
Added a note.
(Realize in F#) |
(Added a note.) |
||
Line 13:
When testing for primality, you may use a method which determines that a large number is probably prime with reasonable certainty.
;Note
It can be shown (see talk page) that ''(2^p + 1)/3'' is always integral if ''p'' is odd. So there's no need to check for that prior to checking for primality.
;References
| |||