Search arXivSearch

arXiv · 2402.08485

On a Ramanujan-type series associated with the Heegner number 163

Abstract

Using the Wolfram NumberTheory package and the Recognize command, together with numerical estimates involving the elliptic lambda and elliptic alpha functions, Bagis and Glasser, in 2013, introduced a conjectural Ramanujan-type series related to the class number $h(-d) = 1$ for a quadratic form with discriminant $d = 163$. This conjectured series is of level one and has positive terms, and recalls the Chudnovsky brothers' alternating series of the same level, given the connection between the Chudnovsky-Chudnovsky formula and the Heegner number $d = 163$ such that $\mathbb{Q}\left( \sqrt{-d} \right)$ has class number one. We prove Bagis and Glasser's conjecture by proving evaluations for $λ^{\ast}(163)$ and $α(163)$, which we derive using the Chudnovsky brothers' formula together with the analytic continuation of a formula due to the Borwein brothers for Ramanujan-type series of level one. As a byproduct of our method, we obtain an infinite family of Ramanujan-type series for $\frac{1}π$ generalizing the Chudnovsky algorithm.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John M. Campbell. 2024-02-13. On a Ramanujan-type series associated with the Heegner number 163. https://arxiv.org/abs/2402.08485

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