The climb to a square
- Kind
- Conjecture, checked by computer for every start below = 10,000,200,001
- Status
- Holds up under agent review; not proved; unrefereed
- Prior work
- Not found in the searches logged. Without the +1 it is Brocard's walk of 1904, which provably never lands; Weintraub's 2004 note is still unread
On this page
The statement
Any whole number sits just above a square: , where is the largest square not above and is the leftover, from 0 to . The step replaces by . As a formula, .
Conjecture. From every whole number , repeating the step eventually reaches a perfect square. (A start that is already a square counts as landed.)
The number grows at every step, so the climb can never loop; the only question is whether it ever hits a square exactly.
Brocard's walk, credited. Without the "+1", the rule was studied by H. Brocard in 1904 and is OEIS A094761, whose entry says the walk "is eventually constant iff n is a perfect square": from a non-square it never lands. The +1 rule is that walk shifted by one: if is not a square, , where is Brocard's step. So the conjecture can be restated in Brocard's terms: every walk of his from a non-square passes a number . The claim here is the +1 form only.
Check it yourself
- From 7: , a square.
- From 3: .
- The one door onto a square. For : if , the next number is , whose leftover is odd, so it is not a square. If , the next number is , a square exactly when . So a step lands only from : the doors 2, 6, 12, 20, 30, 42, 56, …, each stepping onto the next square.
- A slow start: 2602 takes 78,220 steps and lands on = 1,540,719,504; it is the slowest start up to 3000.
- The slowest start below : the climb from lands on after 86,942,332,668 steps.
Worked examples
Status and who checked it
- Checked by computer: every start below = 10,000,200,001 reaches a square, by two independent exact programs (all 200,001 chains born at blocks up to followed to landing, no cap), and every start below 400,040,001 by a third.
- Proved (short arguments by agents, checked by a falsifier agent and a reviewer agent): the climb always grows; the one door above; the step is one-to-one, and the numbers never stepped onto are exactly the (in the shifted form this is Wenders' 2012 proof of a conjecture of Mathar's in OEIS A094761, credited to them); exactly chains pass through block and exactly one of them leaves through its door; and no climb can follow a fixed formula in the block size for ever (such eternal families exist for the neighbouring rule , OEIS A094766).
- Why it is believed, and why it is tense. If one chain in lands in block at random, every climb lands, but the expected landing is infinite: an "infinite-mean borderline". The data follow that model: of the 100,000 climbs from squares , 50,204 land past , 9,940 past , 1,004 past , 110 past and 14 past , against the model's share .
- Open: the claim itself, and even a weaker statement such as "a positive share of starts land".
- Who checked it: a falsifier agent and a reviewer agent, each with its own code; a third agent tried to read Weintraub's note. No human referee has read it.
Prior work
Searches run. The falsifier agent made 41 searches that returned (OEIS 33, arXiv 7, zbMATH 1) and 15 web searches, and searched Lagarias's two annotated 3x+1 bibliographies by hand. The reviewer agent made 27 (OEIS 22, arXiv 4, zbMATH 1) and 5 web searches, and read about 45 OEIS entries citing the square-excess sequence A053186 by hand. On 2026-11-19 a keyed CORE search made 7 requests and got 20 records, none relevant; CORE holds no record of Weintraub's note. The claim was not found in the searches logged.
The main caveat: Weintraub's note is unread. S. H. Weintraub's three-page note "An interesting recursion" (2004) is cited in the OEIS entries for Brocard's walk. Its zbMATH review describes only the rules with a fixed whole number , and names no "+1" form; but a three-page note can hold a remark that a review leaves out, and no legal free copy was reached.
Nearest relatives, credited to their authors.
- Brocard (1904) and OEIS A094761, A094763, A094764: the walk , this rule shifted by one, with the opposite fate.
- Cloitre (2009), OEIS A156344: "We conjecture sequence is never zero", that is, every start reaches a square, for a different map, . Same shape of claim, different rule; the reviewer agent says any write-up should cite it.
- OEIS A094765 and A094766 (, which has eternal trajectories); OEIS A159016 and A159258 ( "contains infinitely many squares"); Allouche, Stipulanti and Yao (doubling modulo a fixed odd number).
Still owed: the text of Weintraub's note and of Brocard's 1904 note; Google Scholar; the MathSciNet review of the note; works citing the note; Guy's Unsolved Problems in Number Theory.
Further reading
- S. H. Weintraub, "An interesting recursion", Amer. Math. Monthly 111 (2004) 528–530.
- H. Brocard, L'Intermédiaire des Mathématiciens (1904), Note 2837.
- OEIS A094761, "n + (square excess of n)".
- OEIS A156344 (Cloitre).
- Allouche, Stipulanti and Yao, arXiv:2504.17564