|
Search: id:A125649
|
|
|
| A125649 |
|
Smallest odd prime base q such that p^8 divides q^(p-1) - 1, where p = Prime[n]. |
|
+0
12
|
|
| 257, 13121, 3124999, 3376853, 174625993, 533810141, 16048035481, 3620189879, 982740799, 547344139109, 497929938133, 1105109875657, 15682480615619, 1391016035411, 83209719751, 84224951222611, 165554755409789, 254747341131683, 701000310909907, 317304132615017, 917421908003257, 2273566506180509, 2937063622496383, 134186278445239, 2575293205382633, 325439622769111, 13681092144333227, 546773261973599, 11892216987581971, 10809114739524391
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
W. Keller and J. Richstein Fermat quotients that are divisible by p.
|
|
MATHEMATICA
|
Do[p = Prime[n]; q = 2; While[PowerMod[q, p-1, p^8] != 1, q = NextPrime[q]]; Print[q], {n, 100}] - Ryan Propper (rpropper(AT)stanford.edu), Apr 01 2007
|
|
PROGRAM
|
(PARI) { a(n) = local(p, x, y); if(n==1, return(257)); p=prime(n); x=znprimroot(p^8)^(p^7); vecsort( vector(p-1, i, y=lift(x^i); while(!isprime(y), y+=p^8); y ) )[1] } - Max Alekseyev (maxal(AT)cs.ucsd.edu), May 30 2007
|
|
CROSSREFS
|
Cf. A125609, A125610, A125611, A125612, A125632, A125633, A125634, A125635, A125636, A125637, A125645, A125646, A125647, A125648.
Sequence in context: A000542 A023877 A086022 this_sequence A097736 A103349 A121237
Adjacent sequences: A125646 A125647 A125648 this_sequence A125650 A125651 A125652
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 29 2006
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Apr 01 2007
More terms from Max Alekseyev (maxal(AT)cs.ucsd.edu), May 30 2007
|
|
|
Search completed in 0.002 seconds
|
