2020viXraRequires access

Proving the Collatz Conjecture

James Edwin Rock

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Collatz conjecture, Integer (computer science), Combinatorics, Mathematics, Sequence (biology), Number theory, Geometric series, Conjecture

Related papers

Back to paper searchBrowse research topicsOriginal source
Proving the Collatz Conjecture — Research Paper | ScholarLens