Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2403.03912

Digamma function and general Fischer series in the theory of Kempner sums

Jean-François Burnol
View original source ↗Read source document ↗Export metadata ↓

Abstract

The harmonic sum of the integers which are missing $p$ given digits in a base $b$ is expressed as $b\log(b)/p$ plus corrections indexed by the excluded digits and expressed as integrals involving the digamma function and a suitable measure. A number of consequences are derived, such as explicit bounds, monotony, series representations and asymptotic expansions involving the zeta values at integers, and suitable moments of the measure. In the classic Kempner case of $b=10$ and $9$ as the only excluded digit, the series representation turns out to be exactly identical with a result obtained by Fischer already in 1993. Extending this work is indeed the goal of the present contribution.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-François Burnol. 2024-04-27. Digamma function and general Fischer series in the theory of Kempner sums. https://doi.org/10.1016/j.exmath.2024.125604

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↗