A note on an average additive problem with prime numbers

We give a general statement of the convolution method so that one can provide explicit asymptotic estimations for all averages of square-free supported arithmetic functions that have a sufficiently regular order on the prime numbers and observe how the nature of this method gives error term estimations of order $X^{-\delta}$, where $\delta$ belongs to an open real positive set $I$. In order to have a better error estimation, a natural question is whether or not we can achieve...

In this article, we prove an "equivalence" between two higher even moments of primes in short intervals under Riemann Hypothesis. We also provide numerical evidence in support of these asymptotic formulas.

This addendum devotes to a detailed proof for the inequality (9.14) in our joint work: Arithmetic exponent pairs for algebraic trace functions and applications, with an appendix by Will Sawin, arXiv:1603.07060 [math.NT], which will appear in Algebra and Number Theory. We do not intend to publish this addendum in any journals; arXiv should be a good place for those reader who want to find such details. The proof involves various averages of arithmetic functions.

This article considers the error term of the primes counting function. It applies some recent results on the densities of prime numbers in short intervals to derive an improvement of the error term from subexponential size to fractional exponential size. The corresponding equivalent results for the zeros of the zeta function and Mertens conjecture are also discussed.

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.

We discuss the evaluation of the average number of Goldbach representations for integers which are multiples of $q$ introduced by Granville. We improve an estimate given by Granville under the generalized Riemann hypothesis.

Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in a wide range of the parameters $k_j$ that complements the results of a previous paper of the author. This is accomplished using an extension and generalization of a theorem of Wirsing due to the author that gives explicit estimates for the...

Fujii obtained a formula for the average number of Goldbach representations with lower order terms expressed as a sum over the zeros of the Riemann zeta-function and a smaller error term. This assumed the Riemann Hypothesis. We obtain an unconditional version of this result, and obtain applications conditional on various conjectures on zeros of the Riemann zeta-function.

In this paper a new integral for the remainder of $\pi(x)$ is obtained. It is proved that there is an infinite set of the formulae containing miscellaneous parts of this integral.

The paper solves the problems of determining the asymptotics of the number of primes and the sums of functions of primes in a subset of the natural series that satisfies the conditions that the asymptotic density of the number of primes in this subset is constant and not equal to zero.