Zaremba's conjecture at bound 5 for powers of 7
- Kind
- Computation (explicit witnesses, checked by exact Euclid), with a proved doubling lemma
- Status
- Witnesses checked by exact arithmetic and held by a falsifier agent; unrefereed
- Prior work
- Komatsu (2005) has odd parts 1 to 11; bound 6 for every power of 7 is Shulga's (2023); bound 5 beyond odd part 11 is not in the sources read
On this page
The statement
Zaremba's conjecture says that every has an , coprime to , for which all the quotients of Euclid's algorithm on (the partial quotients of ) are at most 5. Bound 6 is known for every power of 7; bound 5 for every power of 7 is open.
Result. Bound 5 holds for every whose exponent has odd part at most 41, and for . The first open exponent is 45.
Two proved facts turn finitely many witnesses into infinitely many exponents. Call a witness S1 when its quotient sequence begins and ends with a quotient from 2 to , at bound .
- Doubling. An S1 numerator of at bound , for from 3 to 5, gives a numerator of at bound for every . So one S1 numerator per odd part settles every exponent with that odd part.
- "S1 is kept" under the folds used to build longer witnesses.
Check it yourself
S1 numerators at bound 5 for , odd (run Euclid on and every quotient is at most 5):
| numerator | number of quotients | |
|---|---|---|
| 1 | 2 | 2 |
| 3 | 72 | 5 |
| 5 | 3469 | 9 |
| 7 | 187440 | 13 |
| 9 | 8453376 | 22 |
| 11 | 410505146 | 23 |
| 13 | 25426309987 | 32 |
| 15 | 995852075430 | 38 |
| 17 | 73173037382640 | 41 |
| 19 | 4402150398387787 | 46 |
| 21 | 207554712365340118 | 51 |
For example, and . The witnesses for odd parts 23 to 41, and the 47 witnesses for , are longer and are listed in the same way in the source.
Worked examples
How the odd parts were covered.
- Odd parts 1 to 11: Komatsu (2005), whose 11 printed expansions were recomputed and match.
- Odd parts 13 to 21: numerators found by search (the table above).
- Odd parts 23 to 29: S1 numerators from a near-fold probe.
- Odd parts 31 to 41: S1 numerators built as two-step fold lines.
- : 47 numerators, folds by and of middle words of and , each checked twice. None is S1, so is not settled by doubling.
At smaller bounds, the same way: bound 4 holds for odd part at most 15 (first open ), bound 3 for odd part at most 13 (first open ), and bound 2 fails at , as Komatsu states.
Status and who checked it
- Checked by computation, exactly. Every numerator is checked by Euclid's algorithm on in exact integers. The numerators were checked by the job that found them, by a separate script, and again by a falsifier agent's own program.
- Proved. The folding lemma, "S1 is kept" and doubling, with their proofs held by a falsifier agent.
- Open. Bound 5 for every power of 7 is one infinite statement; each single exponent, 45 included, is a finite search that settles that exponent only. Unrefereed.
Prior work
Credited. Komatsu (2005) gives bound 3 for with in . Shulga (2023, Theorem 1.2) gives bound 6 for every other than and , so for every power of 7. The folding lemma is classical (Mendès France 1973). For almost every , Huang proved bound 5, after Bourgain and Kontorovich's bound 50.
Searches run. A literature search found no source that settles bound 5 for powers of 7 beyond Komatsu's odd parts 1 to 11; Ayadi and Komatsu (2024) add nothing for powers of 7 (abstract read). Bound 5 beyond odd part 11 is not in the sources read. No wider search was made.
Still owed. A logged search beyond the sources read. A 2026 preprint by Zhang (arXiv 2605.02518), not checked, claims Zaremba's conjecture with a large absolute constant; if it stands, the constant 5 is what remains open.
Further reading
- Shulga, arXiv 2310.09801
- Huang, arXiv 1310.3772
- Bourgain and Kontorovich, arXiv 1107.3776
- Komatsu (2005), on Zaremba numerators for powers of 7 at bound 3.