3n+1 problem: an heuristic lower bound for the number of integers connected to 1 and less than x

Abstract: This paper gives an heuristic lower bound for the number of integers connected to 1 and less than

x

,

h e t a (x) > 0.9 x,

in the context of the

3 n + 1

problem.

This page was built for publication: $3n+1$ problem: an heuristic lower bound for the number of integers connected to 1 and less than $x$