|
|
A372769
|
|
Primes p such that 2^p == p (mod nextprime(p)).
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
3 is a term because 2^3 mod nextprime(3) = 8 mod 5 = 3;
7 is a term because 2^7 mod nextprime(7) = 128 mod 11 = 7;
3499 is a term because 2^3499 mod nextprime(3499) = 2^3499 mod 3511 = 3499;
554849 is a term because 2^554849 mod nextprime(554849) = 2^554849 mod 554887 = 554849.
|
|
MAPLE
|
R:= NULL: q:= 2:
while q < 10^6 do
p:= q: q:= nextprime(p);
if 2 &^ p mod q = p then R:= R, p fi
od:
|
|
PROG
|
(Magma) [p: p in PrimesUpTo(10^6) | 2^p mod NextPrime(p) eq p];
(PARI) lista(pmax) = {my(p = 2); forprime(pnext = 3, pmax, if(Mod(2, pnext)^p == p, print1(p, ", ")); p = pnext); } \\ Amiram Eldar, May 13 2024
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|