Search arXivSearch

arXiv · math/0506319

Double integrals and infinite products for some classical constants via analytic continuations of Lerch's transcendent

Abstract

The two-fold aim of the paper is to unify and generalize on the one hand the double integrals of Beukers for $ζ(2)$ and $ζ(3),$ and those of the second author for Euler's constant $γ$ and its alternating analog $\ln(4/π),$ and on the other hand the infinite products of the first author for $e$, and of the second author for $π$ and $e^γ.$ We obtain new double integral and infinite product representations of many classical constants, as well as a generalization to Lerch's transcendent of Hadjicostas's double integral formula for the Riemann zeta function, and logarithmic series for the digamma and Euler beta functions. The main tools are analytic continuations of Lerch's function, including Hasse's series. We also use Ramanujan's polylogarithm formula for the sum of a particular series involving harmonic numbers, and his relations between certain dilogarithm values.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jesus Guillera, Jonathan Sondow. 2006-08-05. Double integrals and infinite products for some classical constants via analytic continuations of Lerch's transcendent. https://doi.org/10.1007/s11139-007-9102-0

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