Proving the Collatz Conjecture
James Edwin Rock
Abstract
James Edwin Rock
Abstract
Collatz sequences are formed by dividing an even number by two until it is odd. Then multiply by three and add one to get an even number. The Collatz conjecture states that if this process is repeated you always get back to one. Using geometric series summations we prove that a connected Collatz Structure exists, which contains all positive integers exactly once. The terms of the Collatz Structure are joined together via the Collatz algorithm. Thus, every positive integer forms a Collatz sequence with unique terms terminating in the number one.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Collatz sequences are formed by dividing an even number by two until it is odd. Then multiply by three and add one to get an even number. The Collatz conjecture states that if this process is repeated you always get back to one. Using geometric series summations we prove that a connected Collatz Structure exists, which contains all positive integers exactly once. The terms of the Collatz Structure are joined together via the Collatz algorithm. Thus, every positive integer forms a Collatz sequence with unique terms terminating in the number one.
Key concepts: Collatz conjecture, Integer (computer science), Combinatorics, Mathematics, Sequence (biology), Number theory, Geometric series, Conjecture