Novel Theorems and Algorithms Relating to the Collatz Conjecture
Open Access
- 18 September 2021
- journal article
- research article
- Published by Hindawi Limited in International Journal of Mathematics and Mathematical Sciences
- Vol. 2021, 1-10
- https://doi.org/10.1155/2021/5754439
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 relationship between a starting number and its peak value.Keywords
This publication has 14 references indexed in Scilit:
- Xmark: Dynamic Software Watermarking Using Collatz ConjectureIEEE Transactions on Information Forensics and Security, 2019
- High-uncertainty audio signal encryption based on the Collatz conjectureJournal of Information Security and Applications, 2019
- A Novel Image Encryption Scheme Based on Collatz ConjectureEntropy, 2018
- Methods for constructing Collatz numbersNotes on Number Theory and Discrete Mathematics, 2018
- A Novel Theoretical Framework Formulated for Information Discovery from Number System and Collatz Conjecture DataProcedia Computer Science, 2015
- The Ultimate ChallengePublished by American Mathematical Society (AMS) ,2010
- The Collatz conjecture. A case study in mathematical problem solvingLogic and Logical Philosophy, 2005
- Unsolved Problems in Number TheoryPublished by Springer Science and Business Media LLC ,2004
- About the Collatz conjectureActa Informatica, 1998
- The 3x+ 1 Problem and its GeneralizationsThe American Mathematical Monthly, 1985