论文标题
$ 3N+1 $问题：连接到1且小于$ x $的整数数量的启发式下限
$3n+1$ problem: an heuristic lower bound for the number of integers connected to 1 and less than $x$
论文作者
论文摘要
本文给出了连接到1个且小于$ x $，$θ（x）> 0.9倍的整数数量的启发式下限，在$ 3N+1 $问题的上下文中。
This paper gives an heuristic lower bound for the number of integers connected to 1 and less than $x$, $θ(x) > 0.9x,$ in the context of the $3n+1$ problem.
