2021
DOI: 10.1155/2021/5754439
|View full text |Cite
|
Sign up to set email alerts
|

Novel Theorems and Algorithms Relating to the Collatz Conjecture

Abstract: Proposed in 1937, the Collatz conjecture has remained in the spotlight for mathematicians and computer scientists alike due to its simple proposal, yet intractable proof. In this paper, we propose several novel theorems, corollaries, and algorithms that explore relationships and properties between the natural numbers, their peak values, and the conjecture. These contributions primarily analyze the number of Collatz iterations it takes for a given integer to reach 1 or a number less than itself, or the relation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…• Schwob et al [10] proposed several novel theorems, corollaries, and algorithms that explore relationships and properties between the natural numbers, their peak values, and the conjecture.…”
Section: Introductionmentioning
confidence: 99%
“…• Schwob et al [10] proposed several novel theorems, corollaries, and algorithms that explore relationships and properties between the natural numbers, their peak values, and the conjecture.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, a preprint claimed to have reached the solution, but the file still is not posted [22]. More recently, a paper [23] indicates the intractable nature of the conjecture.…”
Section: Introductionmentioning
confidence: 99%