Search arXivSearch

arXiv · 2105.03927

Parametric binomial sums involving harmonic numbers

Abstract

We present explicit formulas for the following family of parametric binomial sums involving harmonic numbers for $p=0,1,2$ and $|t|\leq1$. $$ \sum_{k=1}^{\infty}\frac{H_{k-1}t^k}{k^p\binom{n+k}{k}}\quad \mbox{and}\quad \sum_{k=1}^{\infty}\frac{t^k}{k^p\binom{n+k}{k}}. $$ We also generalize the following relation between the Stirling numbers of the first kind and the Riemann zeta function to polygamma function and give some applications. $$ ζ(n+1)=\sum_{k=n}^{\infty}\frac{s(k,n)}{kk!}, \quad n=1,2,3,... . $$ As examples, \begin{equation*} ζ(3)=\frac{1}{7}\sum_{k=1}^{\infty}\frac{H_{k-1}4^k}{k^2\binom{2k}{k}},\quad \mbox{and}\quad ζ(3)=\frac{8}{7}+\frac{1}{7}\sum_{k=1}^{\infty}\frac{H_{k-1}4^k}{k^2(2k+1)\binom{2k}{k}}, \end{equation*} which are new series representations for the Apéry constant $ζ(3)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Necdet Batir. 2021-05-09. Parametric binomial sums involving harmonic numbers. https://arxiv.org/abs/2105.03927

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