Linked from

The 10 pages that link to Prime number theorem for arithmetic progressions, each with the reason it gives.

• Prime number theoremBroader topic: It extends the theorem's density prediction to primes in specified congruence classes.

• Dirichlet's theorem on arithmetic progressionsBroader topic: It sharpens infinitude by showing primes are asymptotically shared among eligible classes.

• Dirichlet L-functionRelated: Zeros of these functions control the error in counting primes across residue classes.

• Dirichlet characterRelated: Character sums help express and estimate prime counts in individual residue classes.

• Generalized Riemann hypothesisRelated: Dirichlet L-function zeros govern error terms in this distribution.

• Bombieri–Vinogradov theoremNarrower topic: The theorem averages the error in this result over many moduli.

• Linnik's theoremRelated: It describes long-run distribution, whereas Linnik gives a uniform bound on the first occurrence.

• Elliott–Halberstam conjectureNarrower topic: The conjecture extends this distributional picture by averaging errors across many moduli.

• Siegel–Walfisz theoremNarrower topic: The Siegel–Walfisz theorem is its uniform version for moduli growing only polylogarithmically.

• Brun–Titchmarsh theoremCompared with: Its asymptotic precision exceeds Brun–Titchmarsh when the modulus is fixed and x grows.