Search arXivSearch

arXiv · 2109.15306

Lerch's $Φ$ and the Polylogarithm at the Negative Integers

Abstract

At the negative integers, there is a simple relation between the Lerch $Φ$ function and the polylogarithm. Starting from that relation and a formula for the polylogarithm at the negative integers known from the literature, we can deduce a simple closed formula for the Lerch $Φ$ function at the negative integers, where the Stirling numbers of the second kind are not needed. Leveraging that finding, we also produce alternative formulae for the $k$-th derivatives of the cotangent and cosecant (ditto, tangent and secant), as simple functions of the negative polylogarithm and Lerch $Φ$, respectively, which is evidence of the importance of these functions (they are less exotic than they seem). Lastly, we extend formulae for the Hurwitz zeta function only valid at the positive integers to the complex half-plane using this novelty.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jose Risomar Sousa. 2024-11-23. Lerch's $Φ$ and the Polylogarithm at the Negative Integers. https://arxiv.org/abs/2109.15306

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