|
|
A096548
|
|
Difference between the smallest 10^n-digit prime and 10^(10^n-1).
|
|
3
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Daniel Heuer found a(5) in 2004 by sieving up to 2^33 and then checking ~8000 candidates with pfgw-linux. Proving primality of 10^99999+309403 is beyond current (2004) technology.
|
|
LINKS
|
factordb.com, 10^999 + 7, contains primality certificate related to a(3).
factordb.com, 10^9999 + 33603, contains primality certificate related to a(4).
Hugo Pfoertner, Paul Underwood, Mike Oakes, Daniel Heuer, Smallest 100000-digit prime?, digest of 7 messages in primeform Yahoo group, Jul 8, 2004. [Cached copy]
|
|
FORMULA
|
|
|
EXAMPLE
|
a(1)=7 because the smallest ten-digit prime is 1000000007.
a(2)=289 because the smallest 100-digit prime is 10^99+289.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more,hard
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|