Free 2-3-6 button machines
- Kind
- Half known, half conjecture: the "if" half is Klarner's 1982 theorem; the "only if" half is checked at every ratio of height up to 100
- Status
- The "only if" half holds up under agent review; not proved; unrefereed
- Prior work
- The "if" half is Klarner's (1982); the converse was not found in the searches logged
On this page
The statement
Pick numbers , , and make three buttons:
- 2: ;
- 3: ;
- 6: .
Pressing buttons in a row (a word, written 2.6 for "press 2, then 6") builds a map . Two different words that build the same map are a collision. The choice of is free when it has no collision at all.
Everything depends on one number, the ratio : renaming the number line keeps and every collision, and two choices with the same are renamed copies of each other.
Klarner's theorem (1982), not claimed here. If is , or , the buttons are free. These are his six triples , , , , and and their renamed copies. Run backwards, their buttons cut a stick into a half, a third and a sixth that fit exactly (), so every point of the stick has one address.
Conjecture (the "only if" half). Every other rational has a collision. So the buttons , , are free if and only if is , or . (Every irrational is free, since a collision is a linear equation with whole-number coefficients that fixes a rational ; so the claim is about rational .)
Check it yourself
- A collision at (). The word 2.6 gives , then . The word 3.2.2 gives , then , then . From : and .
- A longer one at (). The words 3.6.2.6.2.3 and 2.3.3.3.2.3.2.2 (6 and 8 presses) both build ; both take 1 to 1959.
- Each pair of short words fixes one ratio. 6 against 2.3 collide exactly when ; 6 against 3.2 when ; 2.6 against 6.2 when ; 3.6 against 6.3 when ; 2.3 against 3.2 when (" is infinite").
- A free choice, , , (). Undo each button: , , . They carry the stick onto , and : a half, a third and a sixth, end to end, with no overlap.
Worked examples
Status and who checked it
- Proved, and not claimed here: the "if" half (Klarner 1982; a ping-pong argument on the stick).
- Proved (checked line by line by a reviewer agent): decides freeness, and every irrational is free.
- Checked by computer (complete searches, each collision re-checked in exact arithmetic):
- every reduced ratio with and at most 100: 12,176 ratios, and all but the three free ones collide (12,173 collisions); the longest needs an 18-letter word, at ;
- 1,460 more ratios crowding in on the three free values (denominators 101 to 300): all collide. Near those values the collisions grow long (the largest smallest-collision multiplier is 2,176,782,336, at ) but never stop appearing;
- 400 random ratios with denominators 101 to 1000: all collide;
- at each of , and , no collision among the 96,959,662 words with multiplier up to .
- Open: the "only if" half. Nobody has a proof; the search is finite.
- Who checked it: a falsifier agent and an adversarial reviewer agent, each with its own code. The reviewer confirmed the claim with three corrections, all carried here: a missed neighbouring paper (below), a narrower statement about the density of orbit sets, and a count (4,405 ratios of height at most 60, not 4,406). No human referee has read it.
Prior work
Searches run. A falsifier agent and a reviewer agent each kept a prior-work log (OEIS, arXiv, the web, and Lagarias's annotated 3x+1 bibliography); both logs pass the literature-search gate. On 2026-11-19 a keyed CORE search made 7 requests and got 23 records: 6 relatives, none with the same claim or rule. The converse was not found in the searches logged. On 2026-11-22, a Google Scholar sweep (5 queries) found no prior work stating this claim.
Known parts, credited to their authors.
- Klarner (1982) proved the "if" half and found the six triples. His paper was read only through Lagarias's bibliography (entry 97), not in full.
- Crampin and Hilton (unpublished, via Lagarias) used the collision for , , to answer an Erdős question about density; that a collision gives density zero is their argument.
- Konyagin, Protasov and Talambutsa (2025) proved the matching "free if and only if the pieces tile" statement for buttons that all share one prime slope. Their footnote says freeness "is still open for integer affine functions". This is the nearest relative.
- Kolpakov and Talambutsa, Shamazov and Talambutsa, and Kalmynin (density zero for Klarner's six) are relatives; none states or asks this converse.
Still owed: the full text of Klarner 1982; Lagarias's 2016 survey, section 8.9, the likeliest place for a remark on the converse; Guy's Unsolved Problems in Number Theory; Math Stack Exchange and MathOverflow.
Further reading
- Klarner, "A sufficient condition for certain semigroups to be free" (1982).
- Konyagin, Protasov and Talambutsa, arXiv:2502.13066 (2025)
- Kolpakov and Talambutsa, arXiv:2105.09387
- Shamazov and Talambutsa, arXiv:2507.06875
- Kalmynin, arXiv:2611.22034
- Lagarias, annotated bibliography of the 3x+1 problem, entry 97.