Search arXivSearch

arXiv · 1501.00740

Expansions of generalized Euler's constants into the series of polynomials in $π^{-2}$ and into the formal enveloping series with rational coefficients only

Abstract

In this work, two new series expansions for generalized Euler's constants (Stieltjes constants) $γ_m$ are obtained. The first expansion involves Stirling numbers of the first kind, contains polynomials in $π^{-2}$ with rational coefficients and converges slightly better than Euler's series $\sum n^{-2}$. The second expansion is a semi-convergent series with rational coefficients only. This expansion is particularly simple and involves Bernoulli numbers with a non-linear combination of generalized harmonic numbers. It also permits to derive an interesting estimation for generalized Euler's constants, which is more accurate than several well-known estimations. Finally, in Appendix A, the reader will also find two simple integral definitions for the Stirling numbers of the first kind, as well an upper bound for them.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Iaroslav V. Blagouchine. 2016-12-16. Expansions of generalized Euler's constants into the series of polynomials in $π^{-2}$ and into the formal enveloping series with rational coefficients only. https://doi.org/10.1016/j.jnt.2015.06.012%2010.1016%2Fj.jnt.2016.11.002

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