Variations on a Theme of Collatz
arXiv:2303.08141
Abstract
Consider the recursive relation generating a new positive integer from the positive integer according to the following simple rules: if the integer is odd, ; if the integer is even, . The so-called Collatz conjecture states that, starting from any positive integer , the recursion characterized by the continued application of these rules ends up in the cycle . This conjecture is generally believed to be true (on the basis of extensive numerical checks), but it is as yet unproven. In this paper -- based on the assumption that the Collatz conjecture is indeed true -- we present a quite simple extension of it, which entails the possibility to divide all natural numbers into disjoint classes, to each of which we conjecture -- on the basis of (not very extensive) numerical checks -- of all natural numbers belong; or, somewhat equivalently, to disjoint classes, to which we conjecture that respectively and of all natural numbers belong.