Search arXivSearch

arXiv · 2511.01849

Transcendence Results for $Γ^{(n)}(1)$ and Related Sequences of Generalized Constants

Abstract

Neither the Euler-Mascheroni constant, $γ=0.577215...$, nor the Euler-Gompertz constant, $δ=0.596347...$, is currently known to be irrational. However, it has been proved that at least one of them is transcendental. The two constants are related through a well-known equation of Hardy, equivalent to $γ+δ/e=\textrm{Ein}(1)$, which recently has been generalized to $γ^{(n)}+δ^{(n)}/e=η^{(n)},\:n\geq0$ for sequences of constants $γ^{(n)}$, $δ^{(n)}$, and $η^{(n)}$ (derived respectively from raw, conditional, and partial moments of the $\textrm{Gumbel}(0,1)$ probability distribution). Investigating $γ^{(n)}=(-1)^{n}Γ^{(n)}(1),\:n\geq1$ through $\textrm{Gumbel}(0,1)$ generating functions, we find that $γ^{(2n)}\in\mathbb{Q}[γ,γ^{(2)}$, $γ^{(3)},...,γ^{(2n-1)}]$ for $n\geq2$ and $γ^{(n)}$ is transcendental infinitely often. We then show, via a theorem of Shidlovskii, that the $η^{(n)}$ are algebraically independent, and therefore transcendental, for all $n\geq0$, implying that at least one element of each pair, $\left\{γ^{(n)},δ^{(n)}/e\right\}$ and $\left\{γ^{(n)},δ^{(n)}\right\}$, and at least two elements of the triple $\left\{γ^{(n)},δ^{(n)}/e,δ^{(n)}\right\}$ are transcendental for all $n\geq1$. Further analysis of the $γ^{(n)}$ and $η^{(n)}$ reveals that both the $δ^{(n)}/e$ and $δ^{(n)}$ are transcendental infinitely often with lower asymptotic densities of at least 1/2. Finally, we provide parallel results for the sequences $\widetildeδ^{(n)}$ and $\widetildeη^{(n)}$ satisfying the "non-alternating analogue" equation $γ^{(n)}+\widetildeδ^{(n)}/e=\widetildeη^{(n)}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael R. Powers. 2026-04-13. Transcendence Results for $Γ^{(n)}(1)$ and Related Sequences of Generalized Constants. https://arxiv.org/abs/2511.01849

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