Prime number theorem and fixed arithmetic progressions
Research context
postgraduate concept · established · As of 2026-10-10
The prime-counting function satisfies pi(x)~x/log x.
Key knowledge
The prime-counting function satisfies pi(x)~x/log x. For fixed q and gcd(a,q)=1, primes p≤x with p congruent to a modulo q have count asymptotic to Li(x)/phi(q). Nonvanishing at s=1 of the relevant nonprincipal Dirichlet L-functions underpins the progression result. A fixed-modulus asymptotic is not a uniform numerical guarantee when q grows with x.
Values and equations
pi(x)~x/log x; pi(x;q,a)~Li(x)/phi(q), gcd(a,q)=1
- pi(x;q,a)
- Count of primes at most x in residue class a modulo q
- Li(x)
- Logarithmic integral
- phi(q)
- Number of invertible classes modulo q
Conditions and scope
- x tends to infinity; q is fixed in the stated progression asymptotic.
- For gcd(a,q)>1 a progression contains at most finitely many primes, so the coprimality condition is indispensable.
Sources · 2
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Author checked this English statement, displayed equation where present and stated hypotheses against these source locations: §16.1 Euler product/meromorphic continuation and §16.2 PNT/zero-free line; Characters, Euler products and primes in arithmetic progressions. The check is bounded to the recorded claims; no complete proof reconstruction, software proof replay or universal literature completeness is claimed.
2026-10-10 · Author source-body/statement/equation/domain check, with graph associations scoped individually. Separate independent content/source/inventory review is required before branch closure.
Entry details
Permanent link to this entry ↗- Record identity
- research-math-prime-number-distribution
- Revision
- research.1
- Structured reference record
- Postgraduate & research reference