Oscillation Theorems for Primes in Arithmetic Progressions and for Sifting Functions

DOI10.2307/2939254zbMath0724.11040OpenAlexW4232232641MaRDI QIDQ5202260

Helmut Maier, Andrew Granville, Adolf Hildebrand, John B. Friedlander

Publication date: 1991

Full work available at URL: https://doi.org/10.2307/2939254

zbMATH Keywords

distribution of primesarithmetic progressionsomega resultsBuchstab function

Mathematics Subject Classification ID

Primes in congruence classes (11N13) Distribution of integers with specified multiplicative constraints (11N25) Sieves (11N35)

Related Items (11)

Variants of the Selberg sieve, and bounded intervals containing many primes ⋮ Residue classes containing an unexpected number of primes ⋮ Limitations to equidistribution in arithmetic progressions ⋮ On intervals with few prime numbers ⋮ Unnamed Item ⋮ Counting Primes in Arithmetic Progressions ⋮ A heuristic for the prime number theorem ⋮ Nicolaas Govert de Bruijn, the enchanter of friable integers ⋮ Uniform Titchmarsh divisor problems ⋮ Maier’s Matrix Method and Irregularities in the Distribution of Prime Numbers ⋮ On a class of differential-difference equations arising in number theory

Cites Work

• Primes in arithmetic progressions to large moduli
• Limitations to the equi-distribution of primes. I
• Some applications of a theorem of Raikov to number theory
• A large sieve density estimate near \(\sigma = 1\)
• Sur le problème des diviseurs de Titchmarsh.
• A Differential Delay Equation Arising from the Sieve of Eratosthenes
• On Integers Free of Large Prime Factors
• Primes in short intervals
• On the difference between consecutive primes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Oscillation Theorems for Primes in Arithmetic Progressions and for Sifting Functions