Skip to main content

All Questions

Filter by
Sorted by
Tagged with
34 votes
7 answers
8k views

Explicit formula for Riemann zeros counting function

I've often seen it stated (in vague terms) that there's a Fourier duality between the set of prime numbers and the set of nontrivial Riemann zeta zeros. Because there are various explicit formulae ...
user19727's user avatar
  • 371
13 votes
1 answer
777 views

Large sieve inequality for sparse trigonometric polynomials

Let $S(\alpha) = \sum_{n\leq N}f(n) e^{2\pi i \alpha n}$ for some arithmetic function $f$. Suppose $\alpha_1, \ldots, \alpha_R$ are real numbers that are $\delta$-spaced modulo $1$, for some $0 < \...
user152169's user avatar
9 votes
1 answer
2k views

The large sieve for primes

Let $\Lambda(n)$ be the von Mangoldt function, i.e., $\Lambda(n) = \log p$ for $n$ a prime power $p^k$ and $\Lambda(n) = 0$ for all $n$ that not prime powers. Let $$S(\alpha) = \sum_{n \leq N} \...
H A Helfgott's user avatar
  • 20.2k
7 votes
1 answer
759 views

Major arcs in the proof that every odd number is the sum of at most 5 primes

In his proof that all odd numbers greater than 1 are the sum of at most 5 primes, Terence Tao uses one large major arc around 0 rather than small ones around the rationals, which I am more accustomed ...
Mayank Pandey's user avatar
3 votes
0 answers
192 views

What smoothing to use for PNT-like results?

Consider a Dirichlet series $\sum_n a_n n^{-s}$ with desirable analytic properties (e.g., analytic extension to $\Re s>0$); one example would be $a_n=\mu(n)$. Say we want to estimate $\sum_{n\leq x}...
H A Helfgott's user avatar
  • 20.2k