The cycle-vertex conjecture for the Loosened Collatz Graph
Statement
Let denote the positive integers, and let the Loosened Collatz Graph be the graph whose vertices and cycles are defined by the Loosened Collatz Function. Cycle-vertex conjecture. For all , is a vertex of a cycle. This conjecture asserts that every positive integer not divisible by lies on a cycle in the graph; the source gives no resolution, so its status remains open.
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.