An invitation to additive prime number theory

This is the second 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.

In this paper the ideas of Rota and Ramanujan are shown to be central to understanding problems in additive number theory. The circle and sieve methods are two different facets of the same theme of interplay between probability and Fourier series used to great advantage by Wiener in engineering.

The problem of the least prime number in an arithmetic progression is one of the most important topics in Number Theory. In [11], we are the first to study the relations between this problem and Goldbach's conjecture. In this paper, we further consider its applications to Goldbach's conjecture and refine the result in [11]. Moreover, we also try to generalize the problem of the least prime number in an arithmetic progression and give an analogy of Goldbach's conjecture.

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

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 ...

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.

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.

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...