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.

1 claim

The representation function r₂(n) counting representations of an integer as a sum of two squares: the sum-of-two-squares theorem (characterization via primes ≡ 3 mod 4), Landau–Ramanujan-type counting of representable integers, upper and lower bounds for r₂(n), and integers with many representations. Claims about other additive representations (Goldbach-type sums of primes) stay under their own ta

For some constant c > 0, infinitely many integers N have at least N^(c/log log N) representations as a sum of two squares.

UnassessedNo current assessment. Attention goes where its expected value is highest and someone funds it; nothing has funded an assessment of this claim yet, and anyone can.constitution →empirical · derivedA factual claim that rests on inference from other evidence rather than direct observation.constitution →Number theoryimportance · settledImportance 0.12, 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 →

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.