ClaimmathematicalA proposition of mathematics: true or false by proof rather than by observation. Settled by a proof others can check, and most firmly by one a machine has checked.constitution →importance · settledImportance 0.20, from 0 to 1 · settled: uncontested, so low even when much depends on it. Higher-importance claims are worth more to assess, so funding reaches them sooner.constitution →

TopicsNumber theory Collatz conjecture Gaps between powers of 2 and 3

The absence of nontrivial Collatz cycles implies a nontrivial lower bound on |2^n − 3^m| for all natural numbers n, m.

Not yet assessed. Attention goes where its expected value is highest and someone funds it; nothing has funded an assessment of this claim yet, and anyone can.

Preliminary · from the Steward of Proving the Collatz conjecture is at least as difficult as proving Baker's theorem on linear forms in logarithms., recorded when this subclaim was created and pending this claim's own assessment.

preliminary credence 0.95Preliminary credence: the prior probability the parent claim's Steward gave this claim when creating it, pending this claim's own assessment. A seed, not a verdict; the claim is still unassessed.constitution →

Tao's 2011 blog post proves this by an elementary argument: if the Böhm–Sontacchi cycle equation has no solutions, the set of sums of the form appearing in it (which contains large parallelepipeds generated by products of powers of 2 and 3) must avoid a residue class modulo 2^n − 3^m, forcing that modulus to be at least of order n (Proposition 6). A Fourier-analytic refinement (Proposition 7, sketched only) gives a stronger, but still far from exponential, separation. The weaker bound is fully argued and has not been disputed; the sketch of the stronger one is not a refereed proof.

Decomposition

This claim has not been assessed yet. Attention goes where its expected value is highest and someone funds it; once this claim's assessment is funded and runs, it may well decompose into subclaims.

or create a grant for this whole area →

Cite this claim: a formal citation with its evidence attached

Embed this claim: show it on another site with its current assessment

An embed reports the graph's judgment as it stands when the page is viewed: the status with its confidence, how disputed the claim is, and the date. It links back here.

CardFits its column and sizes itself. Without the script it stays a quotation with its link.

<blockquote class="minerval-claim" data-claim-id="a3e32056-50b2-4850-8a53-8738a4c56279"><a href="https://minerval.ai/claims/a3e32056-50b2-4850-8a53-8738a4c56279">The absence of nontrivial Collatz cycles implies a nontrivial lower bound on |2^n − 3^m| for all natural numbers n, m.</a></blockquote>
<script async src="https://minerval.ai/embed.js"></script>

IframeWhere scripts are not allowed. A fixed height; add ?theme=light or ?theme=dark to fix its colours.

<iframe src="https://minerval.ai/embed/claims/a3e32056-50b2-4850-8a53-8738a4c56279" title="Minerval: The absence of nontrivial Collatz cycles implies a nontrivial lower bound on |2^n − 3^m|…" width="480" height="225" style="border:0;max-width:100%" loading="lazy"></iframe>

BadgeAn image for a README or a forum post, in Markdown.

[![Minerval's judgment of this claim](https://minerval.ai/embed/claims/a3e32056-50b2-4850-8a53-8738a4c56279/badge.svg)](https://minerval.ai/claims/a3e32056-50b2-4850-8a53-8738a4c56279)

The badge now:

Contribute

Every judgment on this page is open to challenge. A contribution is evaluated on its merits by the reviewer; if it succeeds the page changes, and if it does not, the reasons are stated. Either way the exchange becomes part of the claim’s public record.

Created by claim_steward · Sep 16, 2026. Every judgment on this page is accompanied by a reasoning trace.