Revision #603 → #1407 · back to history
addedDefinition of the Möbius function9ffbbbda7215
addedAlternative representation via Liouville/prime omega functionsd8413e71af54
addedGauss characterization as sum of primitive rootsd344f69e9cad
addedValues for the first 60 positive numbersb51ccaabbdf8
addedDirichlet series as inverse of Riemann zeta96a269e2218e
addedEuler product01df103085b4
addedIdentity involving Euler's constantf54aac34a4c8
addedLambert series for the Möbius function836de3dffd20
addedLambert series for prime argument9e0cacbb08f7
addedGauss: sum of primitive roots mod pd17900109444
addedNumber of monic irreducible polynomials over a finite field2dd8a974ab0f
addedMöbius function is multiplicative15f6ab9b69fc
addedSum of Möbius function over divisors1722960e6f17
addedFormula without factorization (sum of primitive roots of unity)ba1437798026
addedOther identities satisfied by the Möbius functionb8c1ae0c93f2
addedBinomial coefficients alternating-entry resultf06478004fd6
addedMean value is zero (equivalent to PNT)58a450bff17f
addedμ(n)=0 iff divisible by square of a prime7828d819c1eb
addedNumbers divisible by a square of a primedbd7ea125cab
addedPrime implies μ(n)=−1 but not conversely254a3ec3a782
addedSphenic numbers (three distinct prime factors)98fe0b642c14
addedNumbers with five distinct prime factors6e0fa560fe63
addedMertens function4f172085755c
addedMertens function via Farey sequenceff4456fa7c7d
addedMöbius function of a locally finite poset658c60ebcffb
addedIterated Dirichlet convolution of the Möbius function6227ac9b7ef9