The Mersenne-type binary polynomial odd-sequence length conjecture
Let , and let the odd sequence of a polynomial be the sequence of odd polynomials obtained by the binary polynomial Collatz transformations. Let and , and set
Odd-sequence length conjecture. The length of the odd sequence of is . The claim concerns the special family and is supported by the examples and computations displayed in the source, but remains unproved there.
References
- Luis H. Gallardo and Olivier Rahavandrainy, “A variant of Collatz's Conjecture over Binary Polynomials”, arXiv:2510.07530 (2025).
Progress summary
A 2025 paper left the formula unproved, while a new reader-submitted argument claims to prove it but has not been checked.
Gallardo and Rahavandrainy formulate the conjecture for the family , predicting odd-sequence length . Their paper presents computations supporting the formula but does not prove it.
Known results
- Gallardo and Rahavandrainy (2025) prove termination for every nonzero binary polynomial, with bound .
- Their computations for give the predicted lengths for this family.
- An earlier paper (2023) proves results for related subfamilies and special cases, but not the full formula.
- The 2026 published version still labels the assertion Conjecture 3.1.
Community submission (unverified; August 25, 2026)
A submitted proof argues for an invariant subring in , derives valuation formulas for successive transformations, and claims an exact phase decomposition yielding the conjectured length. The argument is unverified.
Current status (as of August 2026): General termination is proved, but the exact length formula for the stated family remains unverified; a reader-submitted proof is the only reported new progress.
Sources
Solutions 1
This solution needs a summarySee full solution
Exact stopping times and complete phase decomposition for the Mersenne-polynomial family
Work in , and write
For a nonzero , substitution into gives
Indeed, after extracting , the remaining factor has constant term , and therefore evaluates to at both and . In particular, the entire odd trajectory starting from any element of remains in this invariant subring, where its accelerated transition is
For every integer , put
Since in characteristic two, the numerator in (4) has exact -adic valuation . Thus , and is precisely the first odd polynomial associated with the starting polynomial . If , then immediately.
Suppose henceforth that , and define
Here . Writing , where is odd, and putting , we obtain
The bracketed factor has exact -adic valuation , because is odd. Consequently,
Introduce the unaccelerated affine operator
A direct induction, using , gives the exact iterate formula
For , equation (7) shows that is a polynomial with constant term . Therefore the first accelerated transitions remove exactly one power of , and the -th removes the entire remaining -power. Hence
Now , and both and are powers of two. Therefore and . Substituting (4) into (9) yields
Moreover,
Taking the odd part of (11) consequently proves the exact phase-transition theorem
Let . If is not a power of two, write , where is a power of two and . Since , with odd, and , we have
Thus each phase strictly increases , never passes , and strictly increases its -adic valuation by (12). Iterating (13) must therefore reach a power of two, necessarily . If
then the number of accelerated odd transitions telescopes:
The initial odd polynomial is included in the odd sequence, and is its final term. Therefore the exact odd-sequence length is
The argument also determines the entire degree profile. Within the -th phase, all odd polynomials preceding the next phase have the same -degree, namely
because (10) preserves -degree. The sequence ends with the single degree . Its successive - and -valuations coincide; within a phase they equal for the first transitions, and the final transition has common valuation
Finally, under the precise hypotheses of Conjecture 3.1, take , with and . Then , so (17) gives
This proves the published conjecture for every admissible pair , and the explicit phase and degree descriptions give the full orbit rather than only its stopping time.
Source: Luis H. Gallardo and Olivier Rahavandrainy, A variant of Collatz's conjecture over binary polynomials, Revista de la Unión Matemática Argentina 69 (2026), 295–302, Conjecture 3.1.