ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer, and consider the Collatz dynamic on odd positive integers. The Golden Automaton is the finite proof system described in the source for establishing Collatz convergence. Golden Automaton conjecture. If all odd numbers up to 2n2^n are proven to converge to 11 under the Collatz dynamic, then the Golden Automaton finitely proves the convergence of all odd numbers up to 2n+12^{n+1}. This would provide an inductive mechanism for extending verified Collatz convergence to larger ranges, but the source does not state that the conjecture has been proved or disproved.

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.