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
- 2004 · Looping question [3]
Jonathan Vos Post Asked whether the reverse-prime map can enter a loop from a positive start other than 1.
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
OEIS A100475: the reverse-prime map never loops
For every positive integer starting value other than 1, repeatedly taking the decimal reversal of the prime with that index never produces an ultimately periodic sequence.
Sources
Publication history
Daily emails by default, only when there’s an update.