# Continued Fractions and the Euclidean Algorithm

Size: px
Start display at page:

Transcription

1 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 2 The continued fraction expansion of a real number 2 3 First examples 4 4 The case of a rational number 6 5 The symbol [t, t 2,, t r ] 6 6 Application to Continued Fractions 9 7 Bezout s Identity and the double recursion 8 The action of GL 2 Z on the projective line 3 9 Periodic continued fractions 4 References 5 Introduction Continued fractions offer a means of concrete representation for arbitrary real numbers The continued fraction expansion of a real number is an alternative to the representation of such a number as a possibly infinite decimal The reasons for including this topic in the course on Classical Algebra are: i The subject provides many applications of the method of recursion ii It is closely related to the Euclidean algorithm and, in particular, to Bezout s Identity iii It provides an opportunity to introduce the subject of group theory via the 2-dimensional unimodular group GL 2 Z

2 2 The continued fraction expansion of a real number Every real number x is represented by a point on the real line and, as such, falls between two integers For example, if n is an integer and n x < n +, x falls between n and n +, and there is one and only one such integer n for any given real x In the case where x itself is an integer, one has n x The integer n is sometimes called the floor of x, and one often introduces a notation for the floor of x such as n [x] Examples: 2 2 [ 5] 3 [π] For any real x with n [x] the number u x n falls in the unit interval I consisting of all real numbers u for which 0 u < Thus, for given real x there is a unique decomposition x n + u where n is an integer and u is in the unit interval Moreover, u 0 if and only if x is an integer This decomposition is sometimes called the mod one decomposition of a real number It is the first step in the process of expanding x as a continued fraction The process of finding the continued fraction expansion of a real number is a recursive process that procedes one step at a time Given x one begins with the mod one decomposition where n is an integer and 0 u < x n + u, If u 0, which happens if and only if x is an integer, the recursive process terminates with this first step The idea is to obtain a sequence of integers that give a precise determination of x If u > 0, then the reciprocal /u of u satisfies /u > since u is in I and, therefore, u < In this case the second step in the recursive determination of the continued fraction expansion of x is to apply the mod one decomposition to /u One writes where n 2 is an integer and 0 u 2 < steps, one may write /u n 2 + u 2, Combining the equations that represent the first two x n + 2 n 2 + u 2

3 Either u 2 0, in which case the process ends with the expansion x n + n 2, or u 2 > 0 In the latter case one does to u 2 what had just been done to u above under the assumption u > 0 One writes where n 3 is an integer and 0 u 3 < three steps, one may write /u 2 n 3 + u 3, x n + Then combining the equations that represent the first n 2 + n 3+u 3 After k steps, if the process has gone that far, one has integers n, n 2,, n k and real numbers u, u 2,, u k that are members of the unit interval I with u, u 2,, u k all positive One may write x n + n 2 + Alternatively, one may write n 3+ + n k +u k x [n, n 2, n 3,, n k + u k ] If u k 0, the process ends after k steps Otherwise, the process continues at least one more step with /u k n k+ + u k+ In this way one associates with any real number x a sequence, which could be either finite or infinite, n, n 2, of integers This sequence is called the continued fraction expansion of x Convention When [n, n 2, ] is called a continued fraction, it is understood that all of the numbers n j are integers and that n j for j 2 3

4 3 First examples [, 2,, 3] [3, 6, 6, 6, ] 4

5 [2, 3, 5, 2] 2 + [3, 5, 2] [5,2] Let In this case one finds that x x + y, where y Further reflection shows that the continued fraction structure for y is self-similar: y y This simplifies to and leads to the quadratic equation y 7y + 2 3y + 3y 2 6y 2 0 with discriminant 60 y, and, therefore, Since y > 2, one of the two roots of the quadratic equation cannot be y

6 Finally, x 5 2 The idea of the calculation above leads to the conclusion that any continued fraction [n, n 2, ] that eventually repeats is the solution of a quadratic equation with positive discriminant and integer coefficients The converse of this statement is also true, but a proof requires further consideration 4 The case of a rational number The process of finding the continued fraction expansion of a rational number is essentially identical to the process of applying the Euclidean algorithm to the pair of integers given by its numerator and denominator Let x a/b, b > 0, be a representation of a rational number x as a quotient of integers a and b The mod one decomposition a b n + u, u a n b b shows that u r /b, where r is the remainder for division of a by b The case where u 0 is the case where x is an integer Otherwise u > 0, and the mod one decomposition of /u gives b n 2 + u 2, u 2 b n 2r r r This shows that u 2 r 2 /r, where r 2 is the remainder for division of b by r Thus, the successive quotients in Euclid s algorithm are the integers n, n 2, occurring in the continued fraction Euclid s algorithm terminates after a finite number of steps with the appearance of a zero remainder Hence, the continued fraction expansion of every rational number is finite Theorem The continued fraction expansion of a real number is finite if and only if the real number is rational Proof It has just been shown that if x is rational, then the continued fraction expansion of x is finite because its calculation is given by application of the Euclidean algorithm to the numerator and denominator of x The converse statement is the statement that every finite continued fraction represents a rational number That statement will be demonstrated in the following section 5 The symbol [t, t 2,, t r ] For arbitrary real numbers t, t 2,, t r with each t j for j 2 the symbol [t, t 2,, t r ] is defined recursively by: [t ] t 6

7 [t, t 2,, t r ] t + [t 2,, t r ] In order for this definition to make sense one needs to know that the denominator in the right-hand side of is non-zero The condition t j for j 2 guarantees, in fact, that [t 2,, t r ] > 0, as one may prove using induction It is an easy consequence of mathematical induction that the symbol [t, t 2,, t r ] is a rational number if each t j is rational In particular, each finite continued fraction is a rational number Note that the symbol [t, t 2,, t r ] is to be called a continued fraction, according to the convention of the first section, only when each t j is an integer Observe that the recursive nature of the symbol [t,, t r ] suggests that the symbol should be computed in a particular case working from right to left Consider again, for example, the computation above showing that [2, 3, 5, 2] 8/35 Working from right to left one has: [2] 2 [5, 2] 5 + [2] [3, 5, 2] 3 + [5, 2] [2, 3, 5, 2] 2 + [3, 5, 2] There is, however, another approach to computing [t, t 2,, t r ] Let, in fact, t, t 2, be any finite or infinite sequence of real numbers One uses the double recursion 2 p j t j p j + p j 2, j, p 0, p 0 to define the sequence {p j }, j The double recursion, differently initialized, 3 q j t j q j + q j 2, j, q 0 0, q defines the sequence {q j }, j Note that p t, p 2 t t 2 +, and q, q 2 t 2, q 3 t 2 t 3 +, One now forms the matrix 4 M j p j q j p j q j for j 0 Thus, for example, M 0 0 0, and M t 0 It is easy to see that the matrices M j satisfy the double recursion tj 5 M j M 0 j, j 7

8 as a consequence of the double recursion formulas for the p j and q j Hence, a simple argument by mathematical induction shows that tr t2 t 6 M r, r This is summarized by: Proposition For any sequence {t j }, j of real numbers, if {p j } and {q j } are the sequences defined by the double recursions 2 and 3, then one has the matrix identity p r q r tr t2 t 7 p r q r for each integer r Corollary One has the identity p r q r q r p r r for each integer r Proof The number p r q r q r p r is the determinant of the matrix M r From the formula 6 the matrix M r is the product of r matrix factors, each of which has determinant Since the determinant of the product of matrices is the product of the determinants of the factors, it is clear that detm r r Corollary 2 One has the vector identity pr t t2 8 q r 0 0 for each integer r tr 0 0 Proof First recall i that the product of a matrix and a column vector is defined by the relation a b x ax + by, c d y cx + dy ii that the transpose of a matrix is the matrix whose rows are the columns of the given matrix, and iii that the transpose operation reverses matrix multiplication One tranposes both sides of the relation 7 to obtain: pr p 9 r q r q r t 0 t2 0 tr 0 To this relation one applies the principle that the first column of any 2 2 matrix is the product of that matrix with the column 0 in order to obtain the column identity 8 Theorem 2 For any sequence {t j }, j of real numbers, if {p j } and {q j } are the sequences defined by the double recursions 2 and 3, and if t j for j 2, then the value of the symbol [t,, t r ] is given by the formula 0 [t, t 2,, t r ] p r q r for r 8

9 Proof What is slightly strange about this important result is that while the {p r } and the {q r } are defined by the front end recursions, albeit double recursions, 2 and 3, the symbol [t,, t r ] is defined by the back end recursion The proof begins with the comment that the right-hand side of 0 does not make sense unless one can be sure that the denominator q r 0 One can show easily by induction on r that q r for r under the hypothesis t j for j 2 The proof proceeds by induction on r If r, the assertion of the theorem is simply the statement t p /q, and, as noted above, p t and q Assume now that r 2 By induction we may assume the correctness of the statement 0 for symbols of length r, and, therefore, for the symbol [t 2,, t r ] That case of the statement says that [t 2,, t r ] must be equal to a/c, where by corollary 2 a a b c c d 0 with a b c d t2 0 tr 0 Now by [t, t 2,, t r ] t + a/c t + c a at + c a But by corollary 2 again pr t a b q r 0 c d 0 at + c bt + d a b 0 at + c a Hence, p r at + c q r a [t, t 2,, t r ] 6 Application to Continued Fractions Recall that [n, n 2, ] is called a continued fraction only when each n j is an integer and n j for j 2 The sequence n, n 2, may be finite or infinite The symbol c r [n, n 2,, n r ] formed with the first r terms of the sequence, is called the r th convergent of the continued fraction Associated with a given sequence n, n 2, are two sequences p, p 2, and q, q 2, that are given, according to the double recursions 2, 3 of the previous section with t j n j Proposition 2 If [n, n 2, ] is a continued fraction, then the integers p r and q r are coprime for each r Proof By Corollary of the previous section p r q r q r p r r Hence, any positive divisor of both p r and q r must divide the left-hand side of this relation, and, therefore, must also divide r 9

10 Proposition 3 The difference between successive convergents of the continued fraction [n, n 2, ] is given by the formula c r c r r q r q r for r 2 Proof According to the theorem formula 0 at the end of the last section the convergent c r is given by c r p r q r Hence, The last step is by Corollary above c r c r p r q r p r q r p rq r p r q r q r q r r q r q r Remark The formula remains true if c r subject to the assumption t j for j [t,, t r ] where the t j are real numbers Lemma The sequence {q j } is a strictly increasing sequence for j 2 Proof This is easily proved by induction from the recursive definition 3 of the sequence Theorem 3 If [n, n 2, ] is an infinite continued fraction, then the limit always exists lim r p r q r Proof As one plots the convergents c r on the line of real numbers, one moves alternately right and left The formula for the difference between successive convergents elucidates not only the fact of alternate right and left movement but also the fact that each successive movement is smaller than the one preceding Therefore, one has c < c 3 < c 5 < < c 6 < c 4 < c 2 Since any strictly increasing sequence of positive integers must have infinite limit, the seqence q j q j has infinite limit, and so the sequence of reciprocals /q j q j must converge to zero Hence, the sequences of odd- and even-indexed convergents must have the same limit, which is the limit of the sequence of all convergents Definition The limit of the sequence of convergents of an infinite continued fraction is called the value of that continued fraction 0

11 Theorem 4 If [n, n 2, ] is the continued fraction expansion of an irrational number x, then x lim r p r q r ; that is, the value of the continued fraction expansion of a real number is that real number Proof For each r the continued fraction expansion [n, n 2, ] of x is characterized by the identity 2 x [n, n 2,, n r + u r ], where u r is a real number with 0 u r < The sequences of p s and q s for the symbol [n, n 2,, n r + u r ] agree with those for the symbol [n, n 2,, n r ] except for the r th terms One has by 0 where by 3 Hence, [n, n 2,, n r + u r ] P r Q r, q r n r q r + q r 2 Q r n r + u r q r + q r 2 Q r q r + u r q r Therefore, the displacement from c r to x is by r Q r q r r q r q r + u r q 2 r, which is in the same direction but of smaller magnitude than the displacement from c r to c r Therefore, x must be larger than every odd-indexed convergent and smaller than every even-indexed convergent But since all convergents have the same limit, that limit must be x 7 Bezout s Identity and the double recursion It has already been observed that the process of finding the continued fraction expansion of a rational number a/b b > 0, involves the same series of long divisions that are used in the application of the Euclidean algorithm to the pair of integers a and b Recall that at each stage in the Euclidean algorithm the divisor for the current stage is the remainder from the previous stage and the dividend for the current stage is the divisor from the previous stage, or, equivalently, the dividend for the current stage is the remainder from the second previous stage The Euclidean algorithm may thus be viewed as a double recursion that is used to construct the sequence of remainders One starts the double recursion with r a and r 0 b At the j th stage one performs long division of r j 2 by r j to obtain the integer quotient n j and the integer remainder r j that satisfies 0 r j < r j Thus, 3 r j r j 2 n j r j

12 The Euclidean algorithm admits an additional stage if r j > 0 Since there can be at most b stages 0 r j < r j < < r 2 < r < r 0 b, One may use the sequence of successive quotients n j j to form sequences {p j } and {q j }, as in the previous section, according to the double recursions: 4 p j n j p j + p j 2, j ; p 0, p 0 5 q j n j q j + q j 2, j ; q 0 0, q It has already been observed that q j for j and [n, n 2,, n j ] p j q j, j Bezout s Identity says not only that the greatest common divisor of a and b is an integer linear combination of them but that the coefficents in that integer linear combination may be taken, up to a sign, as q and p Theorem 5 If the application of the Euclidean algorithm to a and b b > 0 m th long division, ie, r m 0, then ends with the 6 r j j q j a p j b, j m Proof One uses induction on j For j the statement is r q a p b Since by 4, 5 q and p n, this statement is simply the case j in 3 Assume j 2, and that the formula 6 has been established for indices smaller than j By 3 one has r j r j 2 n j r j In this equation one may use 6 to expand the terms r j 2 and r j to obtain: r j { j 3 q j 2 a p j 2 b } n j { j 2 q j a p j b } { j q j 2 a p j 2 b } + n j { j q j a p j b } j {q j 2 a p j 2 b + n j q j a p j b} j {q j 2 + n j q j a p j 2 + n j p j b} j {q j a p j b} Corollary 3 The greatest common divisor d of a and b is given by the formula 7 d m q m a p m b, where m is the number of divisions required to obtain zero remainder in the Euclidean algorithm 2

13 Proof One knows that d is the last non-zero remainder r m in the Euclidean algorithm This formula for d is the case j m in 6 Corollary 4 8 p m a d, q m b d Proof The last remainder r m 0 The case j m in 6 shows that a/b p m /q m Since, by the first proposition of the preceding section, p m and q m have no common factor, this corollary is evident 8 The action of GL 2 Z on the projective line If a, b, c, d are real numbers with ad bc 0 and a b M c d is the matrix with entries a, b, c, and d, then M z, for z real, will denote the expression 9 One calls M z the action of M on z M z az + b cz + d M z is a perfectly good function of z except for the case z d/c where the denominator cz + d vanishes If it were also true that az + b 0 for the same z, then one would have b/a d/c, in contradiction of the assumption ad bc 0 Thus, when z d/c, the value of M w increases beyond all bounds as w approaches z, and it is convenient to say that M d c where is regarded as large and signless If further it is agreed to define M a c, which is the limiting value of M w as w increases without bound, then one may regard the expression M z as being defined always for all real z and for The set consisting of all real numbers and also the object not a number is called the projective line The projective line is therefore the union of the ordinary affine line with a single point Proposition 4 If [n, n 2, ] is any continued fraction, then 20 [n, n 2,, n r, n r+, ] M [n r+, ] where M n 0 nr 0 3

14 Proof Let z [n r+, ] Then [n, n 2,, n r, n r+, ] [n, n 2,, n r, z] The statement of the proposition now becomes [n, n 2,, n r, z] M z This may be seen to follow by multiplying both sides in formula 9, after replacing t j with n j, by the column z The matrix M in the preceding proposition is an integer matrix with determinant ± The notation GL 2 Z denotes the set of all such matrices The 2 indicates the size of the matrices, and the Z indicates that the entries in such matrices are numbers in the set Z of integers It is easy to check that the product of two members of GL 2 Z is a member of GL 2 Z and that the matrix inverse of a member of GL 2 Z is a member of GL 2 Z Thus, GL 2 Z forms what is called a group The formula 9 defines what is called the action of GL 2 Z on the projective line One says that two points z and w of the projective line are rationally equivalent if there is a matrix M in GL 2 Z for which w M z Since i GL 2 Z is a group, ii M M 2 z M M 2 z, and iii w M z if and only z M w, it is easy to see that every point of the projective line belongs to one and only one rational equivalence class and that two points rationally equivalent to a third must be rationally equivalent to each other Terminology The rational equivalence of points on the projective line is said to be the equivalence relation on the projective line defined by the action of GL 2 Z Example The set of real numbers rationally equivalent to the point is precisely the set of rational numbers Example 2 The proposition above shows that any continued fraction is rationally equivalent to each of its tails It follows that all tails of a continued fraction are rationally equivalent to each other 9 Periodic continued fractions In one of the first examples of a continued fraction expansion, it was shown that 0 [3, 6, 6, 6, ] This is an example of a periodic continued fraction After a finite number of terms the sequence of integers repeats cyclically If a cyclic pattern is present from the very first term, then the continued fraction is called purely periodic Evidently, [6, 6, 6, ] 0 3 is an example of a purely periodic continued fraction Note that a periodic continued fraction cannot represent a rational number since the continued fraction expansion of a rational number is finite 4

15 Theorem 6 Every periodic continued fraction is the continued fraction expansion of a real quadratic irrational number Proof For clarity: it is being asserted that every periodic continued fraction represent a number of the form a + b m c where a, b, c, and m are all integers with m > 0, c 0, and m not a perfect square Numbers of this form with fixed m but varying integers a, b, and c 0 may be added, subtracted, multiplied, and divided without leaving the class of such numbers The statement here about division becomes clear if one remembers always to rationalize denominators Consequently, for M in GL 2 Z the number M z will be a number of this form or if and only if z is in the same class Since a periodic continued fraction is rationally equivalent to a purely periodic continued fraction, the question of whether any periodic continued fraction is a quadratic irrationality reduces to the question of whether a purely periodic continued fraction is such Let x [n,, n r, n,, n r, n,, n r, ] be a purely periodic continued fraction By the proposition of the preceding section, x M x where M is notationally identical to the M in 20 Ignoring the computation 9 of M in terms of convergents, let a b M c d Then x ax + b cx + d, or, otherwise said, x is a solution of the quadratic equation cx 2 a dx b 0 Remark 2 It is conversely true that the continued fraction expansion of every real quadratic irrationality is periodic This converse will not be proved here References [] G Chrystal, Algebra: An Elementary Textbook 2 vols, Chelsea [2] G Hardy & E Wright, An Introduction to the Theory of Numbers, Oxford Univ Press [3] S Lang, Introduction to Diophantine Approximations, Addison-Wesley [4] O Perron, Die Lehre von den Kettenbrüchen, 2nd ed, Chelsea 5

### 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.

### 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

### 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

### 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

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

### 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.

### Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### 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

### Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### Zeros of a Polynomial Function

Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### How To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)

Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

### 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

### 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

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}

### Zero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.

MATH 11011 FINDING REAL ZEROS KSU OF A POLYNOMIAL Definitions: Polynomial: is a function of the form P (x) = a n x n + a n 1 x n 1 + + a x + a 1 x + a 0. The numbers a n, a n 1,..., a 1, a 0 are called

### 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

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### 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

### 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

### Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

### 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,

### 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

### Linear Equations in One Variable

Linear Equations in One Variable MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this section we will learn how to: Recognize and combine like terms. Solve

### Systems of Linear Equations

Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

### Math 115 Spring 2011 Written Homework 5 Solutions

. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence

### The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

### Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

### DIVISIBILITY AND GREATEST COMMON DIVISORS

DIVISIBILITY AND GREATEST COMMON DIVISORS KEITH CONRAD 1 Introduction We will begin with a review of divisibility among integers, mostly to set some notation and to indicate its properties Then we will

### Solving Linear Systems, Continued and The Inverse of a Matrix

, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

### 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

### Solutions of Linear Equations in One Variable

2. Solutions of Linear Equations in One Variable 2. OBJECTIVES. Identify a linear equation 2. Combine like terms to solve an equation We begin this chapter by considering one of the most important tools

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Vocabulary Words and Definitions for Algebra

Name: Period: Vocabulary Words and s for Algebra Absolute Value Additive Inverse Algebraic Expression Ascending Order Associative Property Axis of Symmetry Base Binomial Coefficient Combine Like Terms

### 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

### Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

### 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

### GREATEST COMMON DIVISOR

DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their

### MATH 10034 Fundamental Mathematics IV

MATH 0034 Fundamental Mathematics IV http://www.math.kent.edu/ebooks/0034/funmath4.pdf Department of Mathematical Sciences Kent State University January 2, 2009 ii Contents To the Instructor v Polynomials.

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

### Gröbner Bases and their Applications

Gröbner Bases and their Applications Kaitlyn Moran July 30, 2008 1 Introduction We know from the Hilbert Basis Theorem that any ideal in a polynomial ring over a field is finitely generated [3]. However,

### 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

### We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b

In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should

### 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

### 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

### MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

### Section 1.1 Real Numbers

. Natural numbers (N):. Integer numbers (Z): Section. Real Numbers Types of Real Numbers,, 3, 4,,... 0, ±, ±, ±3, ±4, ±,... REMARK: Any natural number is an integer number, but not any integer number is

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### 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

### CONTENTS 1. Peter Kahn. Spring 2007

CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................

### Method To Solve Linear, Polynomial, or Absolute Value Inequalities:

Solving Inequalities An inequality is the result of replacing the = sign in an equation with ,, or. For example, 3x 2 < 7 is a linear inequality. We call it linear because if the < were replaced with

### Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

### 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.

### 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

### God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

### 1.3 Algebraic Expressions

1.3 Algebraic Expressions A polynomial is an expression of the form: a n x n + a n 1 x n 1 +... + a 2 x 2 + a 1 x + a 0 The numbers a 1, a 2,..., a n are called coefficients. Each of the separate parts,

### 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

### Section 4.2: The Division Algorithm and Greatest Common Divisors

Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### Real Roots of Univariate Polynomials with Real Coefficients

Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### 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

### 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

### 1.2 Solving a System of Linear Equations

1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables

### 9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role

### a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x

### Answer Key for California State Standards: Algebra I

Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.

### Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

### 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

### Similarity and Diagonalization. Similar Matrices

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

### 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

### LS.6 Solution Matrices

LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions

### 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

### The last three chapters introduced three major proof techniques: direct,

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

### THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

### The Ideal Class Group

Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

### α = u v. In other words, Orthogonal Projection

Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v

### 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

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

### MATH 21. College Algebra 1 Lecture Notes

MATH 21 College Algebra 1 Lecture Notes MATH 21 3.6 Factoring Review College Algebra 1 Factoring and Foiling 1. (a + b) 2 = a 2 + 2ab + b 2. 2. (a b) 2 = a 2 2ab + b 2. 3. (a + b)(a b) = a 2 b 2. 4. (a

### Mathematics Review for MS Finance Students

Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,

### Some Lecture Notes and In-Class Examples for Pre-Calculus:

Some Lecture Notes and In-Class Examples for Pre-Calculus: Section.7 Definition of a Quadratic Inequality A quadratic inequality is any inequality that can be put in one of the forms ax + bx + c < 0 ax

### Linear Equations and Inequalities

Linear Equations and Inequalities Section 1.1 Prof. Wodarz Math 109 - Fall 2008 Contents 1 Linear Equations 2 1.1 Standard Form of a Linear Equation................ 2 1.2 Solving Linear Equations......................

### Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)

NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain

### 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

### Core Maths C1. Revision Notes

Core Maths C Revision Notes November 0 Core Maths C Algebra... Indices... Rules of indices... Surds... 4 Simplifying surds... 4 Rationalising the denominator... 4 Quadratic functions... 4 Completing the

### 3.1. RATIONAL EXPRESSIONS

3.1. RATIONAL EXPRESSIONS RATIONAL NUMBERS In previous courses you have learned how to operate (do addition, subtraction, multiplication, and division) on rational numbers (fractions). Rational numbers

### This is a square root. The number under the radical is 9. (An asterisk * means multiply.)

Page of Review of Radical Expressions and Equations Skills involving radicals can be divided into the following groups: Evaluate square roots or higher order roots. Simplify radical expressions. Rationalize

### Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such