|
|
A068840
|
|
Smallest prime with leading digits the same as those of n^n.
|
|
1
|
|
|
11, 41, 271, 25601, 31253, 466561, 8235431, 167772161, 3874204891, 100000000003, 2853116706113, 89161004482567, 3028751065922539, 111120068255580169, 437893890380859375031, 184467440737095516163, 82724026188633676417741, 3934640807529653757542407
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Observation: In most cases only one extra digit is required.
The observation is increasingly inaccurate for large n, where it happens with 'probability' ~ 10/n log n. But a(n) always exists due to the prime number theorem. - Charles R Greathouse IV, Nov 19 2010
|
|
LINKS
|
|
|
EXAMPLE
|
a(5) = 31253 because this is the smallest prime starting with 5^5 = 3125.
|
|
MAPLE
|
for i from 1 to 40 do a := nextprime(i^i*10); b := 1; while(a-i^i*10^b>=10^b) do b := b+1; a := nextprime(i^i*10^b); end do; c[i] := a; end do:q := seq(c[i], i=1..40);
|
|
MATHEMATICA
|
Table[p = i^i; k = 1; While[IntegerDigits[p] != Take[IntegerDigits[x = NextPrime[p*10^k]], IntegerLength[p]], k += 1]; x, {i, 18}] (* Jayanta Basu, Aug 09 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|