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
CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationContinued Fractions. Darren C. Collins
Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationTopics in Number Theory
Chapter 8 Topics in Number Theory 8.1 The Greatest Common Divisor Preview Activity 1 (The Greatest Common Divisor) 1. Explain what it means to say that a nonzero integer m divides an integer n. Recall
More informationPELL S EQUATION AND CONTINUED FRACTIONS. 1. Introduction
PELL S EQUATION AND CONTINUED FRACTIONS I. GREGOR DICK Abstract. This paper first provides an exposition of the theory of simple continued fractions; it then discusses Pell s equation x 2 dy 2 = N and
More informationGreatest common divisors
Greatest common divisors Robert Friedman Long division Does 5 divide 34? It is easy to see that the answer is no, for many different reasons: 1. 34 does not end in a 0 or 5. 2. Checking directly by hand,
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationAPPLICATIONS OF THE ORDER FUNCTION
APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and
More informationContinued fractions. Yann BUGEAUD. x 1 + and, more generally, we call any expression of the above form or of the form
Continued fractions Yann BUGEAUD Let x 0, x,... be real numbers with x, x 2,... positive. A finite continued fraction denotes any expression of the form [x 0 ; x, x 2..., x n ] = x 0 + x + x 2 +... + x
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On wellordering and induction: (a) Prove the induction principle from the wellordering principle. (b) Prove the wellordering
More informationLinear Algebra II. Notes 1 September a(b + c) = ab + ac
MTH6140 Linear Algebra II Notes 1 September 2010 1 Vector spaces This course is about linear maps and bilinear forms on vector spaces, how we represent them by matrices, how we manipulate them, and what
More informationMath 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 informationFurther linear algebra. Chapter I. Integers.
Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationNumber Theory Vocabulary (For Middle School Teachers)
Number Theory Vocabulary (For Middle School Teachers) A Absolute value the absolute value of a real number is its distance from zero on the number line. The absolute value of any real number, a, written
More informationPrime Numbers. p 1 p 2 p n + 1.
Prime Numbers 7192006 A prime number is an integer n > 1 whose only positive divisors are 1 and n. An integer greater than 1 which is not prime is composite. Euclid showed that there are infinitely many
More informationAlgebra Interactive. Reader. Arjeh M. Cohen, Hans Cuypers, Hans Sterk. Eindhoven University of Technology
Algebra Interactive Reader Arjeh M. Cohen, Hans Cuypers, Hans Sterk Eindhoven University of Technology iii Preface Algebra Interactive is designed as modern course material for undergraduate courses in
More information2. Integers and Algorithms Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers
2. INTEGERS AND ALGORITHMS 155 2. Integers and Algorithms 2.1. Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers with a b > 0. (1) Apply the division algorithm: a = bq + r, 0 r < b.
More informationa = bq + r where 0 r < b.
Lecture 5: Euclid s algorithm Introduction The fundamental arithmetic operations are addition, subtraction, multiplication and division. But there is a fifth operation which I would argue is just as fundamental
More informationSQUARE ROOTS, CONTINUED FRACTIONS AND THE ORBIT OF 1 0 ON H2 JULIAN ROSEN, KRISHNAN SHANKAR, JUSTIN THOMAS
SQUARE ROOTS, CONTINUED FRACTIONS AND THE ORBIT OF ON H2 JULIAN ROSEN, KRISHNAN SHANKAR, JUSTIN THOMAS. WHEN IS k IRRATIONAL? A SIMPLE PROOF Early in our mathematical training we learn the standard proof
More informationContinued fractions and good approximations.
Continued fractions and good approximations We will study how to find good approximations for important real life constants A good approximation must be both accurate and easy to use For instance, our
More informationMODULAR ARITHMETIC KEITH CONRAD
MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic
More informationMODULAR ARITHMETIC (SHORT VERSION)
MODULAR ARITHMETIC (SHORT VERSION) KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic, which lets
More informationMODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.
MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on
More informationBasic Number Theory 1
Basic Number Theory 1 Divisibility Basic number theory uncovers the multiplicative structure of the integers. As such, the most important relation between integers is divisibility: the nonzero integer
More information1.2 Properties of Integers
10 CHAPTER 1. PRELIMINARIES 1.2 Properties of Integers 1.2.1 The Well Ordering Principle and the Division Algorithm We now focus on a special set, the integers, denoted Z, as this set plays an important
More information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
More information5.5 The real zeros of a polynomial function
5.5 The real zeros of a polynomial function Recall, that c is a zero of a polynomial f(), if f(c) = 0. Eample: a) Find real zeros of f()= + . We need to find for which f() = 0, that is we have to solve
More informationMATRIX 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 +
More informationCS103X: Discrete Structures Homework Assignment 2: Solutions
CS103X: Discrete Structures Homework Assignment 2: Solutions Due February 1, 2008 Exercise 1 (10 Points). Prove or give a counterexample for the following: Use the Fundamental Theorem of Arithmetic to
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More information12 Greatest Common Divisors. The Euclidean Algorithm
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 12 Greatest Common Divisors. The Euclidean Algorithm As mentioned at the end of the previous section, we would like to
More informationThe Real Number System
The Real Number System Preliminaries Given the fundamental importance of the real numbers in mathematics, it is important for mathematicians to have a logically sound description of the real number system.
More information= ( 2) 2 = x 2. x
Rationalizing the Denominator or Numerator Sometimes the denominator or numerator of a fraction has two terms and involves square roots, such as 3 5 or 2 + 3. The denominator or numerator may be rationalized
More informationSOLUTIONS TO HOMEWORK 6
SOLUTIONS TO HOMEWORK 6 1. Suppose that Q(x, y) = Ax + Bxy + Cy is a binary integral quadratic form. Recall from class that the discriminant of Q is defined to be D = B 4AC. The form Q is said to represent
More informationMathematics of Cryptography
CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter
More informationMATRIX 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
More informationReading 7 : Program Correctness
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 7 : Program Correctness 7.1 Program Correctness Showing that a program is correct means that
More informationChapter 6. Number Theory. 6.1 The Division Algorithm
Chapter 6 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,
More informationCHAPTER 3 Numbers and Numeral Systems
CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,
More information1 Introduction. 2 Integer Division
1 Introduction This essay introduces some new sets of numbers. Up to now, the only sets of numbers (algebraic systems) we know is the set Z of integers with the two operations + and and the system R of
More informationCONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS
CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get shortchanged at PROMYS, but they are interesting in their own right and useful in other areas
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 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 informationKevin 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
More informationTheorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.
Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,
More informationMATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.
MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted
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 informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationCHAPTER 3 Numbers and Numeral Systems
CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,
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 informationMATH10040 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
More informationx if x 0, x if x < 0.
Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the
More informationApproximation to real numbers by cubic algebraic integers. II
Annals of Mathematics, 158 (2003), 1081 1087 Approximation to real numbers by cubic algebraic integers. II By Damien Roy* Abstract It has been conjectured for some time that, for any integer n 2, any real
More informationSaxon Algebra 1, Geometry, Algebra 2 correlated to the The Common Core State Standards for Mathematics: High School
Number and Quantity Standards NRN1. Explain how the definition of the meaning of rational exponents follows from extending the properties of integer exponents to those values, allowing for a notation
More informationDefinition of Subtraction x  y = x + 1y2. Subtracting Real Numbers
Algebra Review Numbers FRACTIONS Addition and Subtraction i To add or subtract fractions with the same denominator, add or subtract the numerators and keep the same denominator ii To add or subtract fractions
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: November 8, 2016) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More information1.1 Solving a Linear Equation ax + b = 0
1.1 Solving a Linear Equation ax + b = 0 To solve an equation ax + b = 0 : (i) move b to the other side (subtract b from both sides) (ii) divide both sides by a Example: Solve x = 0 (i) x = 0 x = (ii)
More informationPolynomial Rings If R is a ring, then R[x], the ring of polynomials in x with coefficients in R, consists of all formal
Polynomial Rings 8172009 If R is a ring, then R[x], the ring of polynomials in x with coefficients in R, consists of all formal sums a i x i, where a i = 0 for all but finitely many values of i. If a
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 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 informationSpring As discussed at the end of the last section, we begin our construction of the rational
MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 3 The Rational Numbers 1 3.1 The set Q................................. 1 3.2 Addition and multiplication of rational numbers............
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More informationDefinition: Group A group is a set G together with a binary operation on G, satisfying the following axioms: a (b c) = (a b) c.
Algebraic Structures Abstract algebra is the study of algebraic structures. Such a structure consists of a set together with one or more binary operations, which are required to satisfy certain axioms.
More informationAlgebra Readiness Skills CCSS
The math concepts and skills learned in elementary through middle school provide the foundation for studying highschoollevel algebra. The STAR Math Record Book Student Details page and the Instructional
More informationDefinition For a set F, a polynomial over F with variable x is of the form
*7. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the
More informationAP Prep Algebra II Second Semester
AP Prep Algebra II Second Semester Standards 6.A.3 Represent fractions, decimals, percentages, exponents and scientific notation in equivalent forms. 6.A.4 Identify and apply the associative, commutative,
More informationDifference Equations with Absolute Values
Difference Equations with Absolute Values C.M. Kent and H. Sedaghat Department of Mathematics Virginia Commonwealth University Richmond, VA 384014, USA Abstract.We study a class of multiparameter difference
More information3 More Algebra: Progressions and Binomial Theorem
MATH1983/1954 Mathematics 0C/1C. General information for the academic year 01013: Lecturer: Dr Theodore Voronov, Room.109, School of Mathematics, Alan Turing Building, email: theodore.voronov@manchester.ac.uk.
More informationVocabulary 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
More information8 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
More informationZero: 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
More information(1) (Closure) For each a and b in F, the sum a + b and the product a b are welldefined members of F.
A126 A.1 Basic Algebra We wish to give other alphabets, particularly finite ones, a workable arithmetic. The objects we study (and of which the set {0, 1} together with the above operations is an example)
More information1.1. Basic Concepts. Write sets using set notation. Write sets using set notation. Write sets using set notation. Write sets using set notation.
1.1 Basic Concepts Write sets using set notation. Objectives A set is a collection of objects called the elements or members of the set. 1 2 3 4 5 6 7 Write sets using set notation. Use number lines. Know
More information1 Systems Of Linear Equations and Matrices
1 Systems Of Linear Equations and Matrices 1.1 Systems Of Linear Equations In this section you ll learn what Systems Of Linear Equations are and how to solve them. Remember that equations of the form a
More informationLecture 1: Elementary Number Theory
Lecture 1: Elementary Number Theory The integers are the simplest and most fundamental objects in discrete mathematics. All calculations by computers are based on the arithmetical operations with integers
More informationComplex Numbers and the Complex Exponential
Complex Numbers and the Complex Exponential Frank R. Kschischang The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto September 5, 2005 Numbers and Equations
More informationStanford Math Circle: Sunday, May 9, 2010 SquareTriangular Numbers, Pell s Equation, and Continued Fractions
Stanford Math Circle: Sunday, May 9, 00 SquareTriangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in
More information2 The Euclidean algorithm
2 The Euclidean algorithm Do you understand the number 5? 6? 7? At some point our level of comfort with individual numbers goes down as the numbers get large For some it may be at 43, for others, 4 In
More informationMatrix Inverses. Since the linear system. can be written as. where. ,, and,
Matrix Inverses Consider the ordinary algebraic equation and its solution shown below: Since the linear system can be written as where,, and, (A = coefficient matrix, x = variable vector, b = constant
More informationZeros 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
More informationa i (X α) i, a i C. i=0 This also works naturally for the integers: given a positive integer m and a prime p, we can write it in base p, that is m =
Chapter 5 padic numbers The padic numbers were first introduced by the German mathematician K. Hensel (though they are foreshadowed in the work of his predecessor E. Kummer). It seems that Hensel s main
More informationSome Notes on Taylor Polynomials and Taylor Series
Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited
More informationElementary 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
More information9. FINITELY GENERATED ABELIAN GROUPS
9. FINITLY GNRTD BLIN GROUPS 9.1. belian Groups n abelian group (G, * ) is a set G with a binary operation * such that: (1) (Closure Law) if x, y G then x * y G; (2) (ssociative Law) x * (y * z) = (x *
More information4 Determinant. Properties
4 Determinant. Properties Let me start with a system of two linear equation: a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2. I multiply the first equation by a 22 second by a 12 and subtract the second
More informationFinite Sets. Theorem 5.1. Two nonempty finite sets have the same cardinality if and only if they are equivalent.
MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the socalled prime and maximal ideals. Let
More informationLecture 7 : Inequalities 2.5
3 Lecture 7 : Inequalities.5 Sometimes a problem may require us to find all numbers which satisfy an inequality. An inequality is written like an equation, except the equals sign is replaced by one of
More informationSect 3.3 Zeros of Polynomials Functions
101 Sect 3.3 Zeros of Polynomials Functions Objective 1: Using the Factor Theorem. Recall that a zero of a polynomial P(x) is a number c such that P(c) = 0. If the remainder of P(x) (x c) is zero, then
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 informationMathematics 615. Definition. If M is a number such that x M for all x in S then M is called an upper bound for S.
Mathematics 615 Review: Real numbers, Sequences, Limits, Lim Sup, Set notation. These notes are intended to be a fast review of elementary facts concerning convergence of sequences of real numbers. The
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional 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 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationI. 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
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 information4. Number Theory (Part 2)
4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.
More information1 Algebra  Partial Fractions
1 Algebra  Partial Fractions Definition 1.1 A polynomial P (x) in x is a function that may be written in the form P (x) a n x n + a n 1 x n 1 +... + a 1 x + a 0. a n 0 and n is the degree of the polynomial,
More informationand B = 0 1. Since the size of A is 2 3 and that of B is , A B. Do note, however, that the entries of A and B are the same.
Matrix Arithmetic Harold W. Ellingsen Jr. SUNY Potsdam ellinghw@potsdam.edu This supplements Linear Algebra by Hefferon, which is lacking a chapter of matrix arithmetic for its own sake. Instructors who
More informationBasic Properties of Rings
LECTURE 15 Basic Properties of Rings Theorem 15.1. For any element a in a ring R, the equation a + x 0 R has a unique solution. We know that a + x 0 R has at least one solution u R by Axiom (5) in the
More informationMathematics of Cryptography Modular Arithmetic, Congruence, and Matrices. A Biswas, IT, BESU SHIBPUR
Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices A Biswas, IT, BESU SHIBPUR McGrawHill The McGrawHill Companies, Inc., 2000 Set of Integers The set of integers, denoted by Z,
More information