ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N1\mathbb{N}_1 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 n≠0 (mod 3)∈N1n \neq 0 \text{ (mod 3)} \in \mathbb{N}_1, nn is a vertex of a cycle. This conjecture asserts that every positive integer not divisible by 33 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 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.