|
|
A295645
|
|
Primes p such that tau(p) +- 1 is congruent to 0 (mod p), where tau is the Ramanujan tau function (A000594).
|
|
5
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Nik Lygeros and Olivier Rozier found a new solution to the equation tau(p) + 1 == 0 (mod p) for prime p = 692881373, on September 6 2009. - Seiichi Manyama, Dec 30 2017
|
|
LINKS
|
|
|
EXAMPLE
|
tau(11) = 534612 and 11 | (534612 - 1), so a(1) = 11.
tau(23) = 18643272 and 23 | (18643272 - 1), so a(2) = 23.
tau(691) = -2747313442193908 and 691 | (-2747313442193908 - 1), so a(3) = 691.
tau(5807) = 237456233554906855056 and 5807 | (237456233554906855056 + 1), so a(4) = 5807.
|
|
MATHEMATICA
|
Select[Prime@ Range[10^3], Function[p, AnyTrue[RamanujanTau[p] + {-1, 1}, Divisible[#, p] &]]] (* Michael De Vlieger, Dec 30 2017 *)
|
|
PROG
|
(PARI) isok(p) = my(rp=ramanujantau(p)); isprime(p) && !((rp-1) % p) || !((rp+1) % p); \\ Michel Marcus, Nov 07 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|