Rosetta Code

Carmichael 3 strong pseudoprimes: Difference between revisions

Page Discussion

Carmichael 3 strong pseudoprimes (view source)

Revision as of 06:29, 8 April 2013

No change in size ,  11 years ago
m
no edit summary
(Small changed in Ruby entry)
mNo edit summary
Line 1:
{{task}}
A lot of composite numbers can be seperatedseparated 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].
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/222689"