|
|
A114245
|
|
Number of Fermat pseudoprimes to base 3 less than 10^n.
|
|
7
|
|
|
0, 1, 6, 23, 78, 246, 760, 2155, 5804, 15472, 39871, 102839
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Table[Count[Select[Range[2, 10^6], ! PrimeQ[#] && PowerMod[3, # - 1, #] == 1 &], x_ /; x < 10^n], {n, 6}] (* Robert Price, Jun 09 2019 *)
|
|
PROG
|
(PARI) isFps(n, b)= { if(isprime(n), return(0) ) ; if( (b^(n-1)) % n == 1, return(1), return(0) ) ; } { a=0 ; e=1 ; for(n=1, 10^12, if( n == 10^e, e++ ; print(a) ; ) ; a += isFps(n, 3) ; ) ; } \\ R. J. Mathar, Feb 10 2007
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|