Algorithm for the Collatz Conjecture.
“In short the Collatz problem is simple enough that anyone can understand it, and yet relates not just to number theory (as described in other answers) but to issues of decidability, chaos, and the foundations of mathematics and of computation. That’s about as good as it gets for a problem even a small child can understand.” — Matt.
Remark: If n = 1, the algorithm terminates all computations.
Crucial Idea: R+ is a dense set.
Remark: R+ is the set of all positive real numbers.
over the Collatz sequence of positive odd integers, from to where the index, t, is the number of trials it takes the Collatz sequence of odd integers to converge to one.
Remark: There are no infinite (nontrivial) cycles of any length ( as ) in the Collatz sequence since the index, t, is clearly finite.
In addition, our claim is fundamentally based on the distribution of maximum divisors, , for the set of all positive even integers…
The positive real number, r, is determined by the algorithm for the Collatz conjecture. And therefore, its computation is generally complicated.
The variable, k, is determined by the maximum positive even number, , in the Collatz sequence: .
Can we refute our analysis?
We assume maximum divisors, , for any positive even integer.
For any appropriate positive odd integer, , we have
Remarks: The values, , are distributed according to equation one:
Moreover, is a positive real number.
Example: If we let , then we compute , , and .
Dave’s Conjecture: O(t) or for some real number, , such that either or .
Example: If we have for some , then as ,
Therefore, for infinitely many positive odd integers, .
Questions: What are the values for, ?
Relevant Reference Links:
“Counting and ordering stuff (objects, sets, numbers, spaces, etc.) are fundamental.”