Search arXivSearch

arXiv · 0908.3253

On the possible exceptions for the transcendence of the log-gamma function at rational entries

Abstract

In a recent work [JNT \textbf{129}, 2154 (2009)], Gun and co-workers have claimed that the number $\,\log{Γ(x)} + \log{Γ(1-x)}\,$, $x$ being a rational number between $0$ and $1$, is transcendental with at most \emph{one} possible exception, but the proof presented there in that work is \emph{incorrect}. Here in this paper, I point out the mistake they committed and I present a theorem that establishes the transcendence of those numbers with at most \emph{two} possible exceptions. As a consequence, I make use of the reflection property of this function to establish a criteria for the transcendence of $\,\logπ$, a number whose irrationality is not proved yet. This has an interesting consequence for the transcendence of the product $\,π\cdot e$, another number whose irrationality remains unproven.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

F. M. S. Lima. 2014-02-05. On the possible exceptions for the transcendence of the log-gamma function at rational entries. https://arxiv.org/abs/0908.3253

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