Id: palomar/PALOMAR-2026-11-11-000001 Url: https://github.com/veljjanoski/oeis100475-palomar/tree/0968200356e449a24a023264821d4ea966091cf0 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-11-000001-v1.json Repo: https://github.com/veljjanoski/oeis100475-palomar Tags: math.NT, msc:11A63, msc:11N05, msc:11B83 Score: 0 Title: OEIS A100475: the reverse-prime map never loops Trust: high Domain: math.NT Source: palomar Authors: Daniel Veljjanoski Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-11 Formalized: true Formalizes: title=A100475: Prime-th recurrence with reversal at each step identifier= relationship=formalizes Formalizes: title=Essai sur la théorie des nombres (2nd ed.) identifier= relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-11-000001 Let f(y) be the decimal reversal of the y-th prime (f(1) = 2, f(2) = 3, f(5) = 11, f(11) = 13). OEIS A100475 is the orbit of 1 under f, and its entry asks (Jonathan Vos Post, 2004) whether the orbit of any other positive start ever enters a loop. This project proves that it never does, i.e. the negation of the formal-conjectures statement OeisA100475.conjecture: the number of digits never decreases along an orbit (p_y > y, and a prime never ends in 0), so on a cycle it is a constant D and every cycle element v satisfies p_v = 5 it contradicts the bound pi'(10^D) = 9 by Chebyshev's bound…