Constant-one arithmetic function Created 2026-10-03 Updated 2026-10-14
The constant-one arithmetic function has for every positive integer , including . It is a completely multiplicative function. Its Dirichlet convolution with an arithmetic function is the divisor sum . Thus , the divisor function. Its pointwise product of arithmetic functions with is itself; its Dirichlet convolution with generally is not. The Identity for Dirichlet convolution is instead .
Dirichlet convolution Created 2026-09-24 Updated 2026-11-05
The Dirichlet convolution of arithmetic functions is the arithmetic functionIn the first sum, runs over the positive integer divisors of ; the second uses ordered pairs of positive integers whose product is . Both sums are finite. Each pair contributes one weight from and one from , so Dirichlet convolution combines information attached to complementary factors. It turns a divisor sum into an operation on arithmetic functions. [ref]
Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781 lecture notes, Sections 2.3 and 2.4: Dirichlet convolution and examples
For the six ordered pairs are . The constant-one arithmetic function gives one per pair, while the identity arithmetic function weights the first factor by its size:Here is the divisor function and is the sum-of-divisors function. By comparison, the pointwise product of arithmetic functions gives and .
Six ordered pairs of positive integers with product 12 contribute to Dirichlet convolution: one per pair for the divisor function, or the first factor for the sum-of-divisors function
. Details. Commutativity follows by swapping the two entries of every ordered pair. Associativity follows by reindexing either grouping over the same ordered tuples of three positive integers:For example, counts ordered tuples of three positive integers with product . Distribute the two occurrences of the prime factor among three entries in ways, and the one occurrence of the prime factor in ways. These binomial coefficients are the stars and bars counts of exponent choices in the nonnegative integers; prime factorization therefore gives such tuples. Directly, the same Dirichlet convolution is .
The Identity for Dirichlet convolution is , and the Möbius function reverses a divisor sum because . This makes Dirichlet convolution useful both for counting factorizations and for recovering an arithmetic function from its divisor sum.
Divisor sum Created 2026-09-24 Updated 2026-11-05
The divisor sum of an arithmetic function assigns to each positive integer the sumOnly positive integer divisors are included, so . The weights can count the integer divisors, measure their sizes, or record other arithmetic information: the constant-one arithmetic function gives the divisor function, whereas the identity arithmetic function gives the sum-of-divisors function.
Equivalently, , where is Dirichlet convolution and is the constant-one arithmetic function. If is a multiplicative function, then is a multiplicative function by Multiplicativity of Dirichlet convolution. [ref]
Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781 notes on floor and arithmetic functions, Proposition 2.4.2 and Theorem 2.6.1
Here is the mechanism. For positive coprime integers , every positive integer divisor of has a unique form with and ; moreover, are coprime integers. Thus a multiplicative function satisfiesAt a prime power, the divisor sum becomes . This turns a calculation over many integer divisors into short local calculations at prime powers.
Identity for Dirichlet convolution Created 2026-09-29 Updated 2026-11-05
The Identity for Dirichlet convolution is the arithmetic functionFor every arithmetic function , it satisfies . Indeed, in , only survives. For example,At the sole term is . This gives a useful way to check Dirichlet convolution calculations: inserting leaves every value unchanged. The three arithmetic functions , , and all take value at , but at the constant-one arithmetic function, the identity arithmetic function, and the Identity for Dirichlet convolution take values , , and , respectively. [ref]
Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781 lecture notes, Theorem 2.3.4
The Möbius function is the inverse of the constant-one arithmetic function under Dirichlet convolution, meaning . The Möbius divisor-sum identity gives a short proof: for the nonzero terms expand , while at the sum is . At , the computation isThe zeros occur because and are divisible by the square of the prime number . Consequently, if is a divisor sum, then associativity gives : this is Möbius inversion.
Möbius divisor-sum identity Created 2026-10-06 Updated 2026-11-05
For every positive integer , the divisor sum of the Möbius function isThe sum includes all positive integer divisors, but only squarefree divisors contribute. Equivalently, under Dirichlet convolution, where is the constant-one arithmetic function and is the Identity for Dirichlet convolution. [ref]
Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781 lecture notes, Propositions 2.4.6 and 2.4.7
Each squarefree divisor chooses a subset of the distinct prime factors of , contributing when that subset has elements. Expanding a product therefore givesFor at least one prime factor occurs, so the product is zero. At it is an empty product, equal to one. This is the same alternating cancellation that drives inclusion-exclusion.
For , all eight positive integer divisors are squarefree integers, givingPair each subset not containing with the subset obtained by inserting : . Each pair cancels. The same nonzero terms occur for , because its squarefree divisors are still the integer divisors of ; its other integer divisors have Möbius function value zero.
The eight integer divisors of 30 form a cube of subsets of its prime factors; adding one prime factor reverses the Möbius function sign, and all contributions cancel
. Details. The Möbius divisor-sum identity is the cancellation behind Möbius inversion and reciprocal Dirichlet series: aggregation over integer divisors has an exact inverse.
Möbius function Created 2026-09-24 Updated 2026-11-05
The Möbius function assigns a cancellation weight to each positive integer:Thus a squarefree integer contributes a sign determined by its number of distinct prime factors; a repeated prime factor makes the weight zero. This packages the alternating signs of inclusion-exclusion into an arithmetic function. [ref]
Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781 lecture notes, Definition 2.1.2
For example, , , and , since . In contrast, : all three have the square of the prime number as a divisor. On prime powers, and for .
The Möbius function is a multiplicative function: for coprime integers, their prime factors are disjoint, so either a squared prime factor forces both sides of to vanish, or the counts of distinct prime factors add and their signs multiply. It is not a completely multiplicative function, since . Its Möbius divisor-sum identity makes it the inverse of the constant-one arithmetic function under Dirichlet convolution: , the Identity for Dirichlet convolution. This is why the small set of weights can undo an entire divisor sum.
Möbius inversion formula Created 2026-09-24 Updated 2026-11-05
Möbius inversion recovers an arithmetic function from its divisor sum. For arithmetic functions , the following statements are equivalent, with each equality required for every positive integer :Here ranges over positive integer divisors of and is the Möbius function. No multiplicativity assumption is needed, and both sums are finite. The right side can also be written by exchanging complementary integer divisors. [ref]
Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781 lecture notes, Theorem 2.5.1 and Proposition 2.5.2
The divisor sum bundles together with values at smaller integer divisors. Möbius inversion subtracts aggregates indexed by one distinct prime factor, adds those indexed by two, and continues with the alternating signs of inclusion-exclusion. A divisor containing a squared prime factor receives weight zero. The Möbius divisor-sum identity ensures that every unwanted contribution cancels exactly.
In Dirichlet convolution notation, and , where is the constant-one arithmetic function and is the Identity for Dirichlet convolution. Associativity and commutativity give the short proof:Convolving with proves the reverse implication. At , the formula reduces to because .
For a worked example, take , Euler's totient function. The totient divisor-sum identity says that , the identity arithmetic function:This identity comes from classifying the integers by their greatest common divisor with : the group with has members, since and are coprime integers. Summing the group sizes gives , as detailed under totient divisor-sum identity.
Now undo this aggregation with the Möbius function:The nonzero terms use ; vanish because they contain the square of the prime number . The four surviving integers coprime to are .
A divisor sum aggregates Euler's totient function values to 12, while Möbius inversion recovers the four integers coprime to 12
. Details. This example also reveals why Möbius inversion is useful: it turns an easy count of all objects into a count satisfying a coprimality restriction. Expanding over subsets of distinct prime factors givesThe product is inclusion-exclusion over multiples of the prime factors. For , it gives . More generally, whenever a counting problem produces a divisor sum, Möbius inversion lets that aggregate be reversed without solving a new system of equations.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 26 6 Solution Created 2026-10-03 Updated 2026-10-14
Use for the completed Riemann zeta function, without the polynomial factor used to define the entire Riemann xi function. For complex putThis is the Modified Bessel function of the second kind. The substitution writes it as , proving that it is entire in , that , and that it decays exponentially as , uniformly for in a compact set.
For all the lattice sums and the integrals below converge absolutely. The terms in the completed nonholomorphic Eisenstein series contribute . For , use the Gamma integral and then Poisson summation in :Here the Poisson identity is . At , evaluating the Gamma integral and summing over gives . At , the substitution and the integral representation of the modified Bessel function of the second kind giveCollect the frequency . There are two signed choices of for each positive divisor of . Thus, with , the full Fourier expansion isThe factor is important: the lattice sum includes both signs, while the defining factor was already used in its Mellin integral. This expansion uses exactly the completion in the question.
We can deduce both of the offered conclusions. First recall, with a short proof, the needed functional equation of the Riemann zeta function. Put . Poisson summation gives . Splitting the Mellin integral of at one yieldsThe integral is entire and invariant under . Hence , with only simple poles at , of residues . This is the pole-bearing completion, not the entire xi function.
For fixed , the nonconstant part of the Eisenstein expansion is entire in and locally normally convergent: the divisor sums grow at most polynomially on a compact set of , whereas decays exponentially in . The same argument gives local uniformity for in compact subsets of the complex upper half-plane. Thus only the constant terms can have poles. Their apparent poles at cancel: has principal part , while has its negative, and both multiply there. The remaining poles are simple, at , with residues .
Under , the two constant terms interchange by the zeta functional equation. The nonconstant terms are unchanged because andwhich follows by replacing a divisor by . Therefore
For the Kronecker limit formula, evaluate the finite Laurent coefficient at . Write for the Euler--Mascheroni constant. From and we obtainThe gamma derivative follows by differentiating the Gamma duplication formula and using . Multiplication by adds to the constant term; the other constant term contributes .
The half-order Modified Bessel function of the second kind is . For example, in its even integral representation set as variable and then : and the factor converts the integral to a Gaussian. At the nonconstant Eisenstein coefficients are consequently . On the other hand, the absolutely convergent logarithmic series givesAdding this identity to its conjugate identifies the nonconstant sum as . With the analytic Dedekind eta function product , the resulting answer isThis derivation of the Kronecker limit formula uses the analytic eta product only; it does not assume its modular transformation. The lattice series is invariant for by an integral change of the pair and . Analytic continuation preserves this invariance, so its finite Laurent coefficient is invariant too. This supplies the independent weight-two transformation argument used in Question 2.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 29 5 Solution Created 2026-10-03 Updated 2026-10-07
For a prime , the divisor sum defining the real weight is . If , the second term vanishes and the first is one. Thus , while for every integer because is real and the sum is squared.
Put . With the Fourier transform convention in the question, Fourier inversion givesThe function is smooth and has compact support. Using integration by parts times, with zero endpoint terms, provesChoose an integer to obtain for . In particular every polynomially weighted absolute integral of is finite.
For the double integral, useDifferentiating the second formula gives . absolute convergence from the rapid decay permits Fubini's theorem. The derivative energy constant for a smooth sieve cutoff is thereforeThere is no complex conjugate in this integral: the two factors both become , which is real. The constant is positive; in fact the Cauchy-Schwarz inequality applied to gives .
Here is the basic structure of the smooth divisor-square sieve asymptotic, with enough uniform estimates to specify the error. Write and . Expand the square and count multiples of the least common multiple in an arbitrary interval of length :The sum is effectively restricted to . Each count is , independent of the interval's position, so the total error is .
The Fourier representation of a smooth Selberg weight readsHence, with ,The four local terms correspond to the prime dividing neither divisor, only the first, only the second, or both. This is the Euler product for a smoothed divisor-square correlation. Factor it aswhereThe local factors of are when for small fixed . Thus is a holomorphic function near , and evaluating each local factor at zero gives exactly one. Consequently and there.
The pole expansion now yieldswhen . Integrating the error against the rapidly decreasing transforms gives . The complementary tails are harmless uniformly: absolute values in the original divisor series giveAny prescribed power decay of is available, so these tails and the tails of the limiting kernel are after choosing sufficiently many applications of integration by parts. The same absolute bound justifies the original exchanges of infinite sums and integrals. Using the evaluated double integral,We conclude, uniformly over all interval locations,This proof does not assume that the interval starts near the origin.
Finally choose this one fixed smooth cutoff. primes above in contribute one each to the nonnegative weight, and at most primes lie below . Thereforefor all sufficiently large , uniformly in . The bounded range follows by increasing the fixed constant and using the trivial interval bound . Thus the short-interval prime upper bound from a smooth divisor weight is
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 23 2 c Solution Created 2026-10-03 Updated 2026-10-06
The constant and first Fourier coefficients of are and . In the weight-four Eisenstein basis at level two, these forceFor , its coefficient is , where the second divisor sum is zero if is odd. The even divisors have cube sum , soOn the other hand, expanding the eighth power of the theta series of integer squares counts ordered integer eight-tuples of square sum . Their sign is , since . If denotes that count, thenSeparately , from the all-zero tuple. The positive-divisor formula is not a formula at zero. This is the eight-square representation formula.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 27 1 a Solution Created 2026-10-03 Updated 2026-10-06
Let . Regroup the finite divisor sum using the least common multiple:This is nonnegative. If has no prime factor in , only can contribute to the inner sum, so it equals . This proves the required pointwise upper-bound sieve inequality. Whenever a term defining is nonzero, and their prime factors lie in . Hence , and every prime factor of lies in . Thus these are upper-bound sieve weights of level , as described by the Selberg least-common-multiple weights.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 126 2 Solution Created 2026-10-03 Updated 2026-10-14
A weight- modular form for is a holomorphic function on the complex upper half-plane satisfyingand holomorphic at a cusp. Since the full modular group has one cusp class, this last condition means that the period-one function has a convergent expansion , , near infinity. A cusp form has . The element makes a nonzero weight odd form impossible.
For weight zero, descends to a holomorphic function on the quotient of the complex upper half-plane by the modular group. At an elliptic fixed point, invariance under its finite stabilizer makes the local Taylor series a series in the quotient coordinate. At the cusp, the expansion extends it over . The standard fundamental domain of the modular group, with its boundary identified and its cusp added, is a compact Riemann surface, the compactified modular curve . The maximum modulus principle now provesHolomorphy at the cusp is essential to this conclusion.
The standard modular fundamental domain with paired vertical boundaries, paired circular arcs, and the added cusp at infinity
. Details. For positive even , define the unnormalized Eisenstein seriesThe real-linear map is invertible, and on a compact subset of the complex upper half-plane its norm is uniformly comparable to . Thus the sum converges absolutely and locally uniformly for , proving holomorphy. For ,The map is a bijection on the nonzero integer pairs, giving .
For the expansion, the cotangent partial-fraction Fourier kernel follows by differentiating the partial-fraction expansion of and its geometric-series expansion , valid for . It gives, for even ,The part of is , where is the Riemann zeta function; positive and negative contribute equally. Apply the kernel at for , and regroup the absolutely convergent sum according to . With the divisor sum , this provesThe expansion has no negative powers and converges for , so it also proves holomorphy at a cusp and completes the proof of modularity.
The supplied zeta values yield the Fourier expansion of a normalized Eisenstein seriesBoth and are modular forms of weight twelve. Their constant terms cancel, so their difference divided by is a cusp form. Integrality requires an argument: dividing an integral series by alone would not suffice. Expanding directly gives the integrality identity for the modular discriminantFor every integer , is divisible by twelve. Modulo three, ; modulo four, an even makes both powers divisible by four, while an odd has . Thus each coefficient is integral. The other three series visibly have integral coefficients, provingThis proves integrality without assuming a product expansion for the modular discriminant.
Past exam of the mathematics course of the University of Cambridge 2018 ii Paper 3 1G Solution Created 2026-09-24 Updated 2026-10-03
An arithmetic function is multiplicative if whenever and are coprime integers. If and , every positive integer divisor of is uniquely with and . Henceso is multiplicative.
The Möbius function is defined by , if the square of a prime number divides , and if is a product of distinct prime numbers. Coprime integers have disjoint sets of prime factors, so this definition immediately gives when .
For , only the square-free divisors contribute, and thereforeFor the sum is . Thus in the language of Dirichlet convolution. Convolving with gives the Möbius inversion formula
If , its divisor sum is the sum-of-divisors function. Conversely, if , Möbius inversion givesusing the standard divisor identity for the Euler totient function. Therefore the two requested answers are
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 2 1I Solution Created 2026-09-24 Updated 2026-09-25
The Möbius function is defined by and, for ,It is a multiplicative arithmetic function: whenever and are coprime.
The summand is multiplicative, so its divisor sum is multiplicative. For a prime power with , only contribute andMultiplying these local identities over the prime divisors of gives
For the final claim, choose distinct primes . The moduli are pairwise coprime, so the Chinese remainder theorem gives an integer satisfyingEvery positive integer then has . HenceThere are infinitely many positive representatives of this congruence class.
Selberg symmetry formula 2026-10-06
The elementary Selberg symmetry formula can be writtenUse the weights . Their divisor sum is . Apply them to the integrated Chebyshev sum, then use the Möbius harmonic logarithmic moments. The Chebyshev estimate shows this is equivalent, with an error, to .
Sum-of-divisors function Created 2026-10-03 Updated 2026-11-05
The sum-of-divisors function adds all positive integer divisors of a positive integer, including the number itself:It is the divisor sum of the identity arithmetic function , so under Dirichlet convolution. Both factors are multiplicative functions, hence so is the sum-of-divisors function. The notation distinguishes it from other weighted divisor sums. [ref]
Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781 notes, Definition 2.1.2 and Proposition 2.2.2(e)
For a prime number and a nonnegative exponent , the positive integer divisors of the prime power are precisely . Their finite geometric series givesFor example, . For a prime factorization with distinct prime numbers and positive exponents , multiplicativity givesFor , this is an empty product, equal to . [ref]
Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781 notes, Theorem 2.1.8 with k equal to one
The distributive property makes the formula especially beautiful: choosing one term from each factor produces each positive integer divisor exactly once, by the fundamental theorem of arithmetic. For , the choices form a three-by-two grid with entries , where and . Adding its rows givesThe divisor function counts six cells; the sum-of-divisors function adds their six values. Once the prime factorization is known, the product formula avoids testing every candidate integer divisor. Shared prime factors require care: , so the sum-of-divisors function is not a completely multiplicative function.
The sum-of-divisors function for : each grid entry is a positive integer divisor, and the weighted total is
. Details. Subtracting the number itself gives the proper-divisor sum . Comparing with distinguishes perfect numbers, deficient numbers, and abundant numbers. For , ; for , . Both are perfect numbers. The calculation makes a deficient number, while makes an abundant number. These comparisons turn the sizes of integer divisors into a classification of positive integers. [ref]
The proper-divisor sum for : perfect numbers lie on , deficient numbers below it, and abundant numbers above it
. Details. This connection is ancient: Euclid's Elements, Book IX, Proposition 36, constructs a perfect number by multiplying the last term of by their sum, when that sum is a prime number. In modern notation, put and , with and a prime number. The sum-of-divisors function proves the construction immediately:Consequently the proper-divisor sum is . Taking produces the perfect numbers . [ref]
Book IX, Proposition 36. Euclid, Elements IX.36, translated text and commentary by David Joyce
Totient divisor-sum identity Created 2026-10-14 Updated 2026-11-05
The divisor sum of Euler's totient function is the identity arithmetic function:Equivalently, under Dirichlet convolution, with the constant-one arithmetic function. [ref]
Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781 lecture notes, Propositions 2.4.4 and 2.4.5
To see why, group the integers by . Each is a positive integer divisor of . Within its group, with and , by the scaling identity for greatest common divisors. Dividing by gives a bijection with the integers counted by . The groups form a partition of a set, soFor , the groups with greatest common divisor are respectively . Their sizes are , totaling . Möbius inversion reverses this divisor sum to recover Euler's totient function from .
Von Mangoldt divisor identity Created 2026-09-24 Updated 2026-10-14
For every positive integer , the divisor sum of its Von Mangoldt function weights recovers its natural logarithm:The sum runs over the positive integer divisors of . For , its only term is . Equivalently, if and is the constant-one arithmetic function, then , where is Dirichlet convolution. [ref]
For , the positive integer divisors are . Only contribute:Thus the vanishing of loses no information here: the divisor sum retrieves both copies of the prime factor from the integer divisors and .
Proof outline: by the fundamental theorem of arithmetic, write with distinct prime numbers and positive exponents . Among the positive integer divisors, the ones with nonzero Von Mangoldt function weights are exactly . ConsequentlyThe natural logarithm turns the prime factorization product into a sum, and the prime powers greater than one supply exactly the required multiplicities.
Von Mangoldt function Created 2026-09-24 Updated 2026-11-05
The Von Mangoldt function assigns a natural logarithm weight to each positive power of a prime number. For a positive integer ,Here and throughout the Chebyshev functions, means the natural logarithm. In particular, : the exponent must be positive, even though the convention in prime power allows exponent zero. The support of a function of therefore consists precisely of the prime powers greater than one. [ref]
For example, and , whereas . A composite number can have a nonzero weight: has just one distinct prime factor. But has two distinct prime factors, so its weight is zero. At the weight is , not . This choice lets successive powers record successive copies of the same prime factor in the Von Mangoldt divisor identity.
The Von Mangoldt function is useful because it connects two views of the prime numbers: the prime factorization of an individual integer, through a divisor sum, and the accumulated weights below a cutoff, through the second Chebyshev function. The latter turns questions about the distribution of prime numbers into questions about a partial sum of an arithmetic function.






