Related papers: Computing the Mertens and Meissel-Mertens constant…

Let $\{p_n\}_{n\ge 1}$ be the sequence of primes and $\vartheta(x) = \sum_{p \leq x} \log p$, where $p$ runs over the primes not exceeding $x$, be the Chebyshev $\vartheta$-function. In this note we derive lower and upper bounds for…

A 1976 result from Norton may be used to give an asymptotic (but not explicit) description of the constant in Mertens' second theorem for primes in arithmetic progressions. Assuming the Generalized Riemann Hypothesis, we give an effective…

By the von Neumann inequality for homogeneous polynomials there exists a positive constant $C_{k,q}(n)$ such that for every $k$-homogeneous polynomial $p$ in $n$ variables and every $n$-tuple of commuting operators $(T_1, \dots, T_n)$ with…

We consider a family of character sums as multiplicative analogues of Kloosterman sums. Using Gauss sums, Jacobi sums and Deligne's bound for hyper-Kloosterman sums, we establish asymptotic formulae for any real (positive) moments of the…

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

Let $p$ be a prime $\equiv 3$ mod 4, $p>3$, and suppose that 10 has the order $(p-1)/2$ mod p. Then $1/p$ has a decimal period of length $(p-1)/2$. We express the frequency of each digit $0,\ldots,9$ in this period in terms of the class…

The sum $c_0(1/k)=-\sum_{m=1}^{k-1}(m/k)\cot(m{\pi}/k)$ is related to the Estermann zeta function. A recent paper computes the first two terms of the large-$k$ asymptotic expansion of $c_0(1/k)$. Using the Poisson summation formula for…

Assuming a uniform $q$-variant of the prime $k$-tuple conjecture, we compute moments of the number of primes in arithmetic progressions to a large modulus $q$ as the residue classes vary. Consequently, depending on the size of $\varphi(q)$,…

We propose sum rules for permutations $p_n(k)$ of the ensemble $\left\{1,2,\cdots,n\right\}$ with $k$ fixed points, in the form of partial sums of their moments. The corresponding identities involve Stirling numbers of the first kind…

Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be, as usual, Chebyshev's prime-counting function for the primes of the arithmetic progression $a$ (mod $q$) with $(a,q)=1$. For…

The paper compares the asymptotic of the expressions $\frac {1} {x} \sum\limits_{n \leq x} {f(n)}$ and $\sum\limits_{n \leq x} {\frac {f(n)} {n}}$, $\frac {1} {x} \sum\limits_{p \leq x} {f(p)}$ and $\sum\limits_{p \leq x} {\frac {f(p)}…

We show that the functions $\sum_{p\leq x} (\log p)/p - \log x - E$ and $\sum_{p\leq x} 1/p - \log \log x -B$ change sign infinitely often, and that under certain assumptions, they exhibit a strong bias towards positive values. These…

Let $3\leqslant k\leqslant9$ be a fixed integer, $p$ be a prime and $d(n)$ denote the Dirichlet divisor function. We use $\Delta(x)$ to denote the error term in the asymptotic formula of the summatory function of $d(n)$. The aim of this…

For odd primes $p$ we consider the factors \[ A(p)=\frac{p-\chi_4(p)}{p+\chi_4(p)}, \qquad \chi_4(p)= \begin{cases} 1,&p\equiv 1\pmod 4, \\ -1,&p\equiv 3\pmod 4, \end{cases} \] and study products of $A(p)$ restricted to unions of residue…

We prove asymptotic formulas for the complex coefficients of $(\zeta q;q)_\infty^{-1}$, where $\zeta$ is a root of unity, and apply our results to determine secondary terms in the asymptotics for $p(a,b,n)$, the number of integer partitions…

Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q.

For $a/q\in\mathbb{Q}$ the Estermann function is defined as $D(s,a/q):=\sum_{n\geq1}d(n)n^{-s}\operatorname{e}(n\frac aq)$ if $\Re(s)>1$ and by meromorphic continuation otherwise. For $q$ prime, we compute the moments of $D(s,a/q)$ at the…

We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…

We obtain a new estimate for Kloosterman sum with primes $p\leqslant X$ to composite modulo $q$, that is, for the exponential sum of the type \[ \sum\limits_{p\leqslant X,\;p\,\nmid q}\exp{\biggl(\frac{2\pi…