CONTINUED FRACTIONS. 1. Finite continued fractions A finite continued fraction is defined by [a 0,..., a n ] = a 0 +
|
|
- Theodore Ellis
- 5 years ago
- Views:
Transcription
1 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); in Pell s equation; and more This chapter is largely based on Chapters X and XI of [HW], using matrices and the action of PGL (Z) wherever possible Finite continued fractions A finite continued fraction is defined by [a 0,, a n ] = a 0 + [a,,a n ] Our first main theorem is that an infinite continued fraction is always well defined Proposition We have the equality [a 0,, a m, a m,, a n ] = [a 0,, a m, [a m+,, a n ]] Proof It is enough to prove the case m = 0, which follows from definition There is a strong connection to the Euclidean algorithm, which we do not elaborate on here Convergence of the continued fraction Let a sequence a 0, a, be given; we assume a n for n The purpose of this section is to study infinite continued fractions, thereby showing ( that )[a 0, a, ] is always a well defined real number We set A n = an 0 and note that det(a n ) = Definition Let p =, q = 0; p 0 = a 0, q 0 = ; and for n, () Setting the definition can be rephrased as p n = a n p n + p n, = a n + Q n = pn p n q, n Notes for a course in elementary number theory, Uzi Vishne, 006, Bar-Ilan University
2 CONTINUED FRACTIONS Corollary but Q 0 = A 0, so that Q n = A n Q n ; () Q n = A n A 0 The main equality: Corollary 3 The determinant p n p n = det Q n is equal to ( ) n Corollary 4 From Corollary 3 it follows that p n, are co-prime, so p n is always reduced In a similar manner, we obtain Corollary 5 Computing p n q n p n q by substituting () for the first n line, we get ( ) n a n We now turn to study the finite sections of the continued fraction Theorem 6 Let x n = [a 0,, a n ] Then p n = x n Proof By induction on n For n = 0, this is clear If the claim holds for fractions of length n, then compute for x n = [a 0,, a n + that it is equal to (a n + an )p n +p n 3 (a n + an ) + 3 = p n + an p n + an = = p n Corollary 7 Dividing the equations in Propositions 3 and 5 by and, respectively, we get (3) (4) x n x n = ( )n ; x n x n = ( )n a n Corollary 8 The sequence x m is decreasing; the sequence x m+ is increasing Proof Directly from Equation (4) Corollary 9 x m > x k+ always (otherwise apply (3)) Remark 0 F n where F n are the Fibonachi numbers (induction) Theorem The sequence x n converges a n ]
3 CONTINUED FRACTIONS 3 Proof Three proofs Combining Corollaries 8 and 9, the sequences converge, and by (3) they have a joint limit Also, by (3) we have x n = x 0 + n ( ) n k=, so converges by Leibnitz theorem Alternatively, the sequence absolutely converges by comparison test, using Remark 0 Remark Now that infinite continued fractions makes sense, we can repeat Remark for this situation: [a 0, a, ] = [a 0, [a, ]] Now, for the other direction, namely existence Given a real number y R, we define y 0 = y; a n = [y n ]; y n = y n a n The definition breaks down if some y n Z, but this is easily seen to happen iff y Q Theorem 3 (No proof) [a 0, a, ] = y Theorem 4 (No proof) Every x R has a unique expression as a continued fraction Example 5 5+ = [,, ] To conclude, there is a one-to-one correspondence between R and the sequences [a 0, ] with a n > 0 for n, assigning every number its expansion as a continued fraction We need to define the action of PGL (Z) on R Recall that GL (Z) is the set of matrices in M (Z) which are invertible, with inverse in the same set Those are precisely the matrices whose determinant in ± (by Cramer s formula) The center of this group is the group of order, ±I, and by definition PGL (Z) = GL (Z)/ I is the quotient group By an action of a group on a set we mean that every element of the group defines a function on the set, such that the action of gh is the composition of those of g and h The action is defined by the same action as B ( a b ) z = az+b Notice that B induces cz+d Exercise 6 Verify that for every B, B GL (Z), (BB ) z = B (B z) Exercise 7 Verify that the vector B z is projectively equivalent to B z
4 4 CONTINUED FRACTIONS Let us say that two infinite sequences are equivalent if they become equal after removing a finite header The following theorem essentially follows from Remark Theorem 8 (No proof) The expansions of x, y R are equivalent iff x, y are in the same orbit of PGL (Z) 3 Approximations We say that α R is approximable of order n and power C, if there are infinitely many pairs (p, q) such that 0 α p q < Cq n Remark 3 Notice that when n > 0, infinitely many pairs and infinitely many fractions above, give equivalent definitions Remark 3 Not being approximable of any order > n is equivalent to having ɛ > 0 such that α p q ɛ Remark 33 Every number is trivially approximable to order and power / ɛ Proposition 34 Rational numbers are not approximable to order > Theorem 35 (Dirichlet) Every irrational number is approximable to order and power Proof Fix T, and consider the T + values {(qα) : q = 0,, T } [0, ), which are all different Dividing the segment to T sub-segments, the piegone hole principle implies some (qα) (q α) < /T This provides one approximation To get new ones, choose the new T such that /T is smaller than all differences in previous numbers Theorem 36 (Liouville) If [Q[α]:Q] = d, then α is not approximable of order > d Proof We may assume f(α) = 0 for f(λ) Z[λ], and replacing by a prime factor, we may assume f (α) 0 Let γ be such that [α γ, α+γ] has no zero of f (thus no zero of f, other than α) Let ɛ = inf f (y) on that segment Compute that in the segment, f(p/q) q d Then use the mean value theorem to conclude f(x) f(α) = f (y)(x α) so α p q ɛq d for p/q in the segment
5 CONTINUED FRACTIONS 5 Corollary 37 Lioville s number α = n= 0 n! is approximable to any order, and so transcendental This is the first explicit non-algebraic number constructed, although cardinality arguments easily show existence 4 Continued fractions and approximations Continued fractions can be used to improve the power of nd order approximations The results obtained in this way are the best possible Write x n = [a n+, a n+, ] Remark can be read to say that (5) x n = A n x n Proposition 4 We have that Proof By definition of x, we have x = Q nt x n (6) x = [a 0,, a n, a n + /x n] Setting p n = (a n + /x n)p n + p n = p n + p n /x n and q n = (a n + /x n) + = + /x n as in the first definition, we know from Theorem 6 that x = p n/q n = pnx n+p n x n + = Q n t x n Remark 4 We have < q n = + /x n < + + By (3) applied to (6), we have (7) x p n = < <, qn a n qn showing that we have approximations of order by continued fractions, which are of power except for conjugates of 5+ But the same inequality also implies x p n = /qn By the remark we have < x p n < + Corollary 43 The series x p n is decreasing (this is stronger than x p n being decreasing) Theorem 44 If q < and p/q p n /, then qx p > x p n pn p Proof Assume q Let u, v Z such that n uv = q n pq Since q = u + v, we see that v 0 and uv 0 Moreover x p n and x p n have different signs, so qx p = u x p n + v x p n > x p n
6 6 CONTINUED FRACTIONS Example 45 π = [3, 7, 5,, 93, ], so p 4 /q 4 = 355/ is the best approximation with q < = 330 Theorem 46 One of every two consecutive p n / satisfies (8) x p n < qn In fact, x p n < a n a n+ qn Proof of theorem Otherwise a n a n+ q n + q n = x n x n = x n x + x x n, and f( / ) f(a n ) for f(t) = t t + ; but f is decreasing, and / > a n contradiction Corollary 47 Every irrational number is approximable of order and power ; for all numbers except conjugates of 5+, the power increases to 5/ It should be remarked that (9) characterizes convergents to continued fractions: Theorem 48 (No proof) If p/q satisfies x p q <, then p/q = q p n / for some n Theorem 49 (No proof; see [HW, Thm 95]) One of every three consecutive p n / satisfies (9) x p n < 5q n This is the best possible result, in light of the following: Theorem 40 ([HW, Thm 84]) Every fraction p/q satisfying (9) is a convergent Proof (Sketch) Based on the following: if x = a b y where y >, a b PGL (Z) and c > d > 0, then c/d = p n /, a/b = p n / and y = x n for x On the other hand ([HW, Thm 94]), we have: Proposition 4 ζ = 5 is not approximable to any power larger than 5
7 CONTINUED FRACTIONS 7 Proof Write ζ = p + δ q q 5 = ζ +, we have for 5 δ < Thus δ = q(qζ p), and since δ q δ 5 = (p qζ)(p + qζ + q) = p + pq q (ζ + ζ) = p + pq q in which the left hand side is less than in absolute value for q large, a contradiction We remark that any number not PGL (Z)-equivalent to ζ, is approximable of order and power ; again this is best possible Finally, to put Equation (7) in better perspective, we quote Theorem 4 ([HW, Thm 96]) The set of x R for which {a n } is bounded, has measure zero Much more is known about approximations and the average behavior of a n : see [K] 5 Periodic fractions and Pell s equation The equation was extensively studied by the Indian mathematician and astronomer Brahmagupta, in the 7th century (see History of Dickson, about the origin of the name) The minimal solution for (0) x Dy = can be quite large, for example for D = 6, it is x = , y = Easy theorem: if the fraction is (ultimately) periodic, then x is quadratic (since x k = x k+j ) The converse is due to Lagrange: Theorem 5 (No proof; see [HW, p 44, Thm 77]) Every quadratic number has a periodic continued fraction A hint that continued fractions are involved is obtain by dividing (0) by y : then D x y = < D+ x y y 3 Dy, so applying Theorem 40, the only possible solutions are convergents in continued fraction approximation of D Write x = D = [a 0,, a k, a k+,, a k+j, a k+j ], where j is the length of the period, and k + is its starting point Periodic fractions are particularly amenable to the matrix analysis, as we shall see Moreover, since the fraction for x is periodic, we have x k = x k+j Proposition 5 Let M = Q k+j t Q k t, then x = M x
8 8 CONTINUED FRACTIONS Proof By Proposition 4, x = Q t k+j x k+j = Q k+j t x k = Q k+j t Q t k x Theorem 53 Writing M = a b, a Dc = ( ) j is a non-trivial solution Proof Clearly M is a rational matrix Writing M = a b, the equality M D = D implies d = a and b = Dc, so in fact M = a Dc c a, and a Dc = det(m) = ( ) j We only need to prove that M 0 0, but M = I will imply Q k+j = Q k, contradiction to q k+j > q k Remark 54 Computing M from the definition, the explicit equation proved here is p k+j q k p k+j q k = q k+j p k q k+j p k, p k+j p k p k+j p k = D(q k+j q k q k+j q k ) Quite frequently k = 0, and then M = ( ) j pj p j a 0 p j q j q j a 0 q j When this is the case, the semi-symmetry of M translates to pj q = a0 D pj j a 0 q, j and p j Dq j = ( ) j Example 55 Compute 9 = [4,,, 3,,, 8, ] (so in the previous notation, k = 0 and j = 6) We then have n a n p n p n 9qn ** Remark 56 We could replace j by any multiple mj, and get similar results; thus producing infinitely many (and in fact all) solutions
9 CONTINUED FRACTIONS 9 Remark 57 It seems that k = 0 for every D Also, it was noticed by Meyer Goldberg that a k+j = a 0, and also that a k+,, a k+j is palindromic I do not know a proof of these claims Exercise 58 Using 43 = [6,,, 3,, 5,, 3,,, ], solve a 43c = References [HW] Hardy and Wright, An Introduction to the Theory of Numbers [K] Khinchin, Continued Fractions
CONTINUED 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 informationChakravala - a modern Indian method. B.Sury
Chakravala - a modern Indian method BSury Indian Statistical Institute Bangalore, India sury@isibangacin IISER Pune, India Lecture on October 18, 2010 1 Weil Unveiled What would have been Fermat s astonishment
More informationNotes on Continued Fractions for Math 4400
. 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
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 informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
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 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 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 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 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 informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More informationMA 301 Test 4, Spring 2007
MA 0 Test 4, Spring 007 hours, calculator allowed, no notes. Provide paper for the students to do work on. Students should not write answers on test sheet. TA Grades, 5, 6, 7 All answers must be justified.
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationThe theory of continued fractions and the approximations of irrational numbers
교육학석사학위청구논문 연분수이론과무리수의근사 The theory of continued fractions and the approximations of irrational numbers 202 년 2 월 인하대학교교육대학원 수학교육전공 정미라 교육학석사학위청구논문 연분수이론과무리수의근사 The theory of continued fractions and the
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationLECTURE 22: COUNTABLE AND UNCOUNTABLE SETS
LECTURE 22: COUNTABLE AND UNCOUNTABLE SETS 1. Introduction To end the course we will investigate various notions of size associated to subsets of R. The simplest example is that of cardinality - a very
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More information8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)
8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant
More informationABSTRACT ALGEBRA 2 SOLUTIONS TO THE PRACTICE EXAM AND HOMEWORK
ABSTRACT ALGEBRA 2 SOLUTIONS TO THE PRACTICE EXAM AND HOMEWORK 1. Practice exam problems Problem A. Find α C such that Q(i, 3 2) = Q(α). Solution to A. Either one can use the proof of the primitive element
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 informationP = 1 F m(p ) = IP = P I = f(i) = QI = IQ = 1 F m(p ) = Q, so we are done.
Section 1.6: Invertible Matrices One can show (exercise) that the composition of finitely many invertible functions is invertible. As a result, we have the following: Theorem 6.1: Any admissible row operation
More informationMath Introduction to Modern Algebra
Math 343 - Introduction to Modern Algebra Notes Field Theory Basics Let R be a ring. M is called a maximal ideal of R if M is a proper ideal of R and there is no proper ideal of R that properly contains
More informationELLIPTIC CURVES SEMINAR: SIEGEL S THEOREM
ELLIPTIC CURVES SEMINAR: SIEGEL S THEOREM EVAN WARNER 1. Siegel s Theorem over Q 1.1. Statement of theorems. Siegel s theorem, in its simplest form, is the fact that a nonsingular elliptic curve contains
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
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 informationMath 210B: Algebra, Homework 6
Math 210B: Algebra, Homework 6 Ian Coley February 19, 2014 Problem 1. Let K/F be a field extension, α, β K. Show that if [F α) : F ] and [F β) : F ] are relatively prime, then [F α, β) : F ] = [F α) :
More informationarxiv:math/ v3 [math.nt] 23 May 2008
ON THE CONTINUED FRACTION EXPANSION OF A CLASS OF NUMBERS arxiv:math/0409233v3 [math.nt] 23 May 2008 DAMIEN ROY Au Professeur Wolfgang Schmidt, avec mes meilleurs vœux et toute mon admiration. 1. Introduction
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationAlgebraic Number Theory and Representation Theory
Algebraic Number Theory and Representation Theory MIT PRIMES Reading Group Jeremy Chen and Tom Zhang (mentor Robin Elliott) December 2017 Jeremy Chen and Tom Zhang (mentor Robin Algebraic Elliott) Number
More informationGalois theory (Part II)( ) Example Sheet 1
Galois theory (Part II)(2015 2016) Example Sheet 1 c.birkar@dpmms.cam.ac.uk (1) Find the minimal polynomial of 2 + 3 over Q. (2) Let K L be a finite field extension such that [L : K] is prime. Show that
More information(x, y) = d(x, y) = x y.
1 Euclidean geometry 1.1 Euclidean space Our story begins with a geometry which will be familiar to all readers, namely the geometry of Euclidean space. In this first chapter we study the Euclidean distance
More informationHASSE-MINKOWSKI THEOREM
HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationNORM OR EXCEPTION? KANNAPPAN SAMPATH & B.SURY
NORM OR EXCEPTION? KANNAPPAN SAMPATH & B.SURY Introduction In a first course on algebraic number theory, a typical homework problem may possibly ask the student to determine the class group of a quadratic
More informationA Note on Jacobi Symbols and Continued Fractions
Reprinted from: The American Mathematical Monthly Volume 06, Number, pp 52 56 January, 999 A Note on Jacobi Symbols and Continued Fractions A. J. van der Poorten and P. G. Walsh. INTRODUCTION. It is well
More informationAlgebraic Cryptography Exam 2 Review
Algebraic Cryptography Exam 2 Review You should be able to do the problems assigned as homework, as well as problems from Chapter 3 2 and 3. You should also be able to complete the following exercises:
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 informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008) Problem 1: Suppose A, B, C and D are arbitrary sets.
More informationContinued Fractions New and Old Results
Continued Fractions New and Old Results Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca https://www.cs.uwaterloo.ca/~shallit Joint
More informationbe a sequence of positive integers with a n+1 a n lim inf n > 2. [α a n] α a n
Rend. Lincei Mat. Appl. 8 (2007), 295 303 Number theory. A transcendence criterion for infinite products, by PIETRO CORVAJA and JAROSLAV HANČL, communicated on May 2007. ABSTRACT. We prove a transcendence
More informationResidual modular Galois representations: images and applications
Residual modular Galois representations: images and applications Samuele Anni University of Warwick London Number Theory Seminar King s College London, 20 th May 2015 Mod l modular forms 1 Mod l modular
More informationApproximation exponents for algebraic functions in positive characteristic
ACTA ARITHMETICA LX.4 (1992) Approximation exponents for algebraic functions in positive characteristic by Bernard de Mathan (Talence) In this paper, we study rational approximations for algebraic functions
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 informationSYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS
SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS J MC LAUGHLIN Abstract Let fx Z[x] Set f 0x = x and for n 1 define f nx = ff n 1x We describe several infinite
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More information5.5 Deeper Properties of Continuous Functions
5.5. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 195 5.5 Deeper Properties of Continuous Functions 5.5.1 Intermediate Value Theorem and Consequences When one studies a function, one is usually interested
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationON THE LENGTH OF THE PERIOD OF A REAL QUADRATIC IRRATIONAL. N. Saradha
Indian J Pure Appl Math, 48(3): 311-31, September 017 c Indian National Science Academy DOI: 101007/s136-017-09-4 ON THE LENGTH OF THE PERIOD OF A REAL QUADRATIC IRRATIONAL N Saradha School of Mathematics,
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationD-MATH Algebra I HS 2013 Prof. Brent Doran. Exercise 11. Rings: definitions, units, zero divisors, polynomial rings
D-MATH Algebra I HS 2013 Prof. Brent Doran Exercise 11 Rings: definitions, units, zero divisors, polynomial rings 1. Show that the matrices M(n n, C) form a noncommutative ring. What are the units of M(n
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 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 informationBadly approximable numbers over imaginary quadratic fields
Badly approximable numbers over imaginary quadratic fields Robert Hines University of Colorado, Boulder March 11, 2018 Simple continued fractions: Definitions 1 The Euclidean algorthim a = ba 0 + r 0,
More informationADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS
ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS UZI VISHNE The 11 problem sets below were composed by Michael Schein, according to his course. Take into account that we are covering slightly different material.
More informationSome Results Concerning Uniqueness of Triangle Sequences
Some Results Concerning Uniqueness of Triangle Sequences T. Cheslack-Postava A. Diesl M. Lepinski A. Schuyler August 12 1999 Abstract In this paper we will begin by reviewing the triangle iteration. We
More informationTopics In Algebra Elementary Algebraic Geometry
Topics In Algebra Elementary Algebraic Geometry David Marker Spring 2003 Contents 1 Algebraically Closed Fields 2 2 Affine Lines and Conics 14 3 Projective Space 23 4 Irreducible Components 40 5 Bézout
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 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 real
More informationPigeonhole Principle and Ramsey Theory
Pigeonhole Principle and Ramsey Theory The Pigeonhole Principle (PP) has often been termed as one of the most fundamental principles in combinatorics. The familiar statement is that if we have n pigeonholes
More informationChapter One Hilbert s 7th Problem: It s statement and origins
Chapter One Hilbert s 7th Problem: It s statement and origins At the second International Congress of athematicians in Paris, 900, the mathematician David Hilbert was invited to deliver a keynote address,
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationarxiv:math/ v1 [math.nt] 9 Aug 2004
arxiv:math/0408107v1 [math.nt] 9 Aug 2004 ELEMENTARY RESULTS ON THE BINARY QUADRATIC FORM a 2 + ab + b 2 UMESH P. NAIR Abstract. This paper examines with elementary proofs some interesting properties of
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationMathematics 324 Riemann Zeta Function August 5, 2005
Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define
More informationReal Analysis - Notes and After Notes Fall 2008
Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start
More information) = 1, ) = 2, and o( [ 11]
True/False Questions 1. The order of the identity element in any group is 1. True. n = 1 is the least positive integer such that e n = e. 2. Every cyclic group is abelian. True. Let G be a cyclic group.
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationQUADRATIC RINGS PETE L. CLARK
QUADRATIC RINGS PETE L. CLARK 1. Quadratic fields and quadratic rings Let D be a squarefree integer not equal to 0 or 1. Then D is irrational, and Q[ D], the subring of C obtained by adjoining D to Q,
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More information(a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff
Chapter 4: Functional Limits and Continuity Definition. Let S R and f : S R. (a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff ε > 0, δ
More informationEXERCISES. a b = a + b l aq b = ab - (a + b) + 2. a b = a + b + 1 n0i) = oii + ii + fi. A. Examples of Rings. C. Ring of 2 x 2 Matrices
/ rings definitions and elementary properties 171 EXERCISES A. Examples of Rings In each of the following, a set A with operations of addition and multiplication is given. Prove that A satisfies all the
More informationJust like the ring of Gaussian integers, the ring of Eisenstein integers is a Unique Factorization Domain.
Fermat s Infinite Descent PMATH 340 Assignment 6 (Due Monday April 3rd at noon). (0 marks) Use Femtat s method of infinite descent to prove that the Diophantine equation x 3 + y 3 = 4z 3 has no solutions
More informationChapter 1 Preliminaries
Chapter 1 Preliminaries 1.1 Conventions and Notations Throughout the book we use the following notations for standard sets of numbers: N the set {1, 2,...} of natural numbers Z the set of integers Q the
More information6.2 Deeper Properties of Continuous Functions
6.2. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 69 6.2 Deeper Properties of Continuous Functions 6.2. Intermediate Value Theorem and Consequences When one studies a function, one is usually interested in
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationMath 594, HW2 - Solutions
Math 594, HW2 - Solutions Gilad Pagi, Feng Zhu February 8, 2015 1 a). It suffices to check that NA is closed under the group operation, and contains identities and inverses: NA is closed under the group
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationTOPOLOGY HW 2. x x ± y
TOPOLOGY HW 2 CLAY SHONKWILER 20.9 Show that the euclidean metric d on R n is a metric, as follows: If x, y R n and c R, define x + y = (x 1 + y 1,..., x n + y n ), cx = (cx 1,..., cx n ), x y = x 1 y
More informationTRANSCENDENTAL NUMBERS AND PERIODS. Contents
TRANSCENDENTAL NUMBERS AND PERIODS JAMES CARLSON Contents. Introduction.. Diophantine approximation I: upper bounds 2.2. Diophantine approximation II: lower bounds 4.3. Proof of the lower bound 5 2. Periods
More information1 Lecture 1 (1/5/2009)
1 Lecture 1 (1/5/2009) Notation 1.1 Introduce N := {0, 1, 2,... }, Z, Q, R, and C. Also let Z + := N \ {0}. Set notations. Recalled basic notions of a function being one to one, onto, and invertible. Think
More information1 Lecture 1 (1/5/2009)
1 Lecture 1 (1/5/2009) Notation 1.1 Introduce N := {0, 1, 2,... }, Z, Q, R, and C. Also let Z + := N \ {0}. Set notations. Recalled basic notions of a function being one to one, onto, and invertible. Think
More informationAlgorithms: Background
Algorithms: Background Amotz Bar-Noy CUNY Amotz Bar-Noy (CUNY) Algorithms: Background 1 / 66 What is a Proof? Definition I: The cogency of evidence that compels acceptance by the mind of a truth or a fact.
More informationDiscrete Math, Second Problem Set (June 24)
Discrete Math, Second Problem Set (June 24) REU 2003 Instructor: Laszlo Babai Scribe: D Jeremy Copeland 1 Number Theory Remark 11 For an arithmetic progression, a 0, a 1 = a 0 +d, a 2 = a 0 +2d, to have
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real
More informationIUPUI Qualifying Exam Abstract Algebra
IUPUI Qualifying Exam Abstract Algebra January 2017 Daniel Ramras (1) a) Prove that if G is a group of order 2 2 5 2 11, then G contains either a normal subgroup of order 11, or a normal subgroup of order
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 informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationAN EXPLORATION OF KHINCHIN S CONSTANT
AN EXPLORATION OF KHINCHIN S CONSTANT ALEJANDRO YOUNGER Abstract Every real number can be expressed as a continued fraction in the following form, with n Z and a i N for all i x = n +, a + a + a 2 + For
More informationDefinition 2.1. A metric (or distance function) defined on a non-empty set X is a function d: X X R that satisfies: For all x, y, and z in X :
MATH 337 Metric Spaces Dr. Neal, WKU Let X be a non-empty set. The elements of X shall be called points. We shall define the general means of determining the distance between two points. Throughout we
More informationLecture 7: Polynomial rings
Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules
More informationMADHAVA MATHEMATICS COMPETITION, December 2015 Solutions and Scheme of Marking
MADHAVA MATHEMATICS COMPETITION, December 05 Solutions and Scheme of Marking NB: Part I carries 0 marks, Part II carries 30 marks and Part III carries 50 marks Part I NB Each question in Part I carries
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More informationII - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define
1 Measures 1.1 Jordan content in R N II - REAL ANALYSIS Let I be an interval in R. Then its 1-content is defined as c 1 (I) := b a if I is bounded with endpoints a, b. If I is unbounded, we define c 1
More informationON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 151 158 ON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS ARTŪRAS DUBICKAS Abstract. We consider the sequence of fractional parts {ξα
More informationContinued Fraction Digit Averages and Maclaurin s Inequalities
Continued Fraction Digit Averages and Maclaurin s Inequalities Steven J. Miller, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu Joint with Francesco Cellarosi, Doug Hensley and Jake
More information