Carmichael 3 strong pseudoprimes: Difference between revisions
Content added Content deleted
No edit summary |
|||
| Line 1: | Line 1: | ||
{{draft |
{{draft task}} |
||
A lot of composite numbers can be detected by the Miller Rabin Test, but there are some that evade it. |
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. The method suggested is based on .... |
The purpose of this task is to investigate such numbers. The method suggested is based on [http://www.maths.lancs.ac.uk/~jameson/carfind.pdf Notes by G.J.O Jameson March 2010] |
||
The objective is to find Carmichael numbers of the form Prime1 X Prime2 X Prime3. |
The objective is to find Carmichael numbers of the form Prime1 X Prime2 X Prime3. |
||
Prime1 < Prime2 < Prime3 for all Prime1 upto 61 see page 7 of. |
Prime1 < Prime2 < Prime3 for all Prime1 upto 61 see page 7 of [http://www.maths.lancs.ac.uk/~jameson/carfind.pdf Notes by G.J.O Jameson March 2010]. |
||
For a given Prime1 |
For a given Prime1 |
||