The Hotel Collatz tree conjecture
Statement
Let be the set of standard reachable natural numbers, and define the directed graph by
with edges
Hotel Collatz conjecture. The Hotel Collatz graph is an infinite, connected, acyclic graph, hence a tree, with 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.