Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The summatory totient function is 3 over pi squared times x squared plus O(x log x)

Statement

For every real x1,

nxφ(n)=3π2x2+O(xlogx).

Facts & Assumptions

Given: A real x1 and, for each positive integer dx, the integer yd:=x/d.

Proof

technique · direct
1.1

By For every positive integer n, dn, d>0φ(d)=n, one has dnφ(d)=n=id1(n), where id1 is from The power functions idk and the divisor-power-sum functions σk. Applying Classical Möbius inversion over positive divisors gives φ(n)=dnμ(d)nd. The same inversion applied to the identity dnε(d)=1, with ε from The Dirichlet-convolution identity and the constant-one function, yields dnμ(d)=ε(n)={1,n=1,0,n>1.

givenalgebra
2.1

Summing the divisor formula from step 1.1 over nx and writing n=dm gives nxφ(n)=dxμ(d)mx/dm. Also, multiplying the second identity of step 1.1 by 1/n2 and summing over nx yields the finite identity 1=dxμ(d)d2mx/d1m2.

step 1.1givenalgebra
3.1

For a positive integer Y, let S(Y):=mY1/m2. For every mY+1 one has 1m21m(m1)=1m11m, so m>Y1m2m>Y(1m11m)=1Y. Since The Basel sum is pi squared over six by a residue computation gives m=11/m2=π2/6, it follows that S(Y)=π2/6+O(1/Y). Apply this in the second formula of step 2.1 with Y=yd. Because 1/yd2d/x for every dx, one gets dx1d2yd=O ⁣(1xdx1d). Together with μ(d)1 from The number-theoretic Möbius function μ(n) from prime factorisation and The harmonic sum is log x plus gamma plus O(1/x), this yields dxμ(d)d2=6π2+O ⁣(logxx).

step 2.1givenalgebra
4.1

For each dx, mx/dm=yd(yd+1)2=yd22+O(yd),yd=xd+O(1). Therefore step 2.1 becomes nxφ(n)=x22dxμ(d)d2+O ⁣(xdx1d). Using step 3.1 and The harmonic sum is log x plus gamma plus O(1/x) now yields nxφ(n)=3π2x2+O(xlogx).

step 2.1step 3.1givenalgebra

Depends on

Used by

Dependency tree · two levels

39 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources