Continued Fractions and the Euclidean Algorithm


 Osborne Nelson
 1 years ago
 Views:
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 2dimensional 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 selfsimilar: 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 righthand side of is nonzero 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 righthand 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 lefthand 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 evenindexed 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 oddindexed convergent and smaller than every evenindexed 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 nonzero 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, AddisonWesley [4] O Perron, Die Lehre von den Kettenbrüchen, 2nd ed, Chelsea 5
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
More informationSome 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,
More informationSubsets of Euclidean domains possessing a unique division algorithm
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
More informationJUST 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= 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
More informationCopy 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,...}
More informationU.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 informationCONTINUED 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
More informationLinear 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
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationMATH 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
More informationNotes 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 informationInteger 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 informationWHEN DOES A CROSS PRODUCT ON R n EXIST?
WHEN DOES A CROSS PRODUCT ON R n EXIST? PETER F. MCLOUGHLIN It is probably safe to say that just about everyone reading this article is familiar with the cross product and the dot product. However, what
More informationA 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 informationFACTORING 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 informationPUTNAM 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 informationCHAPTER 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.
More information1.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,
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More information9. 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 n1 x n1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role
More informationa 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
More informationChapter 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
More informationSUBGROUPS 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 informationThe 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
More informationα = 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
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationSome Lecture Notes and InClass Examples for PreCalculus:
Some Lecture Notes and InClass Examples for PreCalculus: 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
More informationMATH 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
More informationRESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
More informationMathematics 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,
More informationHandout NUMBER THEORY
Handout of NUMBER THEORY by Kus Prihantoso Krisnawan MATHEMATICS DEPARTMENT FACULTY OF MATHEMATICS AND NATURAL SCIENCES YOGYAKARTA STATE UNIVERSITY 2012 Contents Contents i 1 Some Preliminary Considerations
More informationSECTION 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 informationCOMMUTATIVITY 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 informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationSome facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the
More informationPythagorean vectors and their companions. Lattice Cubes
Lattice Cubes Richard Parris Richard Parris (rparris@exeter.edu) received his mathematics degrees from Tufts University (B.A.) and Princeton University (Ph.D.). For more than three decades, he has lived
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is called a quadratic field and it has degree 2 over Q. Similarly,
More informationPolynomials. Dr. philippe B. laval Kennesaw State University. April 3, 2005
Polynomials Dr. philippe B. laval Kennesaw State University April 3, 2005 Abstract Handout on polynomials. The following topics are covered: Polynomial Functions End behavior Extrema Polynomial Division
More informationMath 181 Handout 16. Rich Schwartz. March 9, 2010
Math 8 Handout 6 Rich Schwartz March 9, 200 The purpose of this handout is to describe continued fractions and their connection to hyperbolic geometry. The Gauss Map Given any x (0, ) we define γ(x) =
More informationCOMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V. EROVENKO AND B. SURY ABSTRACT. We compute commutativity degrees of wreath products A B of finite abelian groups A and B. When B
More informationAlgebra I Vocabulary Cards
Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Absolute Value Order of Operations Expression
More information11 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 informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationDeterminants can be used to solve a linear system of equations using Cramer s Rule.
2.6.2 Cramer s Rule Determinants can be used to solve a linear system of equations using Cramer s Rule. Cramer s Rule for Two Equations in Two Variables Given the system This system has the unique solution
More informationDEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsionfree abelian groups, one of isomorphism
More informationIndiana State Core Curriculum Standards updated 2009 Algebra I
Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and
More informationInteger Factorization using the Quadratic Sieve
Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give
More informationFACTORISATION YEARS. A guide for teachers  Years 9 10 June 2011. The Improving Mathematics Education in Schools (TIMES) Project
9 10 YEARS The Improving Mathematics Education in Schools (TIMES) Project FACTORISATION NUMBER AND ALGEBRA Module 33 A guide for teachers  Years 9 10 June 2011 Factorisation (Number and Algebra : Module
More informationminimal polyonomial Example
Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We
More informationSOLVING QUADRATIC EQUATIONS  COMPARE THE FACTORING ac METHOD AND THE NEW DIAGONAL SUM METHOD By Nghi H. Nguyen
SOLVING QUADRATIC EQUATIONS  COMPARE THE FACTORING ac METHOD AND THE NEW DIAGONAL SUM METHOD By Nghi H. Nguyen A. GENERALITIES. When a given quadratic equation can be factored, there are 2 best methods
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on realclosed fields These notes develop the algebraic background needed to understand the model theory of realclosed fields. To understand these notes, a standard graduate course in algebra is
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More informationThe Division Algorithm for Polynomials Handout Monday March 5, 2012
The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,
More informationPROBLEM SET 6: POLYNOMIALS
PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other
More informationThe program also provides supplemental modules on topics in geometry and probability and statistics.
Algebra 1 Course Overview Students develop algebraic fluency by learning the skills needed to solve equations and perform important manipulations with numbers, variables, equations, and inequalities. Students
More informationNotes from February 11
Notes from February 11 Math 130 Course web site: www.courses.fas.harvard.edu/5811 Two lemmas Before proving the theorem which was stated at the end of class on February 8, we begin with two lemmas. The
More informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a nonnegative BMOfunction w, whose reciprocal is also in BMO, belongs to p> A p,and
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationMathematics 31 Precalculus and Limits
Mathematics 31 Precalculus and Limits Overview After completing this section, students will be epected to have acquired reliability and fluency in the algebraic skills of factoring, operations with radicals
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More information15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in twodimensional space (1) 2x y = 3 describes a line in twodimensional space The coefficients of x and y in the equation
More informationAlgebra Practice Problems for Precalculus and Calculus
Algebra Practice Problems for Precalculus and Calculus Solve the following equations for the unknown x: 1. 5 = 7x 16 2. 2x 3 = 5 x 3. 4. 1 2 (x 3) + x = 17 + 3(4 x) 5 x = 2 x 3 Multiply the indicated polynomials
More information3.2 The Factor Theorem and The Remainder Theorem
3. The Factor Theorem and The Remainder Theorem 57 3. The Factor Theorem and The Remainder Theorem Suppose we wish to find the zeros of f(x) = x 3 + 4x 5x 4. Setting f(x) = 0 results in the polynomial
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More informationA Course on Number Theory. Peter J. Cameron
A Course on Number Theory Peter J. Cameron ii Preface These are the notes of the course MTH6128, Number Theory, which I taught at Queen Mary, University of London, in the spring semester of 2009. There
More informationLAKE ELSINORE UNIFIED SCHOOL DISTRICT
LAKE ELSINORE UNIFIED SCHOOL DISTRICT Title: PLATO Algebra 1Semester 2 Grade Level: 1012 Department: Mathematics Credit: 5 Prerequisite: Letter grade of F and/or N/C in Algebra 1, Semester 2 Course Description:
More informationFactoring Algorithms
Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationBreaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and
Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationLecture 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 informationFactoring 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 information5. Factoring by the QF method
5. Factoring by the QF method 5.0 Preliminaries 5.1 The QF view of factorability 5.2 Illustration of the QF view of factorability 5.3 The QF approach to factorization 5.4 Alternative factorization by the
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationLagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given.
Polynomials (Ch.1) Study Guide by BS, JL, AZ, CC, SH, HL Lagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given. Sasha s method
More informationAlgebra 1 Course Title
Algebra 1 Course Title Course wide 1. What patterns and methods are being used? Course wide 1. Students will be adept at solving and graphing linear and quadratic equations 2. Students will be adept
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More information7. 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 informationAlum Rock Elementary Union School District Algebra I Study Guide for Benchmark III
Alum Rock Elementary Union School District Algebra I Study Guide for Benchmark III Name Date Adding and Subtracting Polynomials Algebra Standard 10.0 A polynomial is a sum of one ore more monomials. Polynomial
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationEigenvalues, Eigenvectors, Matrix Factoring, and Principal Components
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationCORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREERREADY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREERREADY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
More informationTHREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
More informationINCIDENCEBETWEENNESS GEOMETRY
INCIDENCEBETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationWhat are the place values to the left of the decimal point and their associated powers of ten?
The verbal answers to all of the following questions should be memorized before completion of algebra. Answers that are not memorized will hinder your ability to succeed in geometry and algebra. (Everything
More informationON GALOIS REALIZATIONS OF THE 2COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationThnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks
Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationAlgebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 201213 school year.
This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra
More informationSection 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
More informationUniversal hashing. In other words, the probability of a collision for two different keys x and y given a hash function randomly chosen from H is 1/m.
Universal hashing No matter how we choose our hash function, it is always possible to devise a set of keys that will hash to the same slot, making the hash scheme perform poorly. To circumvent this, we
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More information