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 system of difference inequalities introduced by Krasikov for counting functions of integers below x whose 3x+1 (Collatz) trajectories satisfy given parity constraints, and its residue-class refinements (e.g. restricting to classes modulo 3^k), used to prove lower bounds on the density of Collatz preimage sets. Density claims about other integer sequences stay under their own tags.
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.