English

An E-sequence approach to the 3x + 1 problem

Number Theory 2019-10-15 v4

Abstract

For any odd positive integer xx, define (xn)n0(x_n)_{n\geqslant 0} and (an)n1(a_n )_{n\geqslant 1} by setting x0=x,xn=3xn1+12anx_{0}=x, \,\, x_n =\cfrac{3x_{n-1} +1}{2^{a_n }} such that all xnx_n are odd. The 3x+1 problem asserts that there is an xn=1x_n =1 for all xx. Usually, (xn)n0(x_n )_{n\geqslant 0} is called the trajectory of xx. In this paper, we concentrate on (an)n1(a_n )_{n\geqslant 1} and call it the E-sequence of xx. The idea is that, we generalize E-sequences to all infinite sequence (an)n1(a_n )_{n\geqslant 1} of positive integers and consider all these generalized E-sequences. We then define (an)n1(a_n )_{n\geqslant 1} to be Ω\Omega-convergent to xx if it is the E-sequence of xx and to be Ω\Omega-divergent if it is not the E-sequence of any odd positive integer. We prove a remarkable fact that the Ω\Omega-divergence of all non-periodic E-sequences implies the periodicity of (xn)n0(x_n )_{n\geqslant 0} for all x0x_0. The principal results of this paper are to prove the Ω\Omega-divergence of several classes of non-periodic E-sequences. Especially, we prove that all non-periodic E-sequences (an)n1(a_n )_{n\geqslant 1} with limnbnn>log23\mathop {\overline {\lim } }\limits_{n\to \infty } \cfrac{b_n }{n}>\log _23 are Ω\Omega-divergent by using the Wendel's inequality and the Matthews and Watts's formula xn=3nx02bnk=0n1(1+13xk)x_n =\cfrac{3^n x_0 }{2^{b_n }}\prod\limits_{k=0}^{n-1} {(1+\cfrac{1}{3x_k })} , where bn=k=1nakb_n =\sum\limits_{k=1}^n {a_k } . These results present a possible way to prove the periodicity of trajectories of all positive integers in the 3x + 1 problem and we call it the E-sequence approach.

Keywords

Cite

@article{arxiv.1809.02278,
  title  = {An E-sequence approach to the 3x + 1 problem},
  author = {SanMin Wang},
  journal= {arXiv preprint arXiv:1809.02278},
  year   = {2019}
}
R2 v1 2026-06-23T03:57:29.786Z