Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

No nontrivial Syracuse cycle of length 666

Proved
syracuse_six_cycle_eq_one

by Zexuan Liu · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

cyclesdynamical-systemsiterationnumber-theory

Let T(n)=(3n+1)/2 v2(3n+1)T(n) = (3n+1)/2^{\,v_2(3n+1)}T(n)=(3n+1)/2v2​(3n+1) be the Syracuse map. Its only positive point of period dividing 666 is 111:

T6(m)=m, m>0⟹m=1.T^{6}(m) = m,\ m>0 \quad\Longrightarrow\quad m = 1 .T6(m)=m, m>0⟹m=1.

Equivalently, the Collatz map has no nontrivial cycle whose accelerated form has length 666.

Mathematical role. With the shorter lengths this closes every accelerated cycle length up to 666. Multiplying the six step relations 2vixi+1=3xi+12^{v_i}x_{i+1}=3x_i+12vi​xi+1​=3xi​+1 around the orbit gives

(2K−729) P  =  243e5+81e4+27e3+9e2+3e1+1,\big(2^{K}-729\big)\,P \;=\; 243 e_5 + 81 e_4 + 27 e_3 + 9 e_2 + 3 e_1 + 1 ,(2K−729)P=243e5​+81e4​+27e3​+9e2​+3e1​+1,

with PPP the product of the orbit and eje_jej​ its elementary symmetric functions. Positivity of the right side forces 2K>7292^{K}>7292K>729, hence 2K≥10242^{K}\ge 10242K≥1024 and a margin of 295295295 — a generous one, so the comparison already fails once every orbit point is at least 777.

This case is notably easier than length 555, where the margin was only 131313 and the threshold rose to 333333. The margin is governed by how far the least power of two above 3a3^{a}3a has to reach, and at a=6a=6a=6 it reaches from 729729729 to 102410241024.

On the residual step. Earlier exclusions each finished with a hand check that no small value is periodic of that particular length. That is no longer needed: it is now known that no nontrivial TTT-cycle contains an element at most 333333, whatever its length, so the threshold 777 obtained here is immediately enough. The exclusion therefore consists of the symmetric-function comparison alone.

Formalization note. No oddness hypothesis is needed: a point of period dividing 666 under TTT is automatically odd. The statement covers lengths 111, 222, 333 and 666 simultaneously, since each divides 666.

Preamble
import Mathlib
import Definitions.Def_syracuseStep
Formal statement
theorem syracuse_six_cycle_eq_one (m : ℕ) (hm : 0 < m) (hcyc : syracuseStep^[6] m = m) :
    m = 1 := by sorry
Source
https://en.wikipedia.org/wiki/Collatz_conjecture; supporting lemma for the prove2.me mission goal theorem CollatzMission.collatz_conjecture (Collatz Conjecture mission). Jeffrey C. Lagarias, The 3x+1 Problem and Its Generalizations, Amer. Math. Monthly 92 (1985), 3-23, Section 8 (cycles), https://websites.umich.edu/~lagarias/3x%2B1.html

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me