The Syracuse falling-time conjecture for Mersenne-type integers
Let denote the Syracuse falling time of an odd positive integer . Mersenne Syracuse falling-time conjecture.
for all .
The assertion agrees with computations through , following a finite-range pattern in which the Syracuse falling time equals for all tested exponents from onward. Its validity for all larger exponents is open.
References
- Shalom Eliahou, Jean Fromentin and Rénald Simonetto, “Is the Syracuse falling time bounded by 12?”, arXiv:2107.11160 (2021).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.