A Brief Analysis of the Collatz Conjecture

Algorithm for the Collatz Conjecture. 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. We claim over the Collatz sequence of positive odd integers, from to where the index, t, is the number of trials it takesContinue reading “A Brief Analysis of the Collatz Conjecture”