Loops in the reverse-prime map

Start with a positive integer y. Replace it by the decimal reversal of the y-th prime, then repeat. Can this process ever revisit a value and enter a loop?

Why it matters and what counts as progress

Why it matters: Reversing digits can make the next value smaller even though the y-th prime is larger than y. The question is whether that behavior can persist in a cycle.

What counts as progress: A looping orbit would settle the question positively. To rule out loops, a proof must exclude them for arbitrary positive starting values, including digit lengths beyond any finite search.

How the problem developed

  1. 2004 · Looping question [3]

    Jonathan Vos Post Asked whether the reverse-prime map can enter a loop from a positive start other than 1.

  2. 11 Nov 2026 · Lean-checked exclusion of cycles [1][2]

    Daniel Veljjanoski with Claude Fable 5.1 Reported that the digit count forces any cycle into a range where exact finite checks or prime-counting bounds rule it out.

AI contribution

Sources

  1. Palomar entry for the reverse-prime map
  2. Pinned proof provenance and checking record
  3. Formal Conjectures statement for OEIS A100475
Publication history