Carmichael 3 strong pseudoprimes: Difference between revisions
Carmichael 3 strong pseudoprimes (view source)
Revision as of 12:29, 30 November 2012
, 11 years agono edit summary
(Created page with "{{draft Task}} A lot of composite numbers can be detected by the Miller Rabin Test, but there are some that evade it. The purpose of this task is to investigate such numbers....") |
No edit summary |
||
Line 19:
next d if (Prime2*Prime3) mod (Prime1-1) not equal 1
Prime1 * Prime2 * Prime3 is a Carmichael Number
=={{header|Ruby}}==
| |||