Related papers: Higher Mertens constants for almost primes II

It is well known that the arithmetic nature of Mills' prime-representing constant is uncertain: we do not know if Mills' constant is a rational or irrational number. In the case of other prime-representing constants, irrationality can be…

Let $\omega^*(n) = \{d|n: d=p-1, \mbox{$p$ is a prime}\}$. We show that, for each integer $k\geq2$, $$ \sum_{n\leq x}\omega^*(n)^k \asymp x(\log x)^{2^k-k-1}, $$ where the implied constant may depend on $k$ only. This confirms a recent…

We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…

Let $r\ge k\ge 2$ be fixed positive integers. Let $\varrho_{r,k}$ denote the characteristic function of the set of $r$-tuples of positive integers with $k$-wise relatively prime components, that is any $k$ of them are relatively prime. We…

In the first part, we consider generalized quadratic Gauss sums as finite analogues of the Jacobi theta function, and the reciprocity law for Gauss sums as their transformation formula. We attach finite Dirichlet series to Gauss sums using…

We give explicit numerical values with 100 decimal digits for the constant in the Mertens product over primes in the arithmetic progressions $a \bmod q$, for $q \in \{3$, ..., $100\}$ and $(a, q) = 1$.

We use state-of-art lattice algorithms to improve the upper bound on the lowest counterexample to the Mertens conjecture to $\approx \exp(1.96 \times 10^{19})$, which is significantly below the conjectured value of $\approx \exp(5.15 \times…

The world of primes has many gaps between evidence and theorems. Here, we review Legendre's conjecture on primes between consecutive squares and recent progress on the weaker question of primes between consecutive larger powers. Assuming…

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…

We derive formulae for Gram matrices arising in the Nyman--Beurling reformulation of the Riemann hypothesis. The development naturally leads upon series of the form $S(x) = \sum_{n\ge 1} R(nx)$ and their reciprocity relations. We give…

The classical Mertens' formula states that $ \prod_{p\le N}\big(1-\frac1p)^{-1}\sim e^\gamma\log N, $ where the product is over all primes $p$ less than or equal to $N$, and $\gamma$ is the Euler-Mascheroni constant. By the Euler product…

Let $k\geq 1$ be an integer. Let $\delta_k(n)$ denote the maximum divisor of $n$ which is co-prime to $k$. We study the error term of the general $m$-th Riesz mean of the arithmetical function $\delta_k(n)$ for any positive integer $m \ge…

In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime…

In this paper, we introduce some explicit approximations for the summation $\sum_{k\leq n}\Omega(k)$, where $\Omega(k)$ is the total number of prime factors of $k$.

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…

The aim of this paper is to give a direct interpretation of the validity of the Riemann hypothesis up to a certain height $T$ in terms of the prime-counting function $\pi(x)$. This is done by proving the well-known explicit Schoenfeld bound…

Nicolas inequality we deal can be written as \begin{equation}\label{Nicineq} e^\gamma \log\log N_x < \dfrac{N_x}{\varphi(N_x)}\,, \end{equation} where $x\ge 2$, $N_x$ denotes the product of the primes less or equal than $x$, $\gamma$ is the…

Assuming the Riemann Hypothesis, we provide effective upper and lower estimates for $\left|\zeta(s)\right|$ right to the critical line. As an application we make explicit Titchmarsh's conditional bound for the Mertens function and…

We derive a lower bound for a second moment of the reciprocal of the derivative of the Riemann zeta-function averaged over the zeros of the zeta-function that is half the size of the conjectured value. Our result is conditional upon the…

In a recent work Friedlander studied the problem of how large consecutive prime gaps should be in order that the sum of the reciprocals should be divergent. Supposing a very deep Hypothesis, a generalization of the Hardy--Littlewood prime…