On the Glide of 3x+1 Problem

MaRDI QIDQ6292135zbMATH OpenFDO

Authors Yuyin Yu, Dingyi Pei

Publication date 4 October 2017

Mathematics Subject Classification ID

Other number representations (11A67) Other combinatorial number theory (11B75) Number theory (educational aspects) (97F60)

Abstract: For any positive integer $n$, define an iterated function ${\displaystyle }$ f(n)=left{�egin{array}{ll} n/2, & mbox{$n$ even,} \ 3n+1, & mbox{$n$ odd.} end{array} ight. ${\displaystyle }$ Suppose $k$ (if it exists) is the lowest number such that $f^k(n)<n$, and there are $O(n)$ "multiply by three and add one" and $E(n)$ "divide by two" from $n$ to $f^k(n)$, then there must be ${\displaystyle }$ 2^{E(n)-1}<3^{O(n)}<2^{E(n)}. ${\displaystyle }$ Our results confirm the conjecture proposed by Terras in 1976.

This page was built for publication: On the Glide of 3x+1 Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6292135)