Abstract
The celebrated 3x+1 problem is reformulated via the use of an analytic expression of the trailing zeros sequence resulting in a single branch formula f(x)+1 with a unique fixed point. The resultant formula f(x) is also found to coincide with that of the discrete derivative of the sorted sequence of fixed points of the reflection operator on even binary palindromes of fixed even length \textit{2k} in any interval [0,...,22k-1]. A set of equivalent reformulations of the problem are also presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
