A polynomial approach to the Collatz conjecture
classification
🧮 math.NT
cs.SC
keywords
collatzconjecturepolynomialsdegreeapproachaveragebinarydecreases
read the original abstract
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak proof of the conjecture by using induction with respect to the degree of the polynomials.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.