|
Search: id:A114207
|
|
|
| A114207 |
|
Smallest solution to 10^m=1 (mod m) having a particular prime divisor A066364(n). |
|
+0
2
|
|
| 3, 111, 13203, 20439, 1997001, 22494039, 116226009, 761157, 278522253, 206613747, 17677747557, 835525881, 12933400720959, 228717562653, 5465090439, 13095850041, 431138536893, 4734551277, 58199580096201, 59875330325409
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n)=m(p), where p=A066364(n) and m(p)=lcm(p, ord_p(10), m(q)) with q going over all prime divisors of ord_p(10).
|
|
EXAMPLE
|
a(6)=m(5477)=22494039 since it is the smallest m such that 10^m=1 (mod m) and 5477|m.
|
|
PROGRAM
|
(PARI) m(p) = local(f, l, q); f=factorint(p)[, 1]; l=p; for(i=1, length(f), q=znorder(Mod(10, f[i])); l=lcm(l, q); l=lcm(l, m(q)) ); l
|
|
CROSSREFS
|
Cf. A066364.
Sequence in context: A114738 A111091 A066138 this_sequence A128684 A037116 A054330
Adjacent sequences: A114204 A114205 A114206 this_sequence A114208 A114209 A114210
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Max Alekseyev (maxal(AT)cs.ucsd.edu), Nov 17 2005
|
|
|
Search completed in 0.002 seconds
|
