English

Density of Collatz Trajectories

Number Theory 2020-10-16 v1 Combinatorics

Abstract

In this paper I present a new method of studying the densities of the Collatz trajectories generated by a set SNS \subset \mathbb{N}. This method is used to furnish an alternative proof that d({yN:k where Tk(y)<cy})=1d(\{y \in \mathbb{N} : \exists k \text{ where } T^k(y) < cy\}) = 1 for all c>0c > 0. Finally, I briefly discuss how the ideas presented in this paper could be used to improve the result that d({yN:k where Tk(y)<yc})=1d(\{y \in \mathbb{N} : \exists k \text{ where } T^k(y) < y^c\}) = 1 for c>log43c > \log_4 3.

Keywords

Cite

@article{arxiv.2010.07294,
  title  = {Density of Collatz Trajectories},
  author = {John Cooper Faile},
  journal= {arXiv preprint arXiv:2010.07294},
  year   = {2020}
}

Comments

6 pages

R2 v1 2026-06-23T19:21:19.732Z