|
|
A124991
|
|
Primes of the form 10k+1 generated recursively. Initial prime is 11. General term is a(n)=Min {p is prime; p divides (R^5 - 1)/(R - 1); Mod[p,5]=1}, where Q is the product of previous terms in the sequence and R = 5Q.
|
|
1
|
|
|
11, 211, 1031, 22741, 41, 15487770335331184216023237599647357572461782407557681, 311, 61, 55172461, 3541, 1381, 2851, 19841, 151, 9033671, 456802301, 1720715817015281, 19001, 71
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
All prime divisors of (R^5 - 1)/(R - 1) different from 5 are congruent to 1 modulo 10.
|
|
REFERENCES
|
M. Ram Murty, Problems in Analytic Number Theory, Springer-Verlag, NY, (2001), pp. 208-209.
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 1031 is the smallest prime divisor congruent to 1 mod 10 of (R^5 - 1)/(R - 1) = 18139194759758381 = 1031 * 17593787351851, where Q = 11 * 211 and R = 5Q.
|
|
MATHEMATICA
|
a={11}; q=1;
For[n=2, n<=6, n++,
q=q*Last[a]; r=5*q;
AppendTo[a, Min[Select[FactorInteger[(r^5-1)/(r-1)][[All, 1]], Mod[#, 10]==1&]]];
];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|