相关论文: On the constant in the Mertens product for arithme…

We give explicit numerical values with 100 decimal digits for the Mertens constant involved in the asymptotic formula for $\sum\limits_{\substack{p\leq x p\equiv a \bmod{q}}}1/p$ and, as a by-product, for the Meissel-Mertens constant…

The aim of the paper is the proof of new identities for the constant in the Mertens product for arithmetic progressions. We deal with the problem of the numerical computation of these constants in another paper.

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…

We find a lower bound for the number of Chen primes in the arithmetic progression $a \bmod q$, where $(a,q)=(a+2,q)=1$. Our estimate is uniform for $q \leq \log^M x$, where $M>0$ is fixed.

For any $\epsilon>0$, there exists $q_0(\epsilon)$ such for any $q\ge q_0(\epsilon)$ and any invertible residue class $a$ modulo $q$, there exists a natural number that is congruent to $a$ modulo $q$ and that is the product of exactly three…

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

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…

We study the existence of products of primes in arithmetic progressions, building on the work of Ramar\'e and Walker. One of our main results is that if $q$ is a large modulus, then any invertible residue class mod $q$ contains a product of…

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)$,…

The goal of this article is to study the discrepancy of the distribution of arithmetic sequences in arithmetic progressions. We will fix a sequence $\A=\{\a(n)\}_{n\geq 1}$ of non-negative real numbers in a certain class of arithmetic…

Extending a classical estimate of Mertens for the sum of the reciprocals of the first primes, we provide an explicit remainder formula for products of an arbitrary, but fixed, number of primes.

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…

We obtain asymptotic formulae for the second discrete moments of the Riemann zeta function over arithmetic progressions $\frac{1}{2} + i(a n + b)$. It reveals noticeable relation between the discrete moments and the continuous moment of the…

We establish a function field analogue of Mertens' formula for Euler products restricted to primes in arithmetic progressions over the polynomial ring F_q[t]. Our results are in direct correspondence with those of Languasco and Zaccagnini…

This note simplifies the proof of a recent result on the oscillation of the prime product in Martens Theorem, and provides a quantitative expression for the error term. In addition, the corresponding oscillation results for the finite sums…

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.

In this paper we discuss the problem of numerically computing Petersson inner products of modular forms, given their $q$-expansion at $\infty$. A formula of Nelson reduces this to obtaining $q$-expansions at all cusps, and we describe two…

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

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…