FINITE AND INFINITE ROGERS RAMANUJAN CONTINUED FRACTIONS IN RAMANUJAN S LOST NOTEBOOK

Size: px
Start display at page:

Download "FINITE AND INFINITE ROGERS RAMANUJAN CONTINUED FRACTIONS IN RAMANUJAN S LOST NOTEBOOK"

Transcription

1 FINITE AND INFINITE ROGERS RAMANUJAN CONTINUED FRACTIONS IN RAMANUJAN S LOST NOTEBOOK BRUCE C. BERNDT, SOON-YI KANG AND JAEBUM SOHN Abstract. Some entries on both finite and infinite Rogers Ramanujan continued fractions in the lost notebook are examined.. Introduction Recall that the Rogers Ramanujan continued fraction is defined by. Rq : q/ + q + q + q 3, q <. + In this paper, we focus on two famous and useful identities for Rq recorded by Ramanujan in his notebooks [9], [, p. 6, Entry iii], namely,. and.3 Rq Rq f q/ q / f q R q R q f 6 q qf 6 q, where.4 f q : q; q : q /4 ητ, q e πiτ, Im τ > 0; the function ητ is the Dedekind eta function. In their examination of the continued fractions in Ramanujan s lost notebook [0], the authors of [] overlooked some entries. The purpose of this paper is to examine these neglected entries on continued fractions and offer a few additional related results. In Section, we establish claims made on page 7 of [0] involving finite Rogers Ramanujan continued fractions, while in Section 3, we turn our attention to theorems on Rq itself. 00 Mathematics Subject Classification: Keywords: Rogers Ramanujan continued fraction

2 BRUCE C. BERNDT, SOON-YI KANG AND JAEBUM SOHN. Finite Rogers Ramanujan Continued Fractions On page 7 of [0], Ramanujan examines four finite Rogers Ramanujan continued fractions that were not covered in []. We state the first as Ramanujan recorded it, although it is perhaps more natural to interchange the hypothesis and conclusion. Entry. p. 7. If x 6 + x 4, then. ix x + ix 3 + x 4 ix x 6 0. Observe that the left-hand side. is simply the sixth partial quotient A 6 /B 6 of /q / Rq, where Rq is the Rogers Ramanujan continued fraction defined in., and where q ix. Ramanujan s claim is that if x 6 + x 4, then A 6 0. Proof. First, for a continued fraction b 0 + a b + a b + + a n b n +, recall the standard recurrence relations for the nth approximant A n /B n [, p. 6] A n b n A n + a n A n, B n b n B n + a n B n, for n, with initial values A, B 0, A 0 b 0, and B 0. We calculate the numerators A n, n 6. To that end, A x ix, A 3 x + x 4 + ix 3 x, A 4 x + x 4 x 6 ix x 3 + x, A x + x 4 x 6 + x 8 ixx 4 + x + x 4, A 6 x x + x 4 + x 6 x 4 ix x + x 4 x 6 x 4. We see that A 6 is the first case when the real and imaginary parts have a common factor, which is x 6 x 4. Ramanujan s Entry. then follows. Do further numerators contain a common factor? We can extend Ramanujan s result with the next theorem. We do not have a general theorem, however. Theorem.. If x 4 + 0, then A 7 /B 7 0, and if x but x ±i, then A 8 /B 8 0. Proof. We note that A 7 x 4 + x x 0 + x 8 x 6 + x 4 x + ixx x + x 4 + x 8 x 6 + x 4 +

3 CONTINUED FRACTIONS IN RAMANUJAN S LOST NOTEBOOK 3 and A 8 x 4 + x 8 x 6 + x 8 x 6 + x 4 x + + ixx 8 x 6 + x 4 x + x 0 x 8 + x 6 x 4. Since x 0 + x + x 8 x 6 + x 4 x +, the result follows. The three remaining entries to be examined here are finite Rogers Ramanujan continued fractions evaluated at roots of unity. All three results are consequences of a table found on page 33 of [], which is incorrectly labelled, for it was erroneously assumed that Ramanujan was employing the same notation on page 46 of [0] as he was on page 7. To remedy this blunder made by the second author of [], we redefine P n x and Q n x, for each positive integer n, by. P n a Q n a : P na, x Q n a, x : + ax + ax + + ax n. Then the following table taken from [, p. 33] is correct. Let ρ denote the least positive residue of n modulo. In each evaluation, x is a primitive nth root of unity. P n P n x P n P n 3 x n, 4 mod x ρn/ x ρn/ 0 n, 3 mod x +ρn/ x +ρn/ 0 n 0 mod 0 0 x n/ + x n/ x n/ + x n/ Entry.3 p. 7. If x is a primitive nth root of unity, with n, 3 mod, then.3 + x x x n Proof. If n, 3 mod, then according to the table above, P n 0, which is precisely the assertion of Entry.3. Entry.4 p. 7. If x is a primitive nth root of unity, with n, 4 mod, then + x + x + + x n.4 Proof. From the table above, if n, 4 mod, then. P n 3 Q n 3 + x + x + + The assertion.4 is equivalent to Q n 0. Now,.6 Q n P n + + x + x + x + + x x n 3 x n 0. x n 3 + x n.

4 4 BRUCE C. BERNDT, SOON-YI KANG AND JAEBUM SOHN By., P n 3 0, and since the approximants of. are identical to those of.6, it follows that Q n 0, which is what we sought to prove. Entry. p. 7. If x is a primitive nth root of unity, then, if n 0 mod,.7 + x + and.8 + x + x + + x + + x n x n Proof. According to the table above, when n 0 mod,.9 P n Q n + x + which is the assertion.7. On the other hand,.0 Q n P n + x + + x + x + + x + + x x n x n 0, x n + x n. Since, by.9, P n 0, and since the partial numerators of.0 are identical to those of.9, we conclude that Q n 0, which is equivalent to the claim Theorems about Rq The first entry that we examine does not appear to be correct as recorded in [0, p. 6]. Appearing in Ramanujan s purported identity is the expression 3. q q 0 0, so that the nth term in this product is x n n. We think that 3. is incorrect, and that Ramanujan mis-recorded the second term of the product representation for f q. On the right-hand side of Ramanujan s formula, we find the function F q, which is not defined by Ramanujan. However, F q is evidently the Rogers Ramanujan continued fraction Rq defined in.. Recall that in his second letter to Hardy, Ramanujan used the same notation, but without the factor q /, to denote the Rogers Ramanujan continued fraction [4, p. 7]. We remark that this entry is difficult to read in [0]. Entry 3. p. 6. Define 3. Qq : q f q f q.

5 CONTINUED FRACTIONS IN RAMANUJAN S LOST NOTEBOOK Then, if F q Rq, Qq / Qq { } + F q F q { { } + F q / F q / } { } + F q F q { { }. + F q / F q / } Proof. For brevity, we set t F q Rq and α /. We employ the identities α t f q 3. t q /0 f q + αq n/ + q, n/ 3.6 t α t q / f q f q n n + αq n + q n, which are found on page 06 in Ramanujan s lost notebook [0], [, pp. ]. Now, with the use of 3., we find that the numerator of the right-hand side of 3.3 is equal to { } { } + F q F q t α t 3.7 q /0 f q f q n. + αq n/ + q n/ In 3.6, replace q by q / and let t Rq / F q /. Then the denominator on the right-hand side of 3.3 equals 3.8 { { + F q / } F q } / t α t f q / q /0 f q n + αq n/ + q n/.

6 6 BRUCE C. BERNDT, SOON-YI KANG AND JAEBUM SOHN If we now divide 3.7 by 3.8, we find that the right-hand side of 3.3 is equal to f q q / f q Qq / qf q f q / Qq, which establishes 3.3. If we use + / in place of α in 3. and 3.6, and proceed as above, we obtain 3.4. In the next entry, Ramanujan offers two values for the Rogers Ramanujan continued fraction Rq. Entry 3. p. 04. Let Then 3.9 and 3.0 where t : Re π and t : Re π. t t + ξ t t + ξ, 3. ξ + ξ ξ. The identity 3.0 was proved by K.G. Ramanathan [6, p. 6]. Proof. Recall the definitions of f q and ητ in.4. In both the proofs of 3.9 and 3.0, we employ the familiar transformation formula for the Dedekind eta function [, p. 43, Entry 7iii] 3. η /τ τ/i ητ. First, from., with the use of 3., we find that t t f e π / e π / fe π ηi /0 ηi / 0 η0i/ ηi / 0 ηi /4 ηi /

7 CONTINUED FRACTIONS IN RAMANUJAN S LOST NOTEBOOK 7 g 0 : where g 0 is Ramanujan s class invariant [3, p. 83], [7], and where g g 0 satisfies the equation [3, p. 0], [, p. 73] g 3 g g +. If we now take ξ /g, we see that 3.3 and 3. are identical. Thus, the proof of 3.9 is complete. Second, using again. and 3., we find that t t g, f e π / e π / fe 0π ηi / ηi ηi / ηi ηi / /4 ηi g 0 g. Since g /ξ, we have completed the proof of 3.0. We now offer some identities related to the identity on page 04 in the lost notebook [0] that we examined above. It follows from 3.9 and 3.0 that 3.4 Re π Re π Re π Re π. We generalize 3.4 and find analogous results. Proposition 3.3. If αβ π with α, β > 0, then 3. Re α Re α Re β Re β Proof. It follows from. that Re α Re α Re β Re β 3.6. f e α/ f e β/ e α/ f e 0α e β/ f e 0β.

8 8 BRUCE C. BERNDT, SOON-YI KANG AND JAEBUM SOHN Note from [, p. 43, Entry 7iii] that if αβ π, then 3.7 e α/ α /4 f e α e β/ β /4 f e β. Applying 3.7 twice, once with α and β/ and once with α/ and β for α and β, respectively, we find that f e α/ f e β/ e α/ f e 0α e β/ f e 0β, which, by 3.6, completes the proof. In fact, 3. is equivalent to the beautiful formula found in Ramanujan s second letter to Hardy [8, p. xxviii], [4, p. 7]: if αβ, with α, β > 0, then { } { } Re πα + Re πβ +. Thus 3.9 and 3.0 may be regarded as refinements of 3.8 when α and β /. Another proof of Proposition 3.3. Let t : tα : Re α and t : t β Re β. After some calculation, we can rewrite 3. as 3.9 tt + t + t + tt t + t t t + t t 4. On the other hand, if we let A + /, we may write 3.8 as 3.0 tt + t + t A. Since A + /A, 3.0 can be also written as 3. tt + t + t + /A. Dividing 3. by tt and adding the result to 3. gives 3. tt + t + t + /tt /t + /t + /At + t /t /t. Using 3.0 in 3., we obtain 3.9. Taking the same procedures for Proposition 3.3, using.3 instead of., we can prove an analogous result for R q. Proposition 3.4. If αβ π / with α, β > 0, then 3.3 R e α R e α R e β R e β.

9 CONTINUED FRACTIONS IN RAMANUJAN S LOST NOTEBOOK 9 Proposition 3.4 is equivalent to + + R e α + + R e β +, where αβ π /, which was established by Ramanathan [6, p. 4, Theorem 3]. Similarly, we establish two formulas invloving Sq : R q. We need to use the following transformation formula for fq instead of 3.7. If αβ π, then [, p. 43, Entry 7iv] 3.4 e α/4 α /4 fe α e β/4 β /4 fe β. Proposition 3.. Let Sq R q. If αβ π with α, β > 0, then 3. Se α Se α + Se β Se β +. Equation 3. is equivalent to Entry 39ii in Chapter 6 of Ramanujan s second notebook [9], [, p. 83, Entry 39ii], namely, + Se α + Se β. Proposition 3.6. If αβ π / with α, β > 0, then 3.6 S e α S e α + S e β S e β +. Equation 3.6 is equivalent to + S e α + S e β, which was also established by Ramanathan [6, p. 4, Theorem 4]. References [] G.E. Andrews and B.C. Berndt, Ramanujan s Lost Notebook, Part I, Springer, New York, 00. [] B.C. Berndt, Ramanujan s Notebooks, Part III, Springer-Verlag, New York, 99. [3] B.C. Berndt, Ramanujan s Notebooks, Part V, Springer-Verlag, New York, 998. [4] B.C. Berndt and R.A. Rankin, Ramanujan: Letters and Commentary, American Mathematical Society, Providence, RI, 99; London Mathematical Society, London, 99. [] L. Lorentzen and H. Waadeland, Continued Fractions, Vol. : Convergence Theory, World Scientific, Paris, 008. [6] K.G. Ramanathan, On Ramanujan s continued fraction, Acta Arith , [7] S. Ramanujan, Modular equations and approximations to π, Quart. J. Math. 4 94, [8] S. Ramanujan, Collected Papers, Cambridge University Press, Cambridge, 97; reprinted by Chelsea, New York, 96; reprinted by the American Mathematical Society, Providence, RI, 000.

10 0 BRUCE C. BERNDT, SOON-YI KANG AND JAEBUM SOHN [9] S. Ramanujan, Notebooks volumes, Tata Institute of Fundamental Research, Bombay, 97; new edition 0. [0] S. Ramanujan, The Lost Notebook and Other Unpublished Papers, Narosa, New Delhi, 988. [] H. Weber, Lehrbuch der Algebra, dritter Band, Chelsea, New York, 96. Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 680, USA address: Department of Mathematics, Kangwon National University, Chuncheon, 00-70, Korea address: Department of Mathematics, Yonsei University, Seoul, 0-749, Korea address:

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

Continued Fractions. Darren C. Collins

Continued Fractions. Darren C. Collins Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history

More information

1 Introduction to Ramanujan theta functions

1 Introduction to Ramanujan theta functions A Multisection of q-series Michael Somos 06 Sep 2010 somos@cis.csuohio.edu (draft version 32) 1 Introduction to Ramanujan theta functions Ramanujan used an approach to q-series which is general and is

More information

Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions

Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in

More information

Applications of Fermat s Little Theorem and Congruences

Applications of Fermat s Little Theorem and Congruences Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4

More information

5.1 Radical Notation and Rational Exponents

5.1 Radical Notation and Rational Exponents Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots

More information

CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 Solutions CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

More information

Lecture Notes on Polynomials

Lecture Notes on Polynomials Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex

More information

PRIME FACTORS OF CONSECUTIVE INTEGERS

PRIME FACTORS OF CONSECUTIVE INTEGERS PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in

More information

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

More information

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12 CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

More information

Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

More information

Quotient Rings and Field Extensions

Quotient Rings and Field Extensions Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

More information

Handout #1: Mathematical Reasoning

Handout #1: Mathematical Reasoning Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

More information

Arrangements of Stars on the American Flag

Arrangements of Stars on the American Flag Arrangements of Stars on the American Flag Dimitris Koukoulopoulos and Johann Thiel Abstract. In this article, we examine the existence of nice arrangements of stars on the American flag. We show that

More information

On the largest prime factor of the Mersenne numbers

On the largest prime factor of the Mersenne numbers On the largest prime factor of the Mersenne numbers Kevin Ford Department of Mathematics The University of Illinois at Urbana-Champaign Urbana Champaign, IL 61801, USA ford@math.uiuc.edu Florian Luca Instituto

More information

On the largest prime factor of x 2 1

On the largest prime factor of x 2 1 On the largest prime factor of x 2 1 Florian Luca and Filip Najman Abstract In this paper, we find all integers x such that x 2 1 has only prime factors smaller than 100. This gives some interesting numerical

More information

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets

More information

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)! Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

More information

On continued fractions of the square root of prime numbers

On continued fractions of the square root of prime numbers On continued fractions of the square root of prime numbers Alexandra Ioana Gliga March 17, 2006 Nota Bene: Conjecture 5.2 of the numerical results at the end of this paper was not correctly derived from

More information

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute

More information

9.2 Summation Notation

9.2 Summation Notation 9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

More information

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

More information

Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

More information

Notes on Factoring. MA 206 Kurt Bryan

Notes on Factoring. MA 206 Kurt Bryan The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

More information

3 1. Note that all cubes solve it; therefore, there are no more

3 1. Note that all cubes solve it; therefore, there are no more Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if

More information

Our Primitive Roots. Chris Lyons

Our Primitive Roots. Chris Lyons Our Primitive Roots Chris Lyons Abstract When n is not divisible by 2 or 5, the decimal expansion of the number /n is an infinite repetition of some finite sequence of r digits. For instance, when n =

More information

11 Ideals. 11.1 Revisiting Z

11 Ideals. 11.1 Revisiting Z 11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

More information

Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

More information

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

More information

ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath

ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December

More information

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m) Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

More information

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

More information

The Method of Partial Fractions Math 121 Calculus II Spring 2015

The Method of Partial Fractions Math 121 Calculus II Spring 2015 Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method

More information

Notes on Determinant

Notes on Determinant ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

More information

On some Formulae for Ramanujan s tau Function

On some Formulae for Ramanujan s tau Function Revista Colombiana de Matemáticas Volumen 44(2010)2, páginas 103-112 On some Formulae for Ramanujan s tau Function Sobre algunas fórmulas para la función tau de Ramanujan Luis H. Gallardo University of

More information

Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients

Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca

More information

A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number

A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and

More information

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25

More information

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

More information

Alex, I will take congruent numbers for one million dollars please

Alex, I will take congruent numbers for one million dollars please Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory

More information

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

More information

4.2 Euclid s Classification of Pythagorean Triples

4.2 Euclid s Classification of Pythagorean Triples 178 4. Number Theory: Fermat s Last Theorem Exercise 4.7: A primitive Pythagorean triple is one in which any two of the three numbers are relatively prime. Show that every multiple of a Pythagorean triple

More information

Five fundamental operations. mathematics: addition, subtraction, multiplication, division, and modular forms

Five fundamental operations. mathematics: addition, subtraction, multiplication, division, and modular forms The five fundamental operations of mathematics: addition, subtraction, multiplication, division, and modular forms UC Berkeley Trinity University March 31, 2008 This talk is about counting, and it s about

More information

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree

More information

Algebraic and Transcendental Numbers

Algebraic and Transcendental Numbers Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)

More information

Congruence properties of binary partition functions

Congruence properties of binary partition functions Congruence properties of binary partition functions Katherine Anders, Melissa Dennison, Jennifer Weber Lansing and Bruce Reznick Abstract. Let A be a finite subset of N containing 0, and let f(n) denote

More information

1 Lecture: Integration of rational functions by decomposition

1 Lecture: Integration of rational functions by decomposition Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.

More information

Factoring of Prime Ideals in Extensions

Factoring of Prime Ideals in Extensions Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree

More information

26 Integers: Multiplication, Division, and Order

26 Integers: Multiplication, Division, and Order 26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue

More information

RAMANUJAN, HIS LOST NOTEBOOK, ITS IMPORTANCE

RAMANUJAN, HIS LOST NOTEBOOK, ITS IMPORTANCE RAMANUJAN, HIS LOST NOTEBOOK, ITS IMPORTANCE BRUCE C. BERNDT 1. Brief Biography of Ramanujan Throughout history most famous mathematicians were educated at renowned centers of learning and were taught

More information

On Generalized Fermat Numbers 3 2n +1

On Generalized Fermat Numbers 3 2n +1 Applied Mathematics & Information Sciences 4(3) (010), 307 313 An International Journal c 010 Dixie W Publishing Corporation, U. S. A. On Generalized Fermat Numbers 3 n +1 Amin Witno Department of Basic

More information

3. Mathematical Induction

3. Mathematical Induction 3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

More information

Unique Factorization

Unique Factorization Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon

More information

SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

More information

Reading 13 : Finite State Automata and Regular Expressions

Reading 13 : Finite State Automata and Regular Expressions CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

More information

SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

More information

arxiv:math/0601660v3 [math.nt] 25 Feb 2006

arxiv:math/0601660v3 [math.nt] 25 Feb 2006 NOTES Edited by William Adkins arxiv:math/666v3 [math.nt] 25 Feb 26 A Short Proof of the Simple Continued Fraction Expansion of e Henry Cohn. INTRODUCTION. In [3], Euler analyzed the Riccati equation to

More information

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5. PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

More information

Stupid Divisibility Tricks

Stupid Divisibility Tricks Stupid Divisibility Tricks 101 Ways to Stupefy Your Friends Appeared in Math Horizons November, 2006 Marc Renault Shippensburg University Mathematics Department 1871 Old Main Road Shippensburg, PA 17013

More information

7. Some irreducible polynomials

7. Some irreducible polynomials 7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of

More information

ON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]]

ON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]] #A47 INTEGERS 4 (204) ON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]] Daniel Birmaer Department of Mathematics, Nazareth College, Rochester, New Yor abirma6@naz.edu Juan B. Gil Penn State Altoona,

More information

Counting Primes whose Sum of Digits is Prime

Counting Primes whose Sum of Digits is Prime 2 3 47 6 23 Journal of Integer Sequences, Vol. 5 (202), Article 2.2.2 Counting Primes whose Sum of Digits is Prime Glyn Harman Department of Mathematics Royal Holloway, University of London Egham Surrey

More information

SECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS

SECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS (Section 0.6: Polynomial, Rational, and Algebraic Expressions) 0.6.1 SECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS LEARNING OBJECTIVES Be able to identify polynomial, rational, and algebraic

More information

JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials

More information

SOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KI-ICHIRO HASHIMOTO

SOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KI-ICHIRO HASHIMOTO K. Hashimoto Nagoya Math. J. Vol. 77 (1980), 167-175 SOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KI-ICHIRO HASHIMOTO Introduction In the theory of integral quadratic

More information

Partial Fractions. Combining fractions over a common denominator is a familiar operation from algebra:

Partial Fractions. Combining fractions over a common denominator is a familiar operation from algebra: Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: From the standpoint of integration, the left side of Equation 1 would be much easier to work with than

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

The cyclotomic polynomials

The cyclotomic polynomials The cyclotomic polynomials Notes by G.J.O. Jameson 1. The definition and general results We use the notation e(t) = e 2πit. Note that e(n) = 1 for integers n, e(s + t) = e(s)e(t) for all s, t. e( 1 ) =

More information

0.8 Rational Expressions and Equations

0.8 Rational Expressions and Equations 96 Prerequisites 0.8 Rational Expressions and Equations We now turn our attention to rational expressions - that is, algebraic fractions - and equations which contain them. The reader is encouraged to

More information

EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION

EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION CHRISTIAN ROBENHAGEN RAVNSHØJ Abstract. Consider the Jacobian of a genus two curve defined over a finite field and with complex multiplication.

More information

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean

More information

Zeros of Polynomial Functions

Zeros of Polynomial Functions Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction

More information

Factoring finite abelian groups

Factoring finite abelian groups Journal of Algebra 275 (2004) 540 549 www.elsevier.com/locate/jalgebra Factoring finite abelian groups A.D. Sands Department of Mathematics, Dundee University, Dundee DD1 4HN, Scotland, UK Received 1 April

More information

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics

More information

PYTHAGOREAN TRIPLES KEITH CONRAD

PYTHAGOREAN TRIPLES KEITH CONRAD PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

More information

ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS

ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS YANN BUGEAUD, FLORIAN LUCA, MAURICE MIGNOTTE, SAMIR SIKSEK Abstract If n is a positive integer, write F n for the nth Fibonacci number, and ω(n) for the number

More information

Mathematics. (www.tiwariacademy.com : Focus on free Education) (Chapter 5) (Complex Numbers and Quadratic Equations) (Class XI)

Mathematics. (www.tiwariacademy.com : Focus on free Education) (Chapter 5) (Complex Numbers and Quadratic Equations) (Class XI) ( : Focus on free Education) Miscellaneous Exercise on chapter 5 Question 1: Evaluate: Answer 1: 1 ( : Focus on free Education) Question 2: For any two complex numbers z1 and z2, prove that Re (z1z2) =

More information

Cubes and Cube Roots

Cubes and Cube Roots CUBES AND CUBE ROOTS 109 Cubes and Cube Roots CHAPTER 7 7.1 Introduction This is a story about one of India s great mathematical geniuses, S. Ramanujan. Once another famous mathematician Prof. G.H. Hardy

More information

TOPIC 4: DERIVATIVES

TOPIC 4: DERIVATIVES TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

More information

Properties of sequences Since a sequence is a special kind of function it has analogous properties to functions:

Properties of sequences Since a sequence is a special kind of function it has analogous properties to functions: Sequences and Series A sequence is a special kind of function whose domain is N - the set of natural numbers. The range of a sequence is the collection of terms that make up the sequence. Just as the word

More information

Math Circle Beginners Group October 18, 2015

Math Circle Beginners Group October 18, 2015 Math Circle Beginners Group October 18, 2015 Warm-up problem 1. Let n be a (positive) integer. Prove that if n 2 is odd, then n is also odd. (Hint: Use a proof by contradiction.) Suppose that n 2 is odd

More information

Basic Proof Techniques

Basic Proof Techniques Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

More information

POLYNOMIAL FUNCTIONS

POLYNOMIAL FUNCTIONS POLYNOMIAL FUNCTIONS Polynomial Division.. 314 The Rational Zero Test.....317 Descarte s Rule of Signs... 319 The Remainder Theorem.....31 Finding all Zeros of a Polynomial Function.......33 Writing a

More information

OSTROWSKI FOR NUMBER FIELDS

OSTROWSKI FOR NUMBER FIELDS OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for

More information

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

More information

Activity 1: Using base ten blocks to model operations on decimals

Activity 1: Using base ten blocks to model operations on decimals Rational Numbers 9: Decimal Form of Rational Numbers Objectives To use base ten blocks to model operations on decimal numbers To review the algorithms for addition, subtraction, multiplication and division

More information

Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive

Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime

More information

Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may

Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition

More information

The van Hoeij Algorithm for Factoring Polynomials

The van Hoeij Algorithm for Factoring Polynomials The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial

More information

As we have seen, there is a close connection between Legendre symbols of the form

As we have seen, there is a close connection between Legendre symbols of the form Gauss Sums As we have seen, there is a close connection between Legendre symbols of the form 3 and cube roots of unity. Secifically, if is a rimitive cube root of unity, then 2 ± i 3 and hence 2 2 3 In

More information

Math Workshop October 2010 Fractions and Repeating Decimals

Math Workshop October 2010 Fractions and Repeating Decimals Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,

More information

FACTORING AFTER DEDEKIND

FACTORING AFTER DEDEKIND FACTORING AFTER DEDEKIND KEITH CONRAD Let K be a number field and p be a prime number. When we factor (p) = po K into prime ideals, say (p) = p e 1 1 peg g, we refer to the data of the e i s, the exponents

More information

Lies My Calculator and Computer Told Me

Lies My Calculator and Computer Told Me Lies My Calculator and Computer Told Me 2 LIES MY CALCULATOR AND COMPUTER TOLD ME Lies My Calculator and Computer Told Me See Section.4 for a discussion of graphing calculators and computers with graphing

More information

Florida Math 0028. Correlation of the ALEKS course Florida Math 0028 to the Florida Mathematics Competencies - Upper

Florida Math 0028. Correlation of the ALEKS course Florida Math 0028 to the Florida Mathematics Competencies - Upper Florida Math 0028 Correlation of the ALEKS course Florida Math 0028 to the Florida Mathematics Competencies - Upper Exponents & Polynomials MDECU1: Applies the order of operations to evaluate algebraic

More information

SOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE

SOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE SOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE CRISTINA FLAUT and DIANA SAVIN Communicated by the former editorial board In this paper, we study some properties of the matrix representations of the

More information

Overview. Essential Questions. Precalculus, Quarter 4, Unit 4.5 Build Arithmetic and Geometric Sequences and Series

Overview. Essential Questions. Precalculus, Quarter 4, Unit 4.5 Build Arithmetic and Geometric Sequences and Series Sequences and Series Overview Number of instruction days: 4 6 (1 day = 53 minutes) Content to Be Learned Write arithmetic and geometric sequences both recursively and with an explicit formula, use them

More information

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

More information

Cyclotomic Extensions

Cyclotomic Extensions Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate

More information

Lesson Plan. N.RN.3: Use properties of rational and irrational numbers.

Lesson Plan. N.RN.3: Use properties of rational and irrational numbers. N.RN.3: Use properties of rational irrational numbers. N.RN.3: Use Properties of Rational Irrational Numbers Use properties of rational irrational numbers. 3. Explain why the sum or product of two rational

More information