Two remarks on the Collatz cycle conjecture
classification
🧮 math.NT
keywords
collatzconjecturecycleproblemalgorithmicarithmeticbelagabounds
read the original abstract
We give a short proof of Belaga's result on bounds to perigees of $(3x+d)$-cycles of a given oddlength. We also reformulate the Collatz cycle conjecture which is rather a algorithmic problem into a purely arithmetic problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.