Some elements of a possible demonstration of the Collatz conjecture
Abstract
In this paper we are shown the following facts: The probability of increased Ak=P(Tk (x0)>Tk-1 (x0)) , and the probability of decrease Bk=P(Tk (x0)<Tk-1 (x0)) in step k of a Collataz procedure initiated in x 0 ∈ N arbitrary, they are equal for all values of k . This influences on the law that generates the numbers of a Collatz sequence so that it is forced to decrease until the unit. Also is shown in the Collatz conjecture is false for every problem an +b such that a≥ 5≥ b+2, and your probabilistic caracter can not be ignored if you want to get to the definitive solution, among other interesting arguments.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.