Carmichael 3 strong pseudoprimes: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
Line 19:
:::next d if (Prime2*Prime3) mod (Prime1-1) not equal 1
:::Prime1 * Prime2 * Prime3 is a Carmichael Number
Related Tasks:
:[http://rosettacode.org/wiki/Miller-Rabin_primality_test Miller-Rabin primality test]
=={{header|Ruby}}==
|