Two reversed primes in prime bases

Less than 1 year old · traced to

Let bb be a fixed prime, and let p←\overleftarrow{p} denote the digit reversal of a prime pp in base bb. Two-reversed-prime conjecture. Every sufficiently large even integer NN can be expressed as

N=p1←+p2←.N=\overleftarrow{p_1}+\overleftarrow{p_2}.

The analogous assertion fails infinitely often for infinitely many composite bases, including base 1010, because reversed primes can have large gaps caused by restrictions on their leading digits. The conjecture proposes that the binary representation should hold in every fixed prime base; the paper indicates that the ternary version is expected in most bases.

References

Primary source

Michael Harm and Daniel R. Johnston, “The reverse Goldbach problem and a refined Zsiflaw–Legeis theorem”, arXiv:2605.21876 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.