Different approaches to the distribution of primes

DOI10.1007/S00032-010-0122-7zbMath1275.11129OpenAlexW1964588522MaRDI QIDQ627053

Andrew Granville

Publication date: 19 February 2011

Published in: Milan Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00032-010-0122-7

zbMATH Keywords

distribution of primespretentious multiplicative functionRiemann's memoir

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to number theory (11-02) Primes in congruence classes (11N13) Distribution of primes (11N05)

Related Items (6)

Primes in short intervals on curves over finite fields ⋮ An Accurate Heuristic for a Problem of Shparlinski ⋮ Quantitative ergodic theorems and their number-theoretic applications ⋮ Prime polynomials in short intervals and in arithmetic progressions ⋮ AN -FUNCTION-FREE PROOF OF VINOGRADOV’S THREE PRIMES THEOREM ⋮ A new elementary proof of the Prime Number Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Möbius function is strongly orthogonal to nilsequences
• Erratum to: On representations of integers in thin subgroups of \(\text{SL}_2(\mathbb Z)\)
• Primes in tuples. I
• Multiplicative functions in arithmetic progressions
• The elementary proof of the prime number theorem
• Affine linear sieve, expanders, and sum-product
• Quadratic uniformity of the Möbius function
• Linear equations in primes
• Small differences between prime numbers
• The polynomial \(X^2+Y^4\) captures its primes
• Asymptotic sieve for primes
• Very large gaps between consecutive primes
• The primes contain arbitrarily long arithmetic progressions
• Cramér vs. Cramér. On Cramér's probabilistic model for primes
• Sieving and expanders
• A large sieve density estimate near \(\sigma = 1\)
• An uncertainty principle for arithmetic sequences
• An elementary proof of the prime-number theorem
• Primes Represented by Binary Cubic Forms
• Multiplicative Functions on Arithmetic Progressions. VII: Large Moduli
• SIEGEL ZEROS AND THE LEAST PRIME IN AN ARITHMETIC PROGRESSION
• Primes represented by quadratic polynomials in two variables
• Prime Number Patterns
• The lord of the numbers, Atle Selberg. On his life and mathematics
• A new form of the error term in the linear sieve
• Diophantine Representation of the Set of Prime Numbers
• Small differences between consecutive primes
• A Simple Proof of Siegel's Theorem
• Chebyshev's Bias
• Harald Cramér and the distribution of prime numbers
• A new bound for the smallest $x$ with $\pi(x) > \mathrm{li}(x)$
• Prime Number Races
• Small differences between prime numbers
• On a New Method in Elementary Number Theory Which Leads to An Elementary Proof of the Prime Number Theorem
• An Elementary Proof of the Prime-Number Theorem for Arithmetic Progressions
• The Relation Between the Class Number and the Distribution of Primes
• Primes in short intervals

This page was built for publication: Different approaches to the distribution of primes