ProbXiv
Explorersign in
Problem archiveProblem record

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.