18-formula conjecture for Collatz stopping times
Statement
Consider the proposed fundamental covering system of odd integers for the Collatz map, and let a total stopping time function assign to each integer the number of iterations needed to reach the relevant terminal behavior. 18-formula conjecture. An irrefutable proof of the Collatz conjecture essentially requires 18 fundamental formulae representing the total stopping time functions of this fundamental covering system of odd integers. The source presents this as a claimed structural requirement for a proof, but supplies no resolution or independent justification.
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.