гіпотеза Коллатца

A new branching tree model has been proposed for the first time in the direction of increasing degree 2ⁿ (merging in the reverse direction), which coincides with the direction of increasing total stopping time. It has been shown that each time corresponds to a sequence of individual numbers n(tst)→∞, the volume of which increases with time. Thus, it is proven that each time corresponds to a finite number of Collatz sequences of the same length.

In this work justified incorrectness of the algorithm proposed in the publication "M. Remer.[A Comparative Analysis of the New -3(-n) - 1 Remer Conjecture and a Proof of the 3n + 1 Collatz Conjecture. Journal of Applied Mathematics and Physics. Vol.11 No.8, August 2023"] in terms of the Collatz conjecture. And also that the transformation -3(-n) - 1 is not equivalent to Collatz's conjecture on the natural numbers 3n + 1. The obtained results can be used in further studies of the Collatz hypothesis

The work shows that the task is the problem C_3q±​1=3q±1 conjecture positive integers q>1in the reverse direction n→0 of the branching of the Jacobsthal tree, according to the rules of transformations of recurrent Jacobsthal numbers. For the first time, the Collatz problem is analyzed from the point of view of the increase in information entropy after the passage of the so-called fusion points (nodes) on the polynomials θ*2ⁿ by the Сollatz trajectories.

The power transformation of Newton's binomial forms two equal 3n±1 algorithms for transformations of numbers n belongs to N, each of which have one infinite cycle with a unit lower limit of oscillations. It is shown that in the reverse direction, the Kollatz sequence is formed by the lower limits of the corresponding cycles, and the last element goes to a multiple of three odd numbers.

It is shown that: 1. The sequence {2⁰,2¹, 2², 2³, 2⁴, 2⁵, 2⁶, 2⁷,2⁸,...} that forms the main graph m=1 of Collatz is related to the power transformation of Newton's binomial (1+1)^ξ, ξ=0, 1, 2, 3,... 2. The main K_main and side m >1 graphs and their corresponding sequences {K_main } and {K_m } are related by the relation {K_m }=m⋅{K_main }. 3.

It is shown that infinites of the subsequence of odd numbers is not a counterargument of the violation of the Collatz hypothesis, but a universal characteristic of transformations of natural numbers by the 3n + 1 algorithm. A recurrent relationship is established between the parameters of the sequence of Collatz transformations of an arbitrary pair of natural numbers n and 2n.