|
|
A275338
|
|
Smallest prime p where a base b with 1 < b < p exists such that b^(p-1) == 1 (mod p^n).
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Smallest prime p such that A254444(i) >= n, where i is the index of p in A000040.
For n > 1, a(n) is a term of A134307.
For n > 1, smallest prime p such that T(n, i) < p, where i is the index of p in A000040 and T = A257833.
a(4) > 5*10^8 if it exists (see Fischer link).
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 3: p = 113 satisfies 68^(p-1) == 1 (mod p^3) and there is no smaller prime p such that p satisfies b^(p-1) == 1 (mod p^3) for some b with 1 < b < p, so a(3) = 113.
|
|
PROG
|
(PARI) a(n) = forprime(p=1, , for(b=2, p-1, if(Mod(b, p^n)^(p-1)==1, return(p))))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more,bref
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|