ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let NN be the natural numbers. The Collatz tree is a structure DC=⟨D,f⟩\mathcal{DC}=\langle D,f\rangle, where D⊂ND\subset N contains 11, f:D∖{0,1}→Df:D\setminus\{0,1\}\to D, and

f(n)={n÷2when n mod 2=0,3n+1when n mod 2=1 and n≠1.f(n)=\begin{cases}n\div 2&\text{when }n\bmod 2=0,\\3n+1&\text{when }n\bmod 2=1\text{ and }n\neq 1. \end{cases}

Collatz-tree reachability claim. The Collatz tree contains all the reachable natural numbers.

The claim concerns the set generated by the Collatz iteration and is closely tied to whether every natural number eventually reaches 11. The supplied context does not establish an independent resolution of this formulation.

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.