Ramanujan's cubic continued fraction revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

continued fraction ∗

We use a continued fraction expansion of the sign-function in order to obtain a five dimensional formulation of the overlap lattice Dirac operator. Within this formulation the inverse of the overlap operator can be calculated by a single Krylov space method where nested conjugate gradient procedures are avoided. We show that the five dimensional linear system can be made well conditioned using ...

متن کامل

A q-CONTINUED FRACTION

Let a, b, c, d be complex numbers with d 6= 0 and |q| < 1. Define H1(a, b, c, d, q) := 1 1 + −abq + c (a + b)q + d + · · · + −abq + cq (a + b)qn+1 + d + · · · . We show that H1(a, b, c, d, q) converges and 1 H1(a, b, c, d, q) − 1 = c − abq d + aq P∞ j=0 (b/d)(−c/bd)j q (q)j(−aq/d)j P∞ j=0 (b/d)(−c/bd)j q (q)j(−aq/d)j . We then use this result to deduce various corollaries, including the followi...

متن کامل

A Specialised Continued Fraction

We display a number with a surprising continued fraction expansion and show that we may explain that expansion as a specialisation of the continued fraction expansion of a formal series: A series ∑ chX −h has a continued fraction expansion with partial quotients polynomials in X of positive degree (other, perhaps than the 0-th partial quotient). Simple arguments, let alone examples, demonstrate...

متن کامل

Revisited Using Continued Fractions

If the equation of the title has an integer solution with k ≥ 2, then m > 109.3·10 6 . This was the current best result and proved using a method due to L. Moser (1953). This approach cannot be improved to reach the benchmark m > 1010 7 . Here we achieve m > 1010 9 by showing that 2k/(2m−3) is a convergent of log 2 and making an extensive continued fraction digits calculation of (log 2)/N , wit...

متن کامل

Ramanujan’s Cubic Continued Fraction and Ramanujan Type Congruences for a Certain Partition Function

In this paper, we study the divisibility of the function a(n) defined by ∑ n≥0 a(n)q n := (q; q)−1 ∞ (q ; q2)−1 ∞ . In particular, we prove certain “Ramanujan type congruences” for a(n) modulo powers of 3.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Arithmetica

سال: 2007

ISSN: 0065-1036,1730-6264

DOI: 10.4064/aa126-4-2