A polynomial approach to the Collatz conjecture

05/21/2019
by   Feng Pan, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset