English

Some elements of a possible demonstration of the Collatz conjecture

Number Theory 2017-07-04 v7

Abstract

In this paper we are shown the following facts: The probability of increased Ak=P(Tk(x0)>Tk1(x0)) A_{k}=P(T^{k} (x_{0})>T^{k-1} (x_{0})) , and the probability of decrease Bk=P(Tk(x0)<Tk1(x0))B_{k}=P(T^{k} (x_{0})<T^{k-1} (x_{0})) in step k k of a Collataz procedure initiated in x0N x_ {0} \in \mathbb{N} arbitrary, they are equal for all values of k 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+ban +b such that a5b+2a\geq 5\geq b+2, and your probabilistic caracter can not be ignored if you want to get to the definitive solution, among other interesting arguments.

Keywords

Cite

@article{arxiv.1512.05438,
  title  = {Some elements of a possible demonstration of the Collatz conjecture},
  author = {Denis Martínez Tápanes and Jose E. Martínez Serra},
  journal= {arXiv preprint arXiv:1512.05438},
  year   = {2017}
}