Search arXivSearch

arXiv · 1401.3724

A theorem for the closed-form evaluation of the first generalized Stieltjes constant at rational arguments and some related summations

Abstract

Recently, it was conjectured that the first generalized Stieltjes constant at rational argument may be always expressed by means of Euler's constant, the first Stieltjes constant, the $Γ$-function at rational argument(s) and some relatively simple, perhaps even elementary, function. This conjecture was based on the evaluation of $γ_1(1/2)$, $γ_1(1/3)$, $γ_1(2/3)$, $γ_1(1/4)$, $γ_1(3/4)$, $γ_1(1/6)$, $γ_1(5/6)$, which could be expressed in this way. This article completes this previous study and provides an elegant theorem which allows to evaluate the first generalized Stieltjes constant at any rational argument. Several related summation formulæ involving the first generalized Stieltjes constant and the Digamma function are also presented. In passing, an interesting integral representation for the logarithm of the $Γ$-function at rational argument is also obtained. Finally, it is shown that similar theorems may be derived for higher Stieltjes constants as well; in particular, for the second Stieltjes constant the theorem is provided in an explicit form.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Iaroslav V. Blagouchine. 2015-02-23. A theorem for the closed-form evaluation of the first generalized Stieltjes constant at rational arguments and some related summations. https://doi.org/10.1016/j.jnt.2014.08.009%2C%2010.1016%2Fj.jnt.2015.01.001

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