相关论文: On the second moment for primes in an arithmetic p…

In this article, we study the Euler's factorial series $F_p(t)=\sum_{n=0}^\infty n!t^n$ in $p$-adic domain under the Generalized Riemann Hypothesis. First, we show that if we consider primes in $k\varphi(m)/(k+1)$ residue classes in the…

We give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second completely explicit, where the improvement is for medium-sized…

We propose a novel second-order ODE as the continuous-time limit of a Riemannian accelerated gradient-based method on a manifold with curvature bounded from below. This ODE can be seen as a generalization of the ODE derived for Euclidean…

We study the number of primes with a given primitive root and in an arithmetic progression under the assumption of a suitable form of the generalized Riemann Hypothesis. Previous work of Lenstra, Moree and Stevenhagen has given asymptotics…

By involving some exponential sums related to $\Lambda(n)$ in arithmetic progression, we can obtain some new results for von Mangoldt function over {\bf nonhomogeneous} Beatty sequences in arithmetic progressions, which improve some recent…

In this article, we establish an asymptotic formula for the eighth moment of the Riemann zeta function, assuming the Riemann hypothesis and a quaternary additive divisor conjecture. This builds on the work of the first author on the sixth…

We establish sharp lower bounds for shifted (with two shifts) moments of Dirichlet $L$-function of fixed modulus under the generalized Riemann hypothesis.

In this work we consider sums of primes that converging very slow. We set as a base, a reformulation of analytic prime number theorem and we use the values of Riemann Zeta function for the approximation. We also give the truncation error of…

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.

We conjecture the full asymptotic expansion of a product of Riemann zeta functions, evaluated at the non-trivial zeros of the zeta function, with shifts added in each argument. By taking derivatives with respect to these shifts, we form a…

Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…

We show that an almost trivial inequality for the first and second mean of a random variable can be used to give non-trivial improvements on deep results. As applications we improve on results on lower bounds for the Riemann zeta-function…

Assuming the Riemann hypothesis, we obtain upper and lower bounds for moments of the Riemann zeta-function averaged over the extreme values between its zeros on the critical line. Our bounds are very nearly the same order of magnitude. The…

This work gives a general approach to the determination of the asymptotic behavior of the sums of functions of primes based on the distribution of primes. It refines the estimate of the remainder term of the asymptotic expansion of the sums…

We establish upper bounds for shifted moments of modular $L$-functions to a fixed prime level under the generalized Riemann hypothesis.

We prove a version of the prime number theorem for arithmetic progressions that is uniform enough to deduce the Siegel-Walfisz theorem, Hoheisel's asymptotic for intervals of length $x^{1-\delta}$, a Brun-Titchmarsh bound, and Linnik's…

We obtain asymptotic results on the average numbers of Goldbach representations of an interger as the sum of two primes in different arithmetic progressions. We also prove an omega-result showing that the asymptotic result is essentially…

We obtain a new bound on the second moment of modified shifted convolutions of the generalized 3-fold divisor function, and show that, for applications, the modified version is sufficient.

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…

Assume that $ y < N$ are integers, and that $ (b,y) =1$. Define an average along the primes in a progression of diameter $ y$, given by integer $ (b,y)=1 $. \begin{align*} A_{N,y,b} := \frac{\phi (y)}{N} \sum _{\substack{n <N\\n\equiv…