Search arXivSearch

arXiv · 0908.4323

A remark on partial sums involving the Mobius function

Abstract

Let $<¶> \subset \N$ be a multiplicative subsemigroup of the natural numbers $\N = \{1,2,3,...\}$ generated by an arbitrary set $¶$ of primes (finite or infinite). We given an elementary proof that the partial sums $\sum_{n \in < ¶>: n \leq x} \frac{μ(n)}{n}$ are bounded in magnitude by 1. With the aid of the prime number theorem, we also show that these sums converge to $\prod_{p \in ¶} (1 - \frac{1}{p})$ (the case when $¶$ is all the primes is a well-known observation of Landau). Interestingly, this convergence holds even in the presence of non-trivial zeroes and poles of the associated zeta function $ζ_¶(s) := \prod_{p \in ¶} (1-\frac{1}{p^s})^{-1}$ on the line $\{\Re(s)=1\}$. As equivalent forms of the first inequality, we have $|\sum_{n \leq x: (n,P)=1} \frac{μ(n)}{n}| \leq 1$, $|\sum_{n|N: n \leq x} \frac{μ(n)}{n}| \leq 1$, and $|\sum_{n \leq x} \frac{μ(mn)}{n}| \leq 1$ for all $m,x,N,P \geq 1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Terence Tao. 2009-10-05. A remark on partial sums involving the Mobius function. https://arxiv.org/abs/0908.4323

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT