The floor-√3 map
- Kind
- Conjecture, checked by computer for every start up to
- Status
- Holds up under agent review; not proved; three smaller facts proved; unrefereed
- Prior work
- Not found in the searches logged; the rounded-up √3 map (OEIS A264789) and other relatives are in print
On this page
The statement
Take a positive whole number .
- If is even, the next number is .
- If is odd, the next number is : multiply by and drop the decimals.
1 is odd and , so the game stops at 1.
Conjecture. Every positive start, followed long enough, reaches 1.
Two odd steps in a row multiply by twice, so they give exactly or (proved). The rule hides a -type step, and the factor 3 never cancels against halving: the same clash of 2 and 3 that keeps Collatz open.
Check it yourself
- Exact arithmetic. is the integer square root of , so the rule can be run exactly for numbers of any size.
- The hidden . , and .
- The computer check. Every start up to reaches 1, checked by three agents' own programs, each over its range.
- The loop bound. The only loop of length up to 400 is , and any other loop would need at least 398,655 steps.
Worked examples
- 9 reaches 1 in 12 steps: (figure 1).
- 7 reaches 1 in 8 steps: .
- 31 is the slow one: every other start up to 40 needs at most 21 steps, but 31 needs 89 and climbs to 3836 on the way. It plays the role 27 plays in Collatz.
Status and who checked it
- Checked by computer: every start up to (the builder agent to ; a falsifier agent, with its own code, every odd start from 3 to drops below itself; a reviewer agent extended that to ). No loop but of length up to 400. 18,184 aimed starts up to and 1600 random starts of 20 to 160 digits all reach 1.
- Proved (by agents, checked by agents): two odd steps in a row give or ; no orbit stays odd forever (a five-line base-3 digit argument); the hidden block repeats at most 4 times in a row. With in place of the claim is proved, by a reviewer agent's short descent argument.
- Open: the conjecture itself. None of the three facts above proves that every orbit comes down.
- Who checked it: a falsifier agent, an adversarial reviewer agent and a targeted prior-work agent. No human referee has read it.
Prior work
Searches run. Three agents searched: OEIS by computed terms (step counts, trajectories, odd-step counts, peaks, records; no hits) and by words; Lagarias's two annotated 3x+1 bibliographies, searched for "sqrt", "floor", "irrational" and the relatives' names; MathOverflow and Math Stack Exchange; arXiv and the web. On 2026-11-18, 11 CORE searches followed. The rule and the claim were not found in the searches logged.
Nearest relatives, credited to their authors:
- Althöfer and Zipproth (2025) study the family odd part of for , . This map is at most a boundary member, ; they do not single it out or state this claim.
- Mignosi (1995) studied for odd with halving (rounding up) and proved the case; Brocco (1995) found counterexamples for Pisot and Salem multipliers, of which is neither.
- OEIS A264789 (Lagneau 2015) is the map rounded up, which has extra loops.
Still owed: a Google Scholar search; Mignosi's and Brocco's papers in full (read here through reviews and abstracts only); te Riele's papers; Guy's Unsolved Problems in Number Theory. CORE holds none of the known papers on these maps, so its empty result adds little.
Further reading
- OEIS A264789, the √3 map rounded up.
- J. C. Lagarias, annotated bibliographies of the 3x+1 problem, arXiv math/0309224 and arXiv math/0608208.
- F. Mignosi, "On a generalization of the 3x+1 problem", J. Number Theory 55 (1995), 28–45, doi:10.1006/jnth.1995.1125.
- Brocco, J. Number Theory 52 (1995), 173–178, doi:10.1006/jnth.1995.1063.