ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let NN be the set of standard reachable natural numbers, and define the directed graph HC=⟨V,E⟩HC=\langle V,E\rangle by

V=N,V=N,

with edges

E={⟨k,p⟩:∃p  k=p+p}∪{⟨k,3k+1⟩:∃p  k=p+p+1}.E=\{\langle k,p\rangle:\exists p\;k=p+p\}\cup\{\langle k,3k+1\rangle:\exists p\;k=p+p+1\}.

Hotel Collatz conjecture. The Hotel Collatz graph is an infinite, connected, acyclic graph, hence a tree, with 11 as its root.

This graph-theoretic formulation recasts the Collatz iteration as a directed structure on reachable natural numbers. The supplied context gives no evidence resolving whether the graph has the asserted tree structure.

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.