相关论文: The upper bound of the Mertens function from the v…

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} <…

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

Assuming the Riemann Hypothesis we establish an upper bound for the sum of the M{\" o}bius function up to $x$. Our method is based on estimating the frequency with which intervals of a given length can contain an unusual number of ordinates…

In this paper, we derive new properties of the Mertens function and discuss a likely upper bound of the absolute value of the Mertens function $\sqrt{\log{x!}}>|M(x)|$ when $x>1$. Using this likely bound we show that we have a sufficient…

In classical prime number theory there are several asymptotic formulas said to be "equivalent" to the PNT. One is the bound $M(x) = o(x)$ for the sum function of the Moebius function. For Beurling generalized numbers, this estimate is not…

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…

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…

Let the summatory function of the M\"{o}bius function be denoted $M(x)$. We deduce in this article conditional results concerning $M(x)$ assuming the Riemann Hypothesis and a conjecture of Gonek and Hejhal on the negative moments of the…

We consider Mertens' function M(x,q,a) in arithmetic progression, Assuming the generalized Riemann hypothesis (GRH), we show an upper bound that is uniform for all moduli which are not too large. For the proof, a former method of K.…

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…

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…

The validity of the Riemann Hypothesis (RH) on the location of the non-trivial zeros of the Riemann $\zeta$-function is directly related to the growth of the Mertens function $M(x) \,=\,\sum_{k=1}^x \mu(k)$, where $\mu(k)$ is the M\"{o}bius…

Two elementary formulae for Mertens function $M(n)$ are obtained. With these formulae, $M(n)$ can be calculated directly and simply, which can be easily implemented by computer. $M (1) \sim M (2 \times 10^7) $ are calculated one by one.…

In this paper, we study non-trivial upper bounds for the sum $\sum \limits_{n \in S} |\lambda_f(n)|$ where $f$ is a normalized Maass eigencusp form for the full modular group, $\lambda_f(n)$ is the $n$th normalized Fourier coefficient of…

The Mertens function, $M(x) := \sum_{n \leq x} \mu(n)$, is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function $g(n) := (\omega+1)^{-1}(n)$ is defined in terms of the shifted strongly…

We investigate a modified M\"obius $\mu$-function which is related to an infinite product of shifted Riemann zeta-functions. We prove conditional and unconditional upper and lower bounds for its summatory function, and, finally, we discuss…

We give an estimate for sums appearing in the Nyman-Beurling criterion for the Riemann Hypothesis. These sums contain the M\"obius function and are related to the imaginary part of the Estermann zeta function. The estimate is remarkably…

We show that the M\"obius function of an interval in a permutation poset where the lower bound is sum (resp. skew) indecomposable depends solely on the sum (resp. skew) indecomposable permutations contained in the upper bound, and that this…

We find a nontrivial upper bound on the average value of the function M(n) which associates to every positive integer n the minimal Hamming weight of a multiple of n. Some new results about the equation M(n)=M(n') are given.

A multiplicative function $f$ is said to be resembling the M\"{o}bius function if $f$ is supported on the square-free integers, and $f(p)=\pm 1$ for each prime $p$. We prove $O$- and $\Omega$-results for the summatory function $\sum_{n\leq…