相关论文: Conversions explicites des nombres premiers vers l…

The Mertens function is defined as $M(x) = \sum_{n \leq x} \mu(n)$, where $\mu(n)$ is the M\"obius function. The Mertens conjecture states $|M(x)/\sqrt{x}| < 1$ for $x > 1$, which was proven false in 1985 by showing $\liminf M(x)/\sqrt{x} <…

We improve on all the results of [13] by incorporating the finite range computations performed since then by several authors. Thus we have \begin{align*} \Bigg|\sum_{n\le X}\mu(n)\Bigg| &\le \frac{0.006688\,X}{\log X},&&\text{for } X\ge…

Let $\mu(n)$ denote the M\"obius function, define $M(x)= \sum_{n\leq x}^{}\mu (n)$. The main result of this paper is to prove that \begin{equation*} \displaystyle\lim_{x \to +\infty}\frac{M(x)}{x}=0 \end{equation*} which is equivalent to…

We investigate the sums $\sum_{n\le X, (n,q)=1}\frac{\mu(n)}{n^s}\log^k\left(\frac{X}{n}\right)$, where $k\in\{0,1\}$, $s\in\mathbb{C}$, $\Re s>0$. Our goal is to obtain explicit asymptotic estimations for these quantities. To achieve this,…

For integer $n\geqslant 1$ and real number $z\geqslant 1$, define $M(n,z):=\sum_{d|n,\,d\leqslant z}\mu(d)$ where $\mu$ denotes the M\"obius function. Put ${\cal L}(y):=\exp\left\{(\log y)^{3/5}/(\log_2y)^{1/5}\right\}$ $(y\geqslant 3)$. We…

We report the finding of the new upper bound on the lowest positive integer $x$ for which the Mertens conjecture \begin{equation*} \left| \sum_{1 \leq n \leq x} \mu(n) \right| < \sqrt{x} \end{equation*} fails to hold: $x < \exp(1.017 \times…

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 show that $$ \sum_{n\neq m}\frac{\mu(n)\mu(m)}{nm}E_{X}\left(\{nx\}\{mx\}\right)=-\frac{9}{2\pi^{2}}+O\left(\frac{1}{X}\right), $$ where $x$ is uniformly distributed in $[0,X]$ with $X\in \mathbb{N}$, $E_{X}(.)$ denotes the expected…

Let $M(x)=\sum_{1\le n\le x}\mu(n)$ where $\mu$ is the M\"obius function. It is well-known that the Riemann Hypothesis is equivalent to the assertion that $M(x)=O(x^{1/2+\epsilon})$ for all $\epsilon>0$. There has been much interest and…

Let $\mu(n)$ be the M\"{o}bius function and $e(\alpha)=e^{2\pi i\alpha}$. In this paper, we study upper bounds of the classical sum $$S(x,\alpha):=\sum_{1\leq n\leq x}\mu(n)e(\alpha n).$$ We can improve some classical results of Baker and…

We present a new elementary algorithm that takes \[ \mathrm{time} \ \ O_\epsilon\left(x^{\frac{3}{5}} (\log x)^{\frac{3}{5}+\epsilon} \right) \ \ \mathrm{and}\ \ \mathrm{space} \ \ O\left(x^{\frac{3}{10}} (\log x)^{\frac{13}{10}} \right)\]…

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series with meromorphic continuation. Say we are given information on the poles of $A(s)$ with $|\Im s| \leq T$ for some large constant $T$. What is the best way to use such finite spectral data…

We show that, for the M\"obius function $\mu(n)$, we have $$ \sum_{x < n\leq x+x^{\theta}}\mu(n)=o(x^{\theta}) $$ for any $\theta>0.55$. This improves on a result of Ramachandra from 1976, which is valid for $\theta>7/12$. Ramachandra's…

An elementary recursive relation for M$\ddot{\mathrm{o}}$bius function $\mu (n)$ is introduced by two simple ways. With this recursive relation, $\mu (n)$ can be calculated without directly knowing the factorization of the $n$. $\mu (1)…

We study in an explicit manner the partial sums of the multiplicative inverse of the Riemann zeta function and its derivative.

Let $(n_k)_{k=1}^{\infty}$ be a lacunary sequence of integers. We show that if $\mu$ is a probability measure on $[0,1)$ such that $|\widehat{\mu}(t)|\leq c|t|^{-\eta}$, then for $\mu$-almost all $x$, the discrepancy $D_N(n_kx)$ satisfies…

In this paper, considering the concept of Universal Multiplication Table, we show that for every $n\geq 2$, the inequality: $$ M(n)=#\{ij|1\leq i,j\leq n\}\geq\frac{n^2}{\mathfrak{N}(n^2)}, $$ holds true with: $$…

We show that the sum function of the M\"{o}bius function of a Beurling number system must satisfy the asymptotic bound $M(x)=o(x)$ if it satisfies the prime number theorem and its prime distribution function arises from a monotone…

We prove that $$ \sum_{n \leq x} \varphi([x/n])\leq\bigg(\frac{1380}{4009}+\frac{2629}{4009}\cdot\frac1{\zeta(2)}+o(1)\bigg)x\log x $$ as $x\to\infty$, where $\varphi$ denotes the Euler totient function and $[x]$ denotes the integer part of…

We discuss certain identities involving $\mu(n)$ and $M(x)=\sum_{n\leq x}\mu(n)$, the functions of M\"{o}bius and Mertens. These identities allow calculation of $M(N^d)$, for $d=2,3,4,\ldots\ $, as a sum of $O_d \left( N^d(\log N)^{2d -…