Jump to content

Carmichael 3 strong pseudoprimes: Difference between revisions

Carmichael 3 strong pseudoprimes (view source)

Revision as of 11:58, 2 March 2013

144 bytes added ,  11 years ago
no edit summary
m (moved Carmichael 3 strong pseudoprimes, or Miller Rabin's nemesis to Carmichael 3 strong pseudoprimes: Alternate names are done via redirects, not multipart names)
No edit summary
Line 1:
{{task}}
A lot of composite numbers can be detectedseperated from primes by theFermats Little Theorem, but there are some that completely confound it. The [[Miller-Rabin primality test|Miller Rabin Test]], butuses therea arecombination someof thatFermat's evadeLittle itTheorem 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].
 
Nigel Galloway
2,172

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/222681"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information