|
| |
|
|
A066364
|
|
Prime divisors of solutions to 10^n=1 (mod n).
|
|
5
| |
|
|
3, 37, 163, 757, 1999, 5477, 8803, 9397, 13627, 15649, 36187, 40879, 62597, 106277, 147853, 161839, 215893, 231643, 281683, 295759, 313471, 333667, 338293, 478243, 490573, 607837, 647357, 743933, 988643, 1014877, 1056241
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| Max Alekseyev, Table of n, a(n) for n = 1..501 (complete up to 10^10).
A. A. Khan and S. Wagstaff, Factor calculator
|
|
|
FORMULA
| A prime p is in A066364 iff all prime divisors of ord_p(10) are in A066364, where ord_p(10) is the order of 10 modulo p. - Max Alekseyev (maxale(AT)gmail.com), Nov 16 2005
|
|
|
EXAMPLE
| 10^27-1 = 3^5*37*757*333667*440334654777631 is a solution to the congruence.
|
|
|
PROG
| (PARI) S=Set([3]); forprime(p=7, 10^6, v=factorint(znorder(Mod(10, p)))[, 1]; if(length(setintersect(S, Set(v)))==length(v), S=setunion(S, [p])) ); print(vecsort(eval(S))) } (Alekseyev)
|
|
|
CROSSREFS
| Cf. A014950, A001270, A027889, A007138, A114207.
Sequence in context: A046867 A154823 A109835 * A106995 A120076 A119938
Adjacent sequences: A066361 A066362 A066363 * A066365 A066366 A066367
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 21 2001
|
|
|
EXTENSIONS
| Edited by Max Alekseyev (maxale(AT)gmail.com), Nov 16 2005
|
| |
|
|
