The prime-factor bound for generators of full Collatz processes

From papers

Let ff be the Collatz function and let {fs(a)}s=1\{f^{s}(a)\}_{s=1}^{\infty} be the corresponding Collatz process. Let Ω(a)\Omega(a) denote the total number of prime factors of aa, counted with multiplicity. The prime-factor bound conjecture. If the process is full, then

Ω(a)2.\Omega(a)\leq 2.

This is proposed as a structural restriction on generators of full Collatz processes. The supplied text gives no resolution evidence.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Theophilus Agama, “The theory of the Collatz process and the method of dynamical balls”, arXiv:1910.13828 (2026).

Solutions 0

No solutions have been posted yet.