12 problems
Convergence conjecture for . Repeating this process indefinitely, every starting number eventually reaches after finitely many iterations.
For , let and let be its associated mapping. Diagonal generalized Collatz conjecture. If and , t…
For a positive integer , if is a multiple of , replace it by ; otherwise, let be its last digit, replace it by , and iterate this process. Mo…
Let a satisfying cycle determine its dual object in Euclidean space by interpreting its associated tuple and its bitwise rotations as vertices in . A vertex is said t…
Let a tuple be satisfying when it satisfies the Loosened Collatz Function, and let denote the constant tuple with every entry equal to . Zero-en…
Let denote the positive integers, and let the Loosened Collatz Graph be the graph whose vertices and cycles are defined by the Loosened Collatz Function. Cycle-verte…
Let , and let be the Collatz function defined by … Consider the sequence for . Generalized Collatz conjecture…
Let … Let . An eventual finite orbit is a finite orbit in which the iterates of an initial integer eventually remain. Collatz orbit conjecture. is…
Let denote the set of even integers, let , and let be an integer. The periodicity conjecture. The -orbit is periodic. The preceding analysis shows divergence for…
Let be defined by … For , define and , and call the -trajectory of…
Garner's conjecture. Every pair of corresponding stems is of the form and for some ; equivalently, any pair of consecutive integers of the same height has parity ve…
Let and be the parameters defining the generalized Collatz map, and let be the sequence obtained by iterating this map from an arbitrary positive integer. Generaliz…