Browse
Claims
Search the graph by meaning. Each result carries its current verdict; open one to see its decomposition, provenance, and the reasoning behind the assessment.
The open conjecture that iterating the map n → n/2 for even n and n → 3n+1 for odd n on any positive integer eventually reaches 1. Claims about its truth, falsity, partial or computational results, and closely related generalized 3n+k maps belong here; other integer conjectures do not.
Contribute
If a claim here is wrong, or missing evidence, open it: every claim page carries its own entry for challenges, evidence, and corrections. If the graph is missing a claim entirely, propose it below. A proposal is reviewed on its merits; accepted claims are matched against the graph and enter it with their reasoning on record.