![]() |
|
|
#1 |
|
Feb 2008
25 Posts |
For all N>2, is 10^N+1 always composite?
|
|
|
|
|
|
#2 |
|
Sep 2002
Vienna, Austria
3×73 Posts |
|
|
|
|
|
|
#3 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
7·292 Posts |
|
|
|
|
|
|
#4 |
|
Mar 2003
New Zealand
115710 Posts |
10^2^23+1 = 10^8388608+1 is the smallest candidate that hasn't yet been shown to be composite. It would take about 89 days to do a PRP test on this number using a 2.66GHz Core 2. Some more trial factoring would probably be worthwhile before starting the PRP test.
|
|
|
|