|
|
A353940
|
|
Smallest b > 1 such that b^(p-1) == 1 (mod p^7) for p = prime(n).
|
|
8
|
|
|
129, 2186, 32318, 82681, 758546, 6826318, 21444846, 44702922, 178042767, 393747520, 1548729003, 4741156070, 2203471139, 3242334565, 16609835418, 114175761515, 30338830655, 20115543070, 114457309347, 370162324382, 57877856575, 12692933349, 280646695286, 127762186531
(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^7)^(p-1)==1, return(b)))
(Python)
from sympy import prime
from sympy.ntheory.residue_ntheory import nthroot_mod
def A353940(n): return 2**7+1 if n == 1 else int(nthroot_mod(1, (p:= prime(n))-1, p**7, True)[1]) # Chai Wah Wu, May 17 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|