Search arXivSearch

arXiv · 2003.07170

Analogues of Alladi's formula

Abstract

In this note, we mainly show the analogue of one of Alladi's formulas over $\mathbb{Q}$ with respect to the Dirichlet convolutions involving the Möbius function $μ(n)$, which is related to the natural densities of sets of primes by recent work of Dawsey, Sweeting and Woo, and Kural et al. This would give us several new analogues. In particular, we get that if $(k, \ell)=1$, then $$-\sum_{\begin{smallmatrix}n\geq 2\\ p(n)\equiv \ell (\operatorname{mod} k) \end{smallmatrix}} \frac{μ(n)}{φ(n)} = \frac1{φ(k)},$$ where $p(n)$ is the smallest prime divisor of $n$, and $φ(n)$ is Euler's totient function. This refines one of Hardy's formulas in 1921. At the end, we give some examples for the $φ(n)$ replaced by functions "near $n$", which include the sum-of-divisors function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Biao Wang. 2020-06-04. Analogues of Alladi's formula. https://doi.org/10.1016/j.jnt.2020.06.001

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