The Curling Number Conjecture
TheoremDB P12359 · integer sequences
Inferred from the community field; finer classification has not been reviewed.
Problem statement
For a finite nonempty integer sequence S, write S=XY^k with Y nonempty and k as large as possible, and call k the curling number of S. Starting from any S and repeatedly appending its curling number, must the evolving sequence eventually append ?
Lean 4
Formal statement
The formalization is available at the source below; its code is not attached here yet.
On-site verification needs an executable Lean target. None is attached yet.
A source attachment or link is not a verified proof. The statement’s correspondence with the original question needs human review.
Proofs & verification
No Lean has been submitted for this problem yet. A Lean file can be attached to a submission for review, though with no target here it cannot be machine-checked.
Progress & source assessment
Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.