Density bounds for the 3𝑥+1 problem. I. Tree-search method

Authors:
  • DADavid Applegate
    David Applegate
  • JLJeffrey C. Lagarias
    Jeffrey C. Lagarias

Abstract
The 3 x + 1 3x + 1 function T ( x ) T(x) takes the values ( 3 x + 1 ) / 2 (3x + 1)/2 if x is odd and x / 2 x/2 if x is even. Let a be any integer with a ≢ 0 ( mod 3 ) a \nequiv 0\; \pmod 3 . If n k ( a ) {n_k}(a) counts the number of n with T ( k ) ( n ) = a {T^{(k)}}(n) = a , then for all sufficiently large k , ( 1.302 ) k ≤ n k ( a ) ≤ ( 1.359 ) k {(1.302)^k} \leq {n_k}(a) \leq {(1.359)^k} . If π a ( x ) {\pi _a}(x) counts the number of n with | n | ≤ x |n| \leq x which eventually reach a under iteration by T , then for sufficiently large x , π a ( x ) ≥ x .65 {\pi _a}(x) \geq {x^{.65}} . The proofs are computer-intensive.

This publication has 8 references indexed in Scilit: