Search arXivSearch

arXiv · 2106.01638

On the reciprocal sum of lcm of k-tuples

Abstract

We prove that the reciprocal sum $S_k(x)$ of the least common multiple of $k\geq 3$ positive integers in $\N\cap [1,x]$ satisfies $$ S_k(x)=P_{2^k-1}(\log x)+O(x^{-θ_k+ε}) $$ where $P$ is a polynomial of degree $2^k-1$ and $θ_k=\frac{2^k}{(k+1)^{\frac{k+1}2}}\cdot \frac3{2^k+6k-5}$. This was conjectured in Hilberdink, Luca, and Tóth~\cite[Remark 2.4]{HLT}. We also prove asymptotic formulas for similar sums conjectured there.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sungjin Kim. 2022-04-23. On the reciprocal sum of lcm of k-tuples. https://doi.org/10.1007/s40993-022-00345-6

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