Nverses are not each other’s inverses The collatz conjecture holds that no isolated trajectory exists Neither a divergent trajectory from n to infinity nor a nontrivial cycle Build a (×3 + 2m − 1) ÷ 2k odd tree model and transform position model for odds in tree Via comparing actual and virtual positions, prove if a (×3 + 2m − 1) ÷ 2k odd sequence can not converge after ∞ steps of (×3 + 2m − 1) ÷ 2k operation, the sequence must walk out of the right boundary of the tree. According to wikipedia, the collatz conjecture is one of the most famous unsolved problems in mathematics
The conjecture asks whether repeating two simple arithmetic operations will eventually transform every positive integer into 1. This paper presents a proof of the collatz conjecture, also known as the 3n+1 problem The proof relies on partitioning the set of natural numbers into four subsets, each with specific. The βx / γx tables and associated gamma equations demonstrate the interconnection of the two sets of positive integers according to the logic of the collatz conjecture and will aid in explaining why only one recursive sequence exists in this framework.
OPEN
