An E-sequence approach to the 3x + 1 problem
Abstract
For any odd positive integer , define and by setting such that all are odd. The 3x+1 problem asserts that there is an for all . Usually, is called the trajectory of . In this paper, we concentrate on and call it the E-sequence of . The idea is that, we generalize E-sequences to all infinite sequence of positive integers and consider all these generalized E-sequences. We then define to be convergent to if it is the E-sequence of and to be divergent if it is not the E-sequence of any odd positive integer. We prove a remarkable fact that the divergence of all non-periodic E-sequences implies the periodicity of for all . The principal results of this paper are to prove the divergence of several classes of non-periodic E-sequences. Especially, we prove that all non-periodic E-sequences with are divergent by using the Wendel's inequality and the Matthews and Watts's formula , where . 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.
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}
}