What was already known
Jonathan Vos Post asked in the OEIS entry for the orbit of 1 whether an orbit starting elsewhere can loop. The Formal Conjectures entry records the existence of such a start as an open statement.
AI involvement
Daniel Veljjanoski reports that a Claude Fable 5.1 agent found the digit-count argument, the finite check and the prime-counting bounds, then wrote the Lean proof. He chose the question and directed the work.
Importance
The proof reduces possible short cycles to a finite search and excludes longer cycles with exact prime-counting bounds.
Technical verification
The project reports Lean kernel checking of the registered negation, including the finite computations. The axiom audit lists only Lean’s standard axioms.
Formal checking
The project reports Lean kernel checking of the registered negation, including the finite computations. The axiom audit lists only Lean’s standard axioms.
- Checker
- Lean kernel as reported by Daniel Veljjanoski
- Scope
- 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.
- Basis
- Reported by the linked checker
- Pinned proof provenance and checking recordChecking scope
Human understanding
Veljjanoski checked the statement and the result. The project attributes the central argument to Claude and documents no separate human explanation of it.
Correction and publication history
New curated research with documented central AI work.
Read this published revision