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 an algorithmic problem into a purely arithmetic problem.
Two Remarks on the Collatz Cycle Conjecture
2015
How this score is calculated
It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.