The prime-factor bound for generators of full Collatz processes
Statement
Let be the Collatz function and let be the corresponding Collatz process. Let denote the total number of prime factors of , counted with multiplicity. The prime-factor bound conjecture. If the process is full, then
This is proposed as a structural restriction on generators of full Collatz processes. The supplied text gives no resolution evidence.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.