Explicit upper bounds for exponential sums over primes

DOI10.1090/S0025-5718-00-01280-1zbMath1043.11063OpenAlexW2057388413MaRDI QIDQ4517533

Joël Rivat, Hedi Daboussi

Publication date: 22 November 2000

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

Full work available at URL: https://doi.org/10.1090/s0025-5718-00-01280-1

zbMATH Keywords

exponential sumssievesprime numbers

Mathematics Subject Classification ID

Estimates on exponential sums (11L07) Sums over primes (11L20)

Related Items (2)

On Bombieri's asymptotic sieve ⋮ Every odd number greater than $1$ is the sum of at most five primes

Cites Work

• Montgomery's weighted sieve for dimension two
• Approximate formulas for some functions of prime numbers
• An elementary method in prime number theory
• The large sieve
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Explicit upper bounds for exponential sums over primes