Triple it, or subtract one and flip
- Kind
- Conjecture, checked by computer for every fraction of height up to 100,000
- Status
- Holds up under agent review; not proved; unrefereed
- Prior work
- Rule and claim not found in the searches logged; the kind of problem is in print (Javaheri 2012)
On this page
The statement
Write a positive fraction in lowest terms, . Its height is the larger of and .
- If , the next fraction is (cancel if you can).
- If , the next fraction is ; for this is .
Conjecture. Every positive fraction, followed long enough, reaches 1, and so ends in the loop . Equivalently, that loop is the only loop, and no fraction's height grows forever.
Check it yourself
- The loop closes. 1 triples to 3; , flipped is ; triples to ; , flipped is 2; , flipped is 1.
- The computer check. Every fraction of height up to 100,000 (6,079,301,507 fractions) reaches 1, by an exact induction on height.
- The loop bound. No other loop has 40 steps or fewer. So any other loop has at least 41 steps, and every fraction in it has height above 100,000.
Worked examples
- 4/7 reaches 1 in 6 steps: .
- 2/7 reaches 1 in 9 steps: .
- 5 reaches 1 in 17 steps (figure 1).
The only steps that lower a height for good are triplings that cancel a 3, such as . Some fractions climb far before they fall: climbs to height 2,433,927 at step 51 and reaches 1 at step 103.
Status and who checked it
- Checked by computer (exact arithmetic): every fraction of height up to 100,000; no other loop of 40 steps or fewer, by two separate exact searches (to length 36, then to length 40, by a different test); 10,000,000 random fractions of heights to and 95,753 aimed starts, all reaching 1.
- Proved (short arguments, checked by agent reviewers): a run of flips never raises the height, and every orbit returns to after finitely many flips; no loop other than the known one goes "flip, flip, …, triple, triple, …" once around.
- Open: that no height grows forever, and that no other loop exists. The conjecture is not proved; three routes to a proof failed.
- Who checked it: a falsifier agent that did not build it, then a reviewer agent with no stake, which repeated the counts with its own code. No human referee has read it.
Prior work
Searches run. Three agents searched with their own queries: OEIS by the rule's computed terms (steps from , from , from , the orbit of 5) and by words, arXiv, Math Stack Exchange and MathOverflow, the web, and both of Lagarias's annotated 3x+1 bibliographies by keyword. On 2026-11-18, 1 Google Scholar search and 9 CORE searches followed, with the list of works citing Javaheri 2012. The rule and its claim were not found in the searches logged.
The kind of problem is known. M. Javaheri (2012) conjectured that a different rule on fractions, also switching at 1 and built from 2 and 3, sends every fraction to 0. No change of variable turns one map into the other: every number has two arrows into it under his map, while above 3 a fraction has only one under this rule. So the rule is one more member of a kind of problem already in print.
Still owed: Javaheri's 2025 paper in J. Number Theory, which cites the 2012 one, could not be read; Guy's Unsolved Problems in Number Theory in print was not searched.