Counting the Collatz numbers
Author:
Preprint
Abstract
The counting function for the numbers satisfying the Collatz conjecture is studied. A related exponential congruence equation is investigated, yielding a method to construct its solutions from free variables, and enabling us to find at least $x^{0.3227}$ Collatz numbers in the interval $[1,x]$. The historical record is 0.84.
Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Almost all orbits of the Collatz map attain almost bounded valuesForum of Mathematics, Pi, 2022
- Bounds for the 3x+1 problem using difference inequalitiesActa Arithmetica, 2003
- Density bounds for the 3𝑥+1 problem. I. Tree-search methodMathematics of Computation, 1995
- An improved estimate concerning 3n+1 predecessor setsActa Arithmetica, 1993
- How many numbers satisfy the 3x + 1 conjecture?International Journal of Mathematics and Mathematical Sciences, 1989