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

Abstract

For any odd positive integer x, define (xn)n≥slant 0 and (an )n≥slant 1 by setting x0=x, \,\, xn =3xn-1 +12an such that all xn are odd. The 3x+1 problem asserts that there is an xn =1 for all x. Usually, (xn )n≥slant 0 is called the trajectory of x. In this paper, we concentrate on (an )n≥slant 1 and call it the E-sequence of x. The idea is that, we generalize E-sequences to all infinite sequence (an )n≥slant 1 of positive integers and consider all these generalized E-sequences. We then define (an )n≥slant 1 to be -convergent to x if it is the E-sequence of x 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 (xn )n≥slant 0 for all x0. 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 (an )n≥slant 1 with n ∞ bn n> 23 are -divergent by using the Wendel's inequality and the Matthews and Watts's formula xn =3n x0 2bn Πk=0n-1 (1+13xk ) , where bn =Σk=1n ak . 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…