OFFSET
1,1
COMMENTS
It is conjectured that solutions for p1^n + p2^n = p3 (where p1, p2, and p3 are all primes and n is a natural number) exist only when n is itself a power of two (when n is a number in A000079); and would have infinitely many solutions.
But it's proven that either p1 or p2 must be 2.
LINKS
Mykhailo Papenko, Table of n, a(n) for n = 1..8079
Mykhailo Papenko, Primes-Made-Up-of-Primes, GitHub.
FORMULA
p^64 + 2^64 in A000040.
MATHEMATICA
Select[Prime[Range[2255]], PrimeQ[#^64+2^64]&] (* James C. McMahon, Nov 19 2024 *)
PROG
(Java) /* see link for code with instructions */
CROSSREFS
KEYWORD
nonn
AUTHOR
Mykhailo Papenko, Oct 17 2024
STATUS
approved
