Search arXivSearch

arXiv · 2604.20400

On the Hyperbolic Fractional Sum of the Divisor Function

Abstract

Let $τ(n)$ denote the classical divisor function. In this paper, we consider the hyperbolic fractional sum of the divisor function defined by $$ T(x) = \sum_{n_1 n_2 \leqslant x} τ\left( \left[ \frac{x}{n_1 n_2} \right] \right) = \sum_{n \leqslant x} τ\left( \left[ \frac{x}{n} \right] \right) τ(n), $$ where $[t]$ denotes the integral part of the real number $t$. By establishing new estimates for a class of three-dimensional exponential sums with constant perturbation, we obtain an improved asymptotic formula for $T(x)$. In particular, we show that for any $\varepsilon > 0$, the error term in the asymptotic expansion of $T(x)$ is bounded by $O(x^{17/30+\varepsilon})$. This result breaks the $4/7$-barrier which corresponds to the application of the classical divisor problem conjecture $1/4+\varepsilon$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ling Li. 2026-04-22. On the Hyperbolic Fractional Sum of the Divisor Function. https://arxiv.org/abs/2604.20400

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