Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2005/iii/paper-28/2/ii/solution
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 28 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A precise endpoint version of the Perron formula is as follows. If converges absolutely on , then, for ,When is not an integer, the left side is simply the sum over .
Prove first the scalar kernel formula, with symmetric vertical limits:For , close the contour to the left and apply the residue theorem at ; the exponential makes the closing integral vanish. For , close to the right, where there is no enclosed pole and the exponential decreases. The usual semicircle estimate, or integration by parts on the closing arcs, justifies these limits. At the truncated integral is , tending to .
One also needs a uniform bound to pass through the Dirichlet series. Pairing the two halves of the vertical integral gives, with ,The cosine term is absolutely bounded. The sine term is uniformly bounded by integration by parts against the bounded sine integral , since is increasing from zero to one. Thus , independently of .
For finite , absolute convergence permits termwise integration, giving . The uniform bound dominates this by . The dominated convergence theorem and the scalar kernel formula now prove the boxed Perron formula, including its half-weight endpoint convention.
For the link with primes, the logarithmic derivative of the Euler product givesApplying Perron formula therefore expresses the second Chebyshev function , with half weight at a prime-power endpoint, as the vertical integral of . Shift this contour left, choosing heights away from zeros and using the partial-fraction expansion to control the integrand. The pole at one contributes , a nontrivial zero of multiplicity contributes , the trivial zeros contribute , and the pole from contributes . Thus the resulting Riemann–von Mangoldt explicit formula iswith zeros summed symmetrically in height. A truncated contour gives the corresponding truncated formula and remainder. The pole at one gives the main term for primes; zeros farther left give smaller oscillating corrections. Zero-free regions therefore translate into error bounds for and, by partial summation, for the prime-counting function.
New to topics? Read the docs here!