Notes on Continued Fractions for Math 4400
|
|
- Gervase Waters
- 5 years ago
- Views:
Transcription
1 . Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural numbers: a 0, a, a, a 3,... is converted into a sequence of rational numbers via: ( ) a 0, a 0 + a, a 0 + a +, a 0 + a a +, a + a 3 Thus, for example, the sequence 3, 7, 5, is converted into: 3 = 3, = 7, which are excellent approximations of π. = , = We will find some useful general properties of continued fractions by replacing numbers a 0, a, a, a 3,... with a sequence of variables: q 0, q, q, q 3,... and considering the sequence of rational functions in many variables: q 0 = q 0, q 0 + = q 0q +, q 0 + q q q + = q 0q q + q 0 + q q q q + Definition. Define polynomials f n and g n by: (in lowest terms). q 0 + q qn = f n(q 0,..., q n ) g n (q,..., q n ) Examples. (o) f 0 (q 0 ) = q 0 and g 0 =. (i) f (q 0, q ) = q 0 q + and g (q ) = q. (ii) f (q 0, q, q ) = q 0 q q + q 0 + q and g (q, q ) = q q +. Proposition. (a) (Each g is an f) g n (q,, q n ) = f n (q,..., q n ). (b) (Recursion) f n (q 0,, q n ) = q 0 f n (q,, q n )+f n (q,, q n ).
2 Proof. By definition of the polynomials f n and g n, we have: hence: q 0 + q + q qn q qn = q 0 + = f n (q,..., q n ) g n (q,..., q n ) ( fn (q,...,q n) g n (q,...,q n) ) = q 0 + g n (q,..., q n ) f n (q,..., q n ) = q 0f n (q,..., q n ) + g n (q,..., q n ) f n (q,..., q n ) and the denominator gives us (a), and the numerator gives us: f n (q 0,..., q n ) = q 0 f n (q,..., q n ) + g n (q,..., q n ) which, with g n (q,..., q n ) = f n (q,..., q n ) from (a), gives us (b). Using the recursion, we can get a few more of these polynomials: Example. (iii) f 3 (q 0, q, q, q 3 ) = q 0 (q q q 3 + q + q 3 ) + (q q 3 + ) (iv) f 4 (q 0, q, q, q 3, q 4 ) = = q 0 q q q 3 + q 0 q + q 0 q 3 + q q 3 + = q 0 (q q q 3 q 4 + q q + q q 4 + q 3 q 4 + ) + q q 3 q 4 + q + q 4 = q 0 q q q 3 q 4 + q 0 q q + q 0 q q 4 + q 0 q 3 q 4 + q q 3 q 4 + q 0 + q + q 4 Notice that the first term is always the product of all the q s. In fact: Euler s Continued Fraction Criterion: f n = q 0 q n + q 0 q n + q i i q i+ i j > q 0 q n q i q i+ q j q j+ + i.e. the other terms are obtained by removing consecutive pairs of q s from the product of all the q s. Example. f 5 = q 0 q 5 + q q 3 q 4 q 5 + q 0 q 3 q 4 q 5 + q 0 q q 4 q 5 + q 0 q q q 5 + q 0 q q q 3 + +q 4 q 5 + q q 5 + q q 3 + q 0 q 5 + q 0 q 3 + q 0 q + Proof. The criterion is true for f 0 (q 0 ) = q 0 and f (q 0 q ) = q 0 q +. By the recursive formula (b) above: f n (q 0,..., q n ) = q 0 f n (q,..., q n ) + f n (q,..., q n )
3 By induction, f n and f n may be assumed to satisfy the criterion, and it then follows from the formula that f n also satisfies the criterion! Corollary. (The palindrome corollary) f n (q 0,..., q n ) = f n (q n,..., q 0 ) Proof. Euler s criterion defines the same polynomial when the order of the variables is reversed. The most important corollary is now the following. Corollary. (An even better recursion) f n (q 0,..., q n ) = q n f n (q 0,..., q n ) + f n (q 0,..., q n ) Proof. Using Corollary and Proposition (b), we have: f n (q 0,..., q n ) = f n (q n,..., q 0 ) = q n f n (q n,..., q 0 )+f n (q n,..., q 0 ) = = q n f n (q 0,..., q n ) + f n (q 0,..., q n ) This corollary, together with the initial conditions: f 0 (q 0 ) = q 0, f (q 0, q ) = q 0 q + is going to turn out to be extremely useful. Back to Numbers. We now apply the polynomial results to continued fractions associated to natural numbers. Definition. Given a sequence of natural numbers a 0, a, a,..., let: (a) A n := f n (a 0, a,..., a n ) and (b) B n := g n (a,..., a n ) = f n (a,..., a n ) Gathering together what we have done with polynomials, we have: Proposition. (a) The sequence of rational numbers (*) coming from the sequence of natural numbers a 0, a, a,... is: A 0 = a 0 B 0, A = a 0a + A A 3,,,... B a B B 3 (b) The numbers A n and B n satisfy the Fibonacci-like rule: A n = a n A n + A n and B n = a n B n + B n for n Proof. (a) is from the definition, and (b) follows from Corollary. Example. Taking the sequence 3, 7, 5, again, we have: A 0 = 3, A =, A = = 333, A 3 = = 355 B 0 =, B = 7, B = = 06, B 3 = = 3 giving the sequence of rational approximations to π that we saw earlier. 3
4 4 Another Example. Take the sequence,,,,.... We have: A 0 =, A =, A = + = 3, A 3 = 3+ = 5, A 4 = 5+3 = 8,... B 0 =, B =, B = + =, B 3 = + = 3, B 4 = 3+ = 5,... which are two copies of the Fibonacci sequence offset by one. The associated sequence of rational numbers: 3,,, 5 3, 8 5, 3 8, 3,... converges pretty rapidly to the golden mean φ = ( + 5)/.. Convergence. We now have some powerful tools for analyzing the sequence of rational numbers that arise from a continued fraction. Proposition 3. Let a 0, a, a,... be a sequence of natural numbers, and let A n and B n be the natural numbers from Proposition. Then: (a) Each quadruple of numbers A n, B n, A n+, B n+ satisfies: A n+ B n A n B n+ = ( ) n (b) Each pair (A n, B n ) is relatively prime so A n /B n is in lowest terms. (c) If the sequence a 0, a, a,... is infinite, then there is a limit: A n lim = α and each n B n α A n B n < < B n B n+ Bn Proof. We prove (a) by induction. First of all: A B 0 A 0 B = (a 0 a + ) a 0 a = ( ) 0 = Using Proposition (b), we have: A n+ B n+ A n+ B n+ = (a n+ A n+ +A n )B n+ A n+ )(a n+ B n+ +B n ) = A n B n+ A n+ B n = ( )(A n+ B n A n B n+ ) which proves it. Then (b) follows directly from (a), since any common factor of A n and B n would be a factor of ( ) n. Finally, for (c), we notice that (a) also gives us: A n+ A n = ( )n B n+ B n B n B n+ which means that the differences of consecutive terms in the sequence: A 0 A A A 3,,,,... B 0 B B B 3 are alternating in sign and decreasing to zero. This implies that the sequence has a limit, and that the limit is between any two consecutive terms, which gives (c).
5 5 Example. The sequence,,,,... gives: A 0 =, A = 3, A = 7, A 3 = 7, A 4 = 4 B 0 =, B =, B = 5, B 3 =, B 4 = 9 which give rational numbers: A 0 A A A 3 A 4 =, =.5, =.4,.47,.44 B 0 B B B 3 B 4 that alternate above and below, and seem to converge to it. Getting to the point (finally) which is to convert α into a i s. Case. α = r 0 is a rational number > in lowest terms r Apply the Euclidean algorithm to the (relatively prime) pair (r 0, r ): r 0 = a 0 r + r ; r = a r + r 3 ; r n = a n r n + ; r n = a n + 0; But the right column gives us: α = a 0 + r = a 0 + r which exactly tells us that. r 0 = a 0 + r r r r = a + r 3 r r r n r n r n = a n a + r r3 = = a 0 + = a n + r n a +... a n + an α = r 0 = A n r B n for the (finite!) sequence a 0, a,..., a n of natural numbers. Bonus! From Proposition 3(a), we get: r 0 B n r A n = ( ) n which tells us precisely how to solve the equation: with integers (x, y). r 0 x + r y =
6 6 Example. α = 6/48. 6 = = = = = The algorithm terminates with an output of:, 3,,, 4. Rebuilding: A 0 = B 0, A = 4 B 3, A = 5 B 4, A 3 = 4 B 3, A 4 = 6 B 4 48 gives the bonus equation =. Case. α > is irrational. In this case there is no Euclidean algorithm, but we may define: [α] is the round down of α to the nearest integer, and {α} = α [α] is the fractional part of α. Then we get an infinite sequence of natural numbers a 0, a, a,... : α = a 0 + α, letting a 0 = [α] and α = {α} α = a + α, letting a = [α ] and α = {α } α = a + α 3, letting a = [α ] and α 3 = {α } etc. Claim. The sequence of rational numbers {A n /B n } coming from the sequence {a n } converges to the number α that we started with. Proof of Claim. From the definitions above, we have: α = a 0 + = a 0 + α a + = a 0 + α a + = a + α 3 and our polynomial results tell us that: α = f n+(a 0,..., a n, α n+ ) f n (a,..., a n, α n+ ) which, by Corollary, tells us that: α = α n+f n (a 0,..., a n ) + f n (a 0,..., a n ) α n+ f n (a,..., a n ) + f n (a,..., a n ) = α n+a n + A n α n+ B n + B n But it is easy to check that this number is between An B n since this is true for all n, it follows that α is the limit! and A n B n, and
7 3. Periodic Continued Fractions. A purely periodic continued fraction is associated to a sequence of natural numbers of the form: If we let: then we get: a 0, a,..., a n, a 0, a,..., a n, a 0, a,..., a n,... A n α = lim n B n α = a 0 + a an+ α from which we may conclude, as in the proof of the claim above, that: α = αa n + A n αb n + B n so α is a root of the quadratic equation: B n x + (B n A n )x A n = 0 and one can solve for α with the quadratic formula. Examples. (i) Expansions of the form: a, a, a, a, a,... give α = a + /α so α is a root of the equation x ax = 0 and since α >, we conclude that: α = a + a + 4 (a) When a = we get the golden mean, α = ( + 5)/. (b) When a = k is even, we get α = k + k + so: k, k, k, k,... is the expansion for k + (ii) Expansions of the form: k, k, k, k,... give α which is a root of: 0 = B x +(B 0 A )x A 0 = k(x kx ) and therefore: α = k + 4k + 8 = k + k + Thus it follows that: k, k, k, k, k,... is the expansion of k + 7
8 8 (iii) Expansions of the form: k,, k,, k,... give α which is a root of x kx k = 0, so: α = k + 4k + 8k = k + k + k and square roots k + k = (k + ) have expansions: (iv) Expansions of the form: k,, k,, k,... k,, k,, k,... give α which is a root of (x kx k) = 0 so: α = k + 4k + 4k = k + k + k and square roots of the form k + k have expansions: k,, k,, k,... Question. Which α > have purely periodic continued fractions? We know each such α is an irrational root of a quadratic equation. Definition. Suppose ax + bx + c = 0 is a quadratic equation, and b 4ac is not a perfect square Then we will say that the roots are a conjugate pair (α, α). Example. (a) If b 4ac < 0, then α, α are complex numbers and they are conjugates in the ordinary sense. (b) The conjugate of the golden mean α = ( + 5)/ is ( 5)/. (c) The conjugate of k (when k is not a perfect square) is k. Theorem. The α > with purely periodic continued fractions: (i) Are irrational numbers, which (ii) Are roots of a quadratic ax + bx + c = 0 with a, b, c Z and (iii) Have a conjugate root α that satisfies < α < 0. Example. Any α of the form: α = k + k + m with 0 < m k is irrational, a root of the quadratic equation: x kx m = 0 and has conjugate root α = k k + m < 0 satisfying < α < 0.
9 4. Pell s Equation. We seek a solution to an equation of the form: x dy = where d > 0 is a natural number that is not itself a perfect square. Strategy. Such a solution satisfies (x y d)(x + y d) = hence: x y d = x + y d and 0 < x y d = y(x + y d) < y Such good approximations of an irrational ( d) by a rational (x/y) are precisely what continued fraction expansions produce. For example, the continued fraction expansion of 7 is,,,, 4,,,, 4,... and the associated sequence of rational numbers: satisfy, respectively:, 3, 5, 8 3,... 7 = = 5 7 = = and (8, 3) is a solution to Pell s equation. A more involved example is 3, whose expansion is: producing the sequence: which satisfy: 3,,,,, 6,,,,, 6,... 3, 4, 7, 3, 8 5, 3 3 = = = = = and although (8, 5) only solves x 3y =, we know how to convert that to a solution to Pell s equation by squaring: (8 5 3) = ( ) 80 3 = giving the solution (649, 80). 9
10 0 Proposition 4. Let: a 0 k, a,..., a n, a 0, a,..., a n,... be the continued fraction expansion of k + m (m k). Then either: (a) n is even, and: or else (b) n is odd, and: A n (k + m) B n = A n (k + m) B n = In the latter case, Pells equation is solved, and in the former: (A n B n k + m) = (A n + (k + m)b n) A n B n k + m solves it with the pair (A n + (k + m)b n, A n B n ). Proof. α = k + k + m has periodic expansion: Let β = k + m. Then: a 0,, a,..., a n, a 0,..., a n,... β = αa n + A n αb n + B n = (β + k)a n + A n (β + k)b n + B n from which it follows that β is a root of the polynomial: B n x (kb n + B n A n )x (ka n + A n ) = 0 But β = k + m, so β is a root of the polynomial: and it follows that: (i) kb n + B n A n = 0 and (ii) ka n + A n = (k + m)b n. x (k + m) = 0 Multiplying (i) through by A n gives us: ka n B n + A n B n A n = 0 and Proposition 3(a) gives us A n B n = A n B n + ( ) n hence: ka n B n +A n B n +( ) n A n = (ka n +A n )B n A n+( ) n = 0 and then (ii) gives: (k + m)b n A n = ( ) n which is exactly what we needed to prove.
11 Final Remarks. Our examples from 3 give us the following expansions: k + m (k, m) expansion (, ), 3 (, ),, 5 (, ), 4 6 (, ),, 4 7 (, 3) not from the examples 8 (, 4),, 4 0 (3, ) 3, 6 (3, ) 3, 3, 6 (3, 3) 3,, 6 3 (3, 4) not from the examples 4 (3, 5) not from the examples 5 (3, 6) 3,, 6 and while these expansions are predictable, the others are mysterious: () 7 has expansion,,,, 4 () 3 has expansion 3,,,,, 6 (3) 4 has expansion 3,,,, 6 and some really long periods appear for small numbers. For example: 46 has expansion 6,, 3,,,, 6,,,, 3,, leading to an enormous smallest solution to Pell s equation of (4335, 3588).
CHAPTER 1 REAL NUMBERS KEY POINTS
CHAPTER 1 REAL NUMBERS 1. Euclid s division lemma : KEY POINTS For given positive integers a and b there exist unique whole numbers q and r satisfying the relation a = bq + r, 0 r < b. 2. Euclid s division
More informationCONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS
CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get short-changed at PROMYS, but they are interesting in their own right and useful in other areas
More informationLesson 3.5 Exercises, pages
Lesson 3.5 Exercises, pages 232 238 A 4. Calculate the value of the discriminant for each quadratic equation. a) 5x 2-9x + 4 = 0 b) 3x 2 + 7x - 2 = 0 In b 2 4ac, substitute: In b 2 4ac, substitute: a 5,
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationMath 3 Variable Manipulation Part 4 Polynomials B COMPLEX NUMBERS A Complex Number is a combination of a Real Number and an Imaginary Number:
Math 3 Variable Manipulation Part 4 Polynomials B COMPLEX NUMBERS A Complex Number is a combination of a Real Number and an Imaginary Number: 1 Examples: 1 + i 39 + 3i 0.8.i + πi + i/ A Complex Number
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationMath 192r, Problem Set #3: Solutions
Math 192r Problem Set #3: Solutions 1. Let F n be the nth Fibonacci number as Wilf indexes them (with F 0 F 1 1 F 2 2 etc.). Give a simple homogeneous linear recurrence relation satisfied by the sequence
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationLecture 2: Continued fractions, rational approximations
Lecture 2: Continued fractions, rational approximations Algorithmic Number Theory (Fall 204) Rutgers University Swastik Kopparty Scribe: Cole Franks Continued Fractions We begin by calculating the continued
More informationPELL S EQUATION, II KEITH CONRAD
PELL S EQUATION, II KEITH CONRAD 1. Introduction In Part I we met Pell s equation x dy = 1 for nonsquare positive integers d. We stated Lagrange s theorem that every Pell equation has a nontrivial solution
More information3 Finite continued fractions
MTH628 Number Theory Notes 3 Spring 209 3 Finite continued fractions 3. Introduction Let us return to the calculation of gcd(225, 57) from the preceding chapter. 225 = 57 + 68 57 = 68 2 + 2 68 = 2 3 +
More informationx 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line?
1 How many natural numbers are between 1.5 and 4.5 on the number line? 2 How many composite numbers are between 7 and 13 on the number line? 3 How many prime numbers are between 7 and 20 on the number
More information1 Total Gadha s Complete Book of NUMBER SYSTEM TYPES OF NUMBERS Natural Numbers The group of numbers starting from 1 and including 1,,, 4, 5, and so on, are known as natural numbers. Zero, negative numbers,
More informationSolving Quadratic Equations by Formula
Algebra Unit: 05 Lesson: 0 Complex Numbers All the quadratic equations solved to this point have had two real solutions or roots. In some cases, solutions involved a double root, but there were always
More informationUnit 2-1: Factoring and Solving Quadratics. 0. I can add, subtract and multiply polynomial expressions
CP Algebra Unit -1: Factoring and Solving Quadratics NOTE PACKET Name: Period Learning Targets: 0. I can add, subtract and multiply polynomial expressions 1. I can factor using GCF.. I can factor by grouping.
More informationUNCC 2001 Algebra II
UNCC 2001 Algebra II March 5, 2001 1. Compute the sum of the roots of x 2 5x + 6 = 0. (A) 3 (B) 7/2 (C) 4 (D) 9/2 (E) 5 (E) The sum of the roots of the quadratic ax 2 + bx + c = 0 is b/a which, for this
More informationKing Fahd University of Petroleum and Minerals Prep-Year Math Program Math Term 161 Recitation (R1, R2)
Math 001 - Term 161 Recitation (R1, R) Question 1: How many rational and irrational numbers are possible between 0 and 1? (a) 1 (b) Finite (c) 0 (d) Infinite (e) Question : A will contain how many elements
More informationMath 473: Practice Problems for Test 1, Fall 2011, SOLUTIONS
Math 473: Practice Problems for Test 1, Fall 011, SOLUTIONS Show your work: 1. (a) Compute the Taylor polynomials P n (x) for f(x) = sin x and x 0 = 0. Solution: Compute f(x) = sin x, f (x) = cos x, f
More informationComplex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i
Complex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i 2 = 1 Sometimes we like to think of i = 1 We can treat
More informationMath 2 Variable Manipulation Part 2 Powers & Roots PROPERTIES OF EXPONENTS:
Math 2 Variable Manipulation Part 2 Powers & Roots PROPERTIES OF EXPONENTS: 1 EXPONENT REVIEW PROBLEMS: 2 1. 2x + x x + x + 5 =? 2. (x 2 + x) (x + 2) =?. The expression 8x (7x 6 x 5 ) is equivalent to?.
More informationMath 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby
Math 8: Advanced Number Theory Samit Dasgupta and Gary Kirby April, 05 Contents Basics of Number Theory. The Fundamental Theorem of Arithmetic......................... The Euclidean Algorithm and Unique
More informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationPell s equation. Michel Waldschmidt
Faculté des Sciences et Techniques (FAST), Bamako, Mali École de recherche CIMPA Théorie des Nombres et Algorithmique Updated: December 7, 200 Pell s equation Michel Waldschmidt This text is available
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationbe any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism
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 UFD. Therefore
More informationMATH98 Intermediate Algebra Practice Test Form A
MATH98 Intermediate Algebra Practice Test Form A MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Solve the equation. 1) (y - 4) - (y + ) = 3y 1) A)
More informationTHE UNIT GROUP OF A REAL QUADRATIC FIELD
THE UNIT GROUP OF A REAL QUADRATIC FIELD While the unit group of an imaginary quadratic field is very simple the unit group of a real quadratic field has nontrivial structure Its study involves some geometry
More information+ 1 3 x2 2x x3 + 3x 2 + 0x x x2 2x + 3 4
Math 4030-001/Foundations of Algebra/Fall 2017 Polynomials at the Foundations: Rational Coefficients The rational numbers are our first field, meaning that all the laws of arithmetic hold, every number
More informationEquations in Quadratic Form
Equations in Quadratic Form MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this lesson we will learn to: make substitutions that allow equations to be written
More informationRemember, you may not use a calculator when you take the assessment test.
Elementary Algebra problems you can use for practice. Remember, you may not use a calculator when you take the assessment test. Use these problems to help you get up to speed. Perform the indicated operation.
More informationNumbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 =
2 Numbers 2.1 Integers You remember the definition of a prime number. On p. 7, we defined a prime number and formulated the Fundamental Theorem of Arithmetic. Numerous beautiful results can be presented
More information1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n).
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been
More information18-29 mai 2015: Oujda (Maroc) École de recherche CIMPA-Oujda Théorie des Nombres et ses Applications. Continued fractions. Michel Waldschmidt
18-29 mai 2015: Oujda (Maroc) École de recherche CIMPA-Oujda Théorie des Nombres et ses Applications. Continued fractions Michel Waldschmidt We first consider generalized continued fractions of the form
More informationMath 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2
Math 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2 April 11, 2016 Chapter 10 Section 1: Addition and Subtraction of Polynomials A monomial is
More informationMath /Foundations of Algebra/Fall 2017 Foundations of the Foundations: Proofs
Math 4030-001/Foundations of Algebra/Fall 017 Foundations of the Foundations: Proofs A proof is a demonstration of the truth of a mathematical statement. We already know what a mathematical statement is.
More informationON THE ELEMENTS OF THE CONTINUED FRACTIONS OF QUADRATIC IRRATIONALS
ON THE ELEMENTS OF THE CONTINUED FRACTIONS OF QUADRATIC IRRATIONALS YAN LI AND LIANRONG MA Abstract In this paper, we study the elements of the continued fractions of Q and ( 1 + 4Q + 1)/2 (Q N) We prove
More informationExercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More informationContinued Fractions: Introduction and Applications
PROCEEDINGS OF THE ROMAN NUMBER THEORY ASSOCIATION Volume 2, Number, March 207, pages 6-8 Michel Waldschmidt Continued Fractions: Introduction and Applications written by Carlo Sanna The continued fraction
More informationReading Mathematical Expressions & Arithmetic Operations Expression Reads Note
Math 001 - Term 171 Reading Mathematical Expressions & Arithmetic Operations Expression Reads Note x A x belongs to A,x is in A Between an element and a set. A B A is a subset of B Between two sets. φ
More information2 Series Solutions near a Regular Singular Point
McGill University Math 325A: Differential Equations LECTURE 17: SERIES SOLUTION OF LINEAR DIFFERENTIAL EQUATIONS II 1 Introduction Text: Chap. 8 In this lecture we investigate series solutions for the
More informationSection 11.1 Sequences
Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationPrime Numbers and Irrational Numbers
Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.
More informationMA22S3 Summary Sheet: Ordinary Differential Equations
MA22S3 Summary Sheet: Ordinary Differential Equations December 14, 2017 Kreyszig s textbook is a suitable guide for this part of the module. Contents 1 Terminology 1 2 First order separable 2 2.1 Separable
More informationAlgebra I Unit Report Summary
Algebra I Unit Report Summary No. Objective Code NCTM Standards Objective Title Real Numbers and Variables Unit - ( Ascend Default unit) 1. A01_01_01 H-A-B.1 Word Phrases As Algebraic Expressions 2. A01_01_02
More informationSection 5.2 Solving Recurrence Relations
Section 5.2 Solving Recurrence Relations If a g(n) = f (a g(0),a g(1),..., a g(n 1) ) find a closed form or an expression for a g(n). Recall: nth degree polynomials have n roots: a n x n + a n 1 x n 1
More informationSeries of Error Terms for Rational Approximations of Irrational Numbers
2 3 47 6 23 Journal of Integer Sequences, Vol. 4 20, Article..4 Series of Error Terms for Rational Approximations of Irrational Numbers Carsten Elsner Fachhochschule für die Wirtschaft Hannover Freundallee
More informationSolving x 2 Dy 2 = N in integers, where D > 0 is not a perfect square. Keith Matthews
Solving x 2 Dy 2 = N in integers, where D > 0 is not a perfect square. Keith Matthews Abstract We describe a neglected algorithm, based on simple continued fractions, due to Lagrange, for deciding the
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
More information1 Continued Fractions
Continued Fractions To start off the course, we consider a generalization of the Euclidean Algorithm which has ancient historical roots and yet still has relevance and applications today.. Continued Fraction
More informationTest 4 also includes review problems from earlier sections so study test reviews 1, 2, and 3 also.
MATD 0370 ELEMENTARY ALGEBRA REVIEW FOR TEST 4 (1.1-10.1, not including 8.2) Test 4 also includes review problems from earlier sections so study test reviews 1, 2, and 3 also. 1. Factor completely: a 2
More informationMath221: HW# 7 solutions
Math22: HW# 7 solutions Andy Royston November 7, 25.3.3 let x = e u. Then ln x = u, x2 = e 2u, and dx = e 2u du. Furthermore, when x =, u, and when x =, u =. Hence x 2 ln x) 3 dx = e 2u u 3 e u du) = e
More informationFIFTH ROOTS OF FIBONACCI FRACTIONS. Christopher P. French Grinnell College, Grinnell, IA (Submitted June 2004-Final Revision September 2004)
Christopher P. French Grinnell College, Grinnell, IA 0112 (Submitted June 2004-Final Revision September 2004) ABSTRACT We prove that when n is odd, the continued fraction expansion of Fn+ begins with a
More information8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been
More informationThe Real Number System
MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely
More information1 Examples of Weak Induction
More About Mathematical Induction Mathematical induction is designed for proving that a statement holds for all nonnegative integers (or integers beyond an initial one). Here are some extra examples of
More informationBasic Fraction and Integer Operations (No calculators please!)
P1 Summer Math Review Packet For Students entering Geometry The problems in this packet are designed to help you review topics from previous mathematics courses that are important to your success in Geometry.
More information1 2 1 = = =
IAP 07 Daniel W Stroock Traditional method for computing square roots: The traditional method for computing square roots is based on the identity (a + b) a + (a + b)b For example to compute one begins
More informationCh. 7.6 Squares, Squaring & Parabolas
Ch. 7.6 Squares, Squaring & Parabolas Learning Intentions: Learn about the squaring & square root function. Graph parabolas. Compare the squaring function with other functions. Relate the squaring function
More informationLegendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
More informationCHAPTER 1. Review of Algebra
CHAPTER 1 Review of Algebra Much of the material in this chapter is revision from GCSE maths (although some of the exercises are harder). Some of it particularly the work on logarithms may be new if you
More informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationSubtraction games. Chapter The Bachet game
Chapter 7 Subtraction games 7.1 The Bachet game Beginning with a positive integer, two players alternately subtract a positive integer < d. The player who gets down to 0 is the winner. There is a set of
More informationCHAPTER EIGHT: SOLVING QUADRATIC EQUATIONS Review April 9 Test April 17 The most important equations at this level of mathematics are quadratic
CHAPTER EIGHT: SOLVING QUADRATIC EQUATIONS Review April 9 Test April 17 The most important equations at this level of mathematics are quadratic equations. They can be solved using a graph, a perfect square,
More informationCONTINUED FRACTIONS. 1. Finite continued fractions A finite continued fraction is defined by [a 0,..., a n ] = a 0 +
CONTINUED FRACTIONS Abstract Continued fractions are used in various areas of number theory and its applications They are seen in the extended Euclidean algorithm; in approximations (of numbers and functions);
More informationAS PURE MATHS REVISION NOTES
AS PURE MATHS REVISION NOTES 1 SURDS A root such as 3 that cannot be written exactly as a fraction is IRRATIONAL An expression that involves irrational roots is in SURD FORM e.g. 2 3 3 + 2 and 3-2 are
More informationCourse MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
More informationSECTION Types of Real Numbers The natural numbers, positive integers, or counting numbers, are
SECTION.-.3. Types of Real Numbers The natural numbers, positive integers, or counting numbers, are The negative integers are N = {, 2, 3,...}. {..., 4, 3, 2, } The integers are the positive integers,
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationObjective Mathematics
Multiple choice questions with ONE correct answer : ( Questions No. 1-5 ) 1. If the equation x n = (x + ) is having exactly three distinct real solutions, then exhaustive set of values of 'n' is given
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationSection September 6, If n = 3, 4, 5,..., the polynomial is called a cubic, quartic, quintic, etc.
Section 2.1-2.2 September 6, 2017 1 Polynomials Definition. A polynomial is an expression of the form a n x n + a n 1 x n 1 + + a 1 x + a 0 where each a 0, a 1,, a n are real numbers, a n 0, and n is a
More informationPolynomial Functions
Polynomial Functions Polynomials A Polynomial in one variable, x, is an expression of the form a n x 0 a 1 x n 1... a n 2 x 2 a n 1 x a n The coefficients represent complex numbers (real or imaginary),
More informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More informationPell s Equation Claire Larkin
Pell s Equation is a Diophantine equation in the form: Pell s Equation Claire Larkin The Equation x 2 dy 2 = where x and y are both integer solutions and n is a positive nonsquare integer. A diophantine
More information2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.
2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say
More informationA Level. A Level Mathematics. Proof by Contradiction (Answers) AQA, Edexcel, OCR. Name: Total Marks:
AQA, Edexcel, OCR A Level A Level Mathematics Proof by Contradiction (Answers) Name: Total Marks: A1 Proof Answers AQA, Edexcel, OCR 1) Prove that there is an infinite amount of prime numbers. Assume there
More informationGaussian integers. 1 = a 2 + b 2 = c 2 + d 2.
Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d
More information. As the binomial coefficients are integers we have that. 2 n(n 1).
Math 580 Homework. 1. Divisibility. Definition 1. Let a, b be integers with a 0. Then b divides b iff there is an integer k such that b = ka. In the case we write a b. In this case we also say a is a factor
More informationInduction. Induction. Induction. Induction. Induction. Induction 2/22/2018
The principle of mathematical induction is a useful tool for proving that a certain predicate is true for all natural numbers. It cannot be used to discover theorems, but only to prove them. If we have
More information( 3) ( ) ( ) ( ) ( ) ( )
81 Instruction: Determining the Possible Rational Roots using the Rational Root Theorem Consider the theorem stated below. Rational Root Theorem: If the rational number b / c, in lowest terms, is a root
More informationMath 480/580 Number Theory Notes. Richard Blecksmith
Math 480/580 Number Theory Notes Richard Blecksmith Contents Chapter 1. Introduction 5 1. Beginning Exercises 5 2. Counting the primes 6 Chapter 2. Math 420 Number Theory Review 9 1. Divisors 9 2. Divisibility
More informationIn Exercises 1 12, list the all of the elements of the given set. 2. The set of all positive integers whose square roots are less than or equal to 3
APPENDIX A EXERCISES In Exercises 1 12, list the all of the elements of the given set. 1. The set of all prime numbers less than 20 2. The set of all positive integers whose square roots are less than
More informationSolving Pell s equation using the nearest square continued fraction
Solving Pell s equation using the nearest square continued fraction Keith Matthews 12th June 2008 Abstract This talk is about the nearest square continued fraction of A.A.K. Ayyangar (1941) and its use
More information2k n. k=0. 3x 2 7 (mod 11) 5 4x 1 (mod 9) 2 r r +1 = r (2 r )
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems take from the extra practice sets presented in random order. The challenge problems have not been included.
More informationProblem Set 5 Solutions
Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true
More informationFoundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapter 0 By Dr. Dalia M. Gil, Ph.D. Statement Statement is an ordinary English statement of fact. It has a subject, a verb, and a predicate. It can be assigned a true
More informationSummer Prep Packet for students entering Algebra 2
Summer Prep Packet for students entering Algebra The following skills and concepts included in this packet are vital for your success in Algebra. The Mt. Hebron Math Department encourages all students
More information3.4. ZEROS OF POLYNOMIAL FUNCTIONS
3.4. ZEROS OF POLYNOMIAL FUNCTIONS What You Should Learn Use the Fundamental Theorem of Algebra to determine the number of zeros of polynomial functions. Find rational zeros of polynomial functions. Find
More informationNatural Numbers Positive Integers. Rational Numbers
Chapter A - - Real Numbers Types of Real Numbers, 2,, 4, Name(s) for the set Natural Numbers Positive Integers Symbol(s) for the set, -, - 2, - Negative integers 0,, 2,, 4, Non- negative integers, -, -
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 5-1 Chapter 5 Number Theory and the Real Number System 5.1 Number Theory Number Theory The study of numbers and their properties. The numbers we use to
More informationSection 7.2 Solving Linear Recurrence Relations
Section 7.2 Solving Linear Recurrence Relations If a g(n) = f (a g(0),a g(1),..., a g(n 1) ) find a closed form or an expression for a g(n). Recall: nth degree polynomials have n roots: a n x n + a n 1
More information8. Dirichlet s Theorem and Farey Fractions
8 Dirichlet s Theorem and Farey Fractions We are concerned here with the approximation of real numbers by rational numbers, generalizations of this concept and various applications to problems in number
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationPower series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0
Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can
More informationMath 200 University of Connecticut
IRRATIONALITY OF π AND e KEITH CONRAD Math 2 University of Connecticut Date: Aug. 3, 25. Contents. Introduction 2. Irrationality of π 2 3. Irrationality of e 3 4. General Ideas 4 5. Irrationality of rational
More informationON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE
ON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE AMANDA FURNESS Abstract. We examine relative class numbers, associated to class numbers of quadratic fields Q( m) for m > 0 and square-free. The relative
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More information