Search arXivSearch

arXiv · math/0402463

Ramanujan and Extensions and Contractions of Continued Fractions

Abstract

If a continued fraction $K_{n=1}^{\infty} a_{n}/b_{n}$ is known to converge but its limit is not easy to determine, it may be easier to use an extension of $K_{n=1}^{\infty}a_{n}/b_{n}$ to find the limit. By an extension of $K_{n=1}^{\infty} a_{n}/b_{n}$ we mean a continued fraction $K_{n=1}^{\infty} c_{n}/d_{n}$ whose odd or even part is $K_{n=1}^{\infty} a_{n}/b_{n}$. One can then possibly find the limit in one of three ways: (i) Prove the extension converges and find its limit; (ii) Prove the extension converges and find the limit of the other contraction (for example, the odd part, if $K_{n=1}^{\infty}a_{n}/b_{n}$ is the even part); (ii) Find the limit of the other contraction and show that the odd and even parts of the extension tend to the same limit. We apply these ideas to derive new proofs of certain continued fraction identities of Ramanujan and to prove a generalization of an identity involving the Rogers-Ramanujan continued fraction, which was conjectured by Blecksmith and Brillhart.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

James Mc Laughlin, Nancy J. Wyshinski. 2004-02-27. Ramanujan and Extensions and Contractions of Continued Fractions. https://doi.org/10.1007/s11139-007-9048-2

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