Related papers: On the first sign change in Mertens' Theorem

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…

Let $a>1$. Denote by $l_a(p)$ the multiplicative order of $a$ modulo $p$. We look for an estimate of sum of $\frac{l_a(p)}{p-1}$ over primes $p\leq x$ on average. When we average over $a\leq N$, we observe a statistic of $C\mathrm{Li}(x)$.…

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

We improve the lower bound for $V(T)$, the number of sign changes of the error term $\psi(x)-x$ in the Prime Number Theorem in the interval $[1,T]$ for large $T$. We show that \[ \liminf_{T\to\infty}\frac{V(T)}{\log…

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…

In this paper, we establish new explicit bounds for the Mertens function $M(x)$. In particular, we compare $M(x)$ against a short-sum over the non-trivial zeros of the Riemann zeta-function $\zeta(s)$, whose difference we can bound using…

It is well known that $\sum_{p\le n} 1/p =\ln(\ln(n)) + O(1)$ where $p$ goes over the primes. We give several known proofs of this. We first present a a proof that $\ge \ln(\ln(n)) + O(1)$. This is based on Euler's proof that $\sum_p 1/p$…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \sigma(n)$ be the sum of divisors function. This note presents the first proof of the asymptotic formula for the average order $ \sum_{p\leq…

Let $<\P > \subset \N$ be a multiplicative subsemigroup of the natural numbers $\N = \{1,2,3,...\}$ generated by an arbitrary set $\P$ of primes (finite or infinite). We given an elementary proof that the partial sums $\sum_{n \in < \P >: n…

We prove that the Kloosterman sum $S(1,1;c)$ can change sign infinitely often as $c$ runs over squarefree moduli with at most 10 prime factors, which improves the previous results of E. Fouvry and Ph. Michel, J. Sivak-Fischler and K.…

We extend the axiomatization for detecting and quantifying sign changes of Meher and Murty to sequences of complex numbers. We further generalize this result when the sequence is comprised of the coefficients of an $L$-function. As…

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…

In this paper we consider the iteration of infinitely many signed exponentials with the same base but the signs may vary. We show that for every base in an explicit interval this iteration converges for any sequence of signs and all the…

Let $f(n)$ be a random completely multiplicative function such that $f(p) = \pm 1$ with probabilities $1/2$ independently at each prime. We study the conditional probability, given that $f(p) = 1$ for all $p < y$, that all partial sums of…

It was believed that the Mertens function is a simple random walk in the first versions of the article, so its asymptotic behavior obeys the law of the iterated logarithm. In the latest version of the article we show why the asymptotic…

For a prime number $p$, let $A_3(p)= | \{ m \in \mathbb{N}: \exists m_1,m_2,m_3 \in \mathbb{N}, \frac{m}{p}=\frac{1}{m_1}+\frac{1}{m_2}+\frac{1}{m_3} \} |$. In 2019 Luca and Pappalardi proved that $x (\log x)^3 \ll \sum_{p \le x} A_{3}(p)…

This research article provides an unconditional proof of an inequality proposed by Srinivasa Ramanujan involving the Prime Counting Function $\pi(x)$, \begin{align*} (\pi(x))^{2}<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right) \end{align*} for…

For $(M,a)=1$, put \begin{equation*} G(X;M,a)=\sup_{p^\prime_n\leq X}(p^\prime_{n+1}-p^\prime_n), \end{equation*} where $p^\prime_n$ denotes the $n$-th prime that is congruent to $a\pmod{M}$. We show that for any positive $C$, provided $X$…

For $k\ge1$, let $R_k(x)$ denote the reciprocal sum up to $x$ of numbers with $k$ prime factors, counted with multiplicity. In prior work, the authors obtained estimates for $R_k(x)$, extending Mertens' second theorem, as well as a…

Let $f$ and $g$ be two Hecke-Maass cusp forms of weight zero for $SL_2(\mathbb Z)$ with Laplacian eigenvalues $\frac{1}{4}+u^2$ and $\frac{1}{4}+v^2$, respectively. Then both have real Fourier coefficients say, $\lambda_f(n)$ and…