|
|
A353942
|
|
Smallest b > 1 such that b^(p-1) == 1 (mod p^9) for p = prime(n).
|
|
8
|
|
|
513, 19682, 280182, 14906455, 676386984, 822557039, 8185328614, 1835323405, 147534349327, 430099398783, 746688111476, 3054750102760, 9430469115218, 42562034654367, 92084372092298, 28307243117603, 17362132628379, 430275700643181, 478910674129864, 69114209866295
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n) = my(p=prime(n)); for(b=2, oo, if(Mod(b, p^9)^(p-1)==1, return(b)))
(Python)
from sympy import prime
from sympy.ntheory.residue_ntheory import nthroot_mod
def A353942(n): return 2**9+1 if n == 1 else int(nthroot_mod(1, (p:= prime(n))-1, p**9, True)[1]) # Chai Wah Wu, May 17 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|