An invitation to additive prime number theory

We survey some recent developments in the analytic theory of multiple Dirichlet series with arithmetical coefficients on the numerators.

We give an overview on recent results concerning additive unit representations. Furthermore the solutions of some open questions are included. The central problem is whether and how certain rings are (additively) generated by their units. This has been investigated for several types of rings related to global fields, most importantly rings of algebraic integers. We also state some open problems and conjectures which we consider to be important in this field.

In this expository article we provide an elegant proof of the one-sided Ingham-Karamata Tauberian theorem. As an application, we present a short deduction of the prime number theorem.

As long as people have studied mathematics, they have wanted to know how many primes there are. Getting precise answers is a notoriously difficult problem, and the first suitable technique, due to Riemann, inspired an enormous amount of great mathematics, the techniques and insights permeating many different fields. In this article we will review some of the best techniques for counting primes, centering our discussion around Riemann's seminal paper. We will go on to discuss ...

The recent technique for estimating lower bounds of the prime counting function $\pi(x)=#\{p \leq x: p\text{ prime}\}$ by means of the irrationality measures $\mu(\zeta(s)) \geq 2$ of special values of the zeta function claims that $\pi(x) \gg \log \log x/\log \log \log x$. This note improves the lower bound to $\pi(x) \gg \log x$, and extends the analysis to the irrationality measures $\mu(\zeta(s)) \geq 1$ for rational ratios of zeta functions.

This paper has been withdrawn by the author due to an error in the proof of Theorem 6.

We give an outline of a generalization of the Gelfond-Schnirelmann method in elementary number theory. It is related to an integral of Selberg (1944) generalizing the Euler beta integral. The result we explain was obtained by Nair and Chudnovsky independently in the early eighties.

This is the first of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression and to the Fourier coefficients of automorphic cusp forms.

For fixed positive integers $n$, we study the solution of the equation $n = k + p_k$, where $p_k$ denotes the $k$th prime number, by means of the iterative method \[ k_{j+1} = \pi(n-k_j), \qquad k_0 = \pi(n), \] which converges to the solution of the equation, if it exists. We also analyze the equation $n = ak + bp_k$ for fixed integer values $a \ne 0$ and $b>0$, and its solution by means of a corresponding iterative method. The case $a>0$ is somewhat similar to the case $a=b...

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes $n^3$ and $(n+1)^3$ for all $n \geq \exp(\exp(33.3))$. To prove this, we first derive an explicit version of the Riemann--von Mangoldt explicit formula. We then assume the Riemann hypothesis and show that there will be a prime in the int...