Carmichael 3 strong pseudoprimes: Difference between revisions
Content added Content deleted
(Small changed in Ruby entry) |
mNo edit summary |
||
Line 1: | Line 1: | ||
{{task}} |
{{task}} |
||
A lot of composite numbers can be |
A lot of composite numbers can be separated from primes by Fermat's Little Theorem, but there are some that completely confound it. The [[Miller-Rabin primality test|Miller Rabin Test]] uses a combination of Fermat's Little Theorem and Chinese Division Theorem to overcome this. |
||
The purpose of this task is to investigate such numbers using a method based on [[wp:Carmichael number|Carmichael numbers]], as suggested in [http://www.maths.lancs.ac.uk/~jameson/carfind.pdf Notes by G.J.O Jameson March 2010]. |
The purpose of this task is to investigate such numbers using a method based on [[wp:Carmichael number|Carmichael numbers]], as suggested in [http://www.maths.lancs.ac.uk/~jameson/carfind.pdf Notes by G.J.O Jameson March 2010]. |