Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2511.07132

On Higher-Power Moments of $ Δ_a(x) $ for $-1/2<a<0$

Yi Cai·Jinjiang Li·Yankun Sui·Fei Xue·Min Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $-1/2<a<0$ be a fixed real number and \begin{equation*} Δ_{a}(x)=\sideset{}{'}\sum_{n\leq x} σ_a(n)-ζ(1-a)x-\frac{ζ(1+a)}{1+a}x^{1+a}+\frac{1}{2}ζ(-a). \end{equation*} In this paper, we investigate the higher--power moments of $Δ_a(x)$ and give the corresponding asymptotic formula for the integral $\int_{1}^{T}Δ_a^k(x)\mathrm{d}x$, which constitutes an improvement upon the previous result of Zhai [9] for $k=3,4,5$ and an enlargement of the upper bound of $k$ to $7$.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yi Cai, Jinjiang Li, Yankun Sui, Fei Xue, Min Zhang. 2025-11-10. On Higher-Power Moments of $ Δ_a(x) $ for $-1/2<a<0$. https://arxiv.org/abs/2511.07132

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗