|
|
A087630
|
|
Number of n-digit primes ending in 1 in base 10.
|
|
5
|
|
|
0, 5, 35, 266, 2081, 17230, 146487, 1274194, 11271088, 101050133, 915755611, 8372443850, 77114409020
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) ~ (1/4) * Integral_{x=10^(n-1)..10^n} (dx/log(x)).
(End)
|
|
EXAMPLE
|
a(2) = 5 as there exist 5 two-digit prime numbers (11, 31, 41, 61, and 71) with units place 1.
a(3) = 35, since there are 35 three-digit numbers with units place digit as 1.
|
|
MATHEMATICA
|
Table[Length[Select[Range[10^n + 1, 10^(n + 1) - 9, 10], PrimeQ[#] &]], {n, 5}] (* Alonso del Arte, Apr 27 2014 *)
|
|
PROG
|
(Java) /** The terms of the sequences are generated by changing the range for j for the various numbers of digits. E.g., it ranges from 100 to 999 for three-digit numbers. */
float r, x;
int c = 0, count = 0;
for (float j = 100f; j < 1000f; j++) { for (float i = 2f; i < j; i++) { r = j % i; if (r == 0) c = 1; } if (c == 0) { x = j % 10; if (x == 1) count = count + 1; } c = 0; } System.out.println("count = " + count);
(PARI) a(n) = my(c=0); forprime(p=10^(n-1), 10^n, if(p%10==1, c++)); c \\ Iain Fox, Aug 07 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,hard,more
|
|
AUTHOR
|
Meenakshi Srikanth (menakan_s(AT)yahoo.com) and Amarnath Murthy, Sep 15 2003
|
|
EXTENSIONS
|
Offset corrected by Iain Fox, Aug 07 2018
|
|
STATUS
|
approved
|
|
|
|