SQUARE ROOTS, CONTINUED FRACTIONS AND THE ORBIT OF 1 0 ON H2 JULIAN ROSEN, KRISHNAN SHANKAR, JUSTIN THOMAS


 Cameron Phelps
 11 months ago
 Views:
Transcription
1 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 that 2 is irrational. The usual proof involves writing 2 m n and then using unique factorization of the integers to conclude that m n cannot be in lowest terms. Of course, many proofs exist of this fact and we present one more such proof which has the virtues of brevity and of not appealing to the fundamental theorem of arithmetic. Proposition. Let k be a positive integer. If k k, then k is irrational. Proof. Consider the set of positive integers {l l > and h l k for some h}. We are assuming, by way of contradiction, that the set is nonempty so that it has a minimum element n by the wellordering of the natural numbers. If for some m we have k m/n, then for any integer d we have k m n dm + kn m dn Letting d k we get d < m/n < d + which implies < m dn < n, contradicting our choice of n. Remark. Note that a similar proof works for k m/n, where we write m/n ( k m kn/( m + k n. Here we use a slightly nonstandard definition of the ceiling function namely, x x +. The usual definition, the smallest integer greater than or equal to x, is the same as this one for x Z, but is off by if x Z.
2 2 J. ROSEN, K. SHANKAR & J. THOMAS 2. LINEAR FRACTIONAL TRANSFORMATIONS ON H 2 Sometimes what is more interesting than the result of a proof is the technique used to obtain it. The proof above leads us to study the following linear fractional transformation on H 2 (here H 2 is viewed as the upper half plane; let d k and d + k. ( ( d k z P k (z dz + k d z + d ( ( d + k z M k (z d + k z + k z + k (d + z + k z + (d + k z + k z + k Note, first of all, that ± k are the only fixed points of P k, M k. In fact, k is a source and k is a sink as we iterate P k, M k and look at the orbits of points in H 2. From this point of view, the above proposition used the fact that k is a fixed point of P k (respectively M k to derive a contradiction. We now pursue this train of thought a bit further. Specifically, the orbit of / (the point at infinity on H 2 has a very interesting property for certain choices of k. For the definitions of plus continued fraction and minus continued fraction and notation, see the next section. Let k be a positive integer, not a perfect square, and let [d; d, d 2,...] be the plus continued fraction expansion of k, and p n q n the convergents of that continued fraction. Let (d + ; e, e 2,... be the minus continued fraction expansion of k, and r n sn the convergents of that continued fraction. Theorem Plus. The following statements are equivalent for the plus continued fraction expansion of k. (a For all n we have P n k ( p n q n. That is, the orbit of / H 2 under P k is precisely the set of convergents of the plus continued fraction expansion of k. (b The quantity 2 k k Tr(P k is an integer. k 2 det(p k (c The plus continued fraction expansion for k has period at most 2.
3 SQUARE ROOTS AND CONTINUED FRACTIONS 3 Theorem Minus. The following statements are equivalent for the minus continued fraction expansion of k. (a For all n we have M n k ( r n sn. That is, the orbit of / H 2 under M k is precisely the set of convergents of the minus continued fraction expansion of k. (b The quantity 2 k Tr(M k is an integer. k 2 k det(m k (c The minus continued fraction expansion for k has period at most CONTINUED FRACTIONS REDUX The subject of continued fractions is quite old and well studied. There are several texts and articles about them and as such we refer the interested reader to the excellent books [Ka3] and [RS94] for the proofs of the many well known results stated in this section. Continued fractions arose from studying expressions of the form, a + a + a an Given any integer a and a sequence of positive integers (a j j, the above expression defines a sequence of rational numbers p n q n : [a ; a, a 2,..., ]. It turns out that lim n p n q n always exists in this case and we say that p n α : lim a + n q n a + a is the plus continued fraction expansion of α (also called regular continued fraction expansion. By simply changing all the + signs in the definition above to signs we obtain similarly the notion of minus continued fraction expansion. The next result captures one of the first basic facts about continued fractions.
4 4 J. ROSEN, K. SHANKAR & J. THOMAS Theorem 2. Any irrational number α can be represented as an infinite plus continued fraction and any real numebr β as an infinite minus continued fraction. α a + a + a where a i and b i 2 for all i. ; β b b b One can compute the numbers a i by setting a α, α α a, and a i+ α i+, where α i+ α i a. Similarly, the b i i s are computed from β by setting b β, β β b, and then b i+ β i+, where β i+ β i b. The first i of these recursion formulas will be used in the proof of Theorem Plus. We now introduce some notation. From now on, we will denote plus/minus continued fractions as, [a ; a, a 2,...] : a + (b ; b, b 2,... : b a + a 2 + b b If a continued fraction is periodic, for example 7 [2;,,, 4,,,, 4,...], then we will denote it as 7 [ 2;,,, 4 ]. Similarly, 29 [ 5; 2,,, 2, ] and 5 (4; 8. Now we will summarize the properties of plus and minus continued fractions in the form of a table. The statements and their proofs can be found in any standard text on the subject; for instance, see [RS94] for plus continued fractions and [Ka3] for minus continued fractions. Note that the (plus continued fraction expansion of α is finite if and only if α is rational. By the same token, the minus continued fraction β (b ; b, b 2,... is rational if and only if there exists N such that b j 2 for all j N (since (2; 2.
5 SQUARE ROOTS AND CONTINUED FRACTIONS 5 In the table that follows, let a, a, a 2,... and b, b, b 2,... be infinite sequences of integers such that a i and b i 2 if i. Then [a ; a, a 2,...] converges to a unique real number α, and similarly (b ; b, b 2,... converges to a unique real number β. Define the following recursive sequences: p i+ a i p i + p i, r i+ b i r i r i for i q i+ a i q i + q i, s i+ b i s i s i for i with initial values p, p q, q and r, r s, s Plus Minus α [a ; a, a 2,...] β (b ; b, b 2,... If A n : p n q n, then A n [a ; a,..., ] and lim n A n [a ; a,...] α. If B n : r n sn, then B n (b ; b,..., b n and lim n B n (b ; b,... β. p i q i p i q i ( i for all i r i s i r i s i for all i Periodic continued fractions α [a ; a, a 2,...] is periodic i.e., α [a ; a, a 2,..., a l, a l+,..., a m ] α is a quadratic irrational. (b ; b, b 2,... is periodic i.e., β (b ; b, b 2,..., b l, b l+,..., b m β is a quadratic irrational. except (b ; b,..., b l, 2 which is rational. k Z such that k > and d k < k < k d + [ k d; a, a 2,..., a 2, a, ] k (d + ; b, b 2,..., b 2, b, 2(d + For example, For example, 4 [ 3;, 2,, 6 ] 7 (3; 3, 6 73 [ 8;,, 5, 5,,, 6 ] 3 (4; 3, 3, 2, 2, 2, 2, 3, 3, 8
6 6 J. ROSEN, K. SHANKAR & J. THOMAS The following formula allows one to freely travel between the worlds of plus and minus continued fractions. The proof is left as an exercise for the interested reader (as in [Ka3]; see also [Zag8]. [a ; a, a 2, a 3,...] (a + ; 2, 2,..., 2, a }{{} 2 + 2, 2, 2,..., 2, a }{{} 4 + 2,... a a 3 For example, 3 [ 3;,,, 6 ] (4; 3, 3, 2, 2, 2, 2, 3, 3, 8. We are now ready to prove the main theorems, plus and minus. Proof of Theorem Plus. 4. PROOFS OF THEOREMS PLUS AND MINUS Recall that we have k [d; d, d 2,...]. (a (b The equation P 2 k ( p 2 q 2 implies d 2 + k dd + d, which in turn yields d result follows. (b (c The inequality d < k < d + gives us k d 2. Then, since d is an integer and d : k, the k + d k d 2 < k d 2 < + k d k d 2. Then, since k d 2 is an integer greater than, there can be no integer between the two quantities on the far left and right sides of the above inequality. Thus, d :. From this, we compute k d k d 2 k d 2 d 2 : d k d k d 2 k d
7 SQUARE ROOTS AND CONTINUED FRACTIONS 7 Continuing on, we see that d 3 : ( d k+d k d, and similarly d 4 d 2. The continued fraction for [ ] k becomes d;,, which k d 2 proves (c. (c (a Suppose k has a period 2 continued fraction expansion. From the well known theorems on the continued fraction expansions of quadratic surds (see Table, we know that it must be of the form k [d; d, ]. Upon examining this expression, one can see that d + k d + k d Simplifying this equation gives d. Now, we use this information to k d 2 get a different way to express p n and q n, the numerators and denominators of our convergents. Define two sequences, { } and {b n }, recursively using the following matrix notation. Define ( ( a a d :, b b and ( b n b n for all n 2. We claim that p n ( b n 2 b n 2 (k d 2 n/2 and q n ( k d 2, b n (k d 2 n/2 for all n. The reader can easily verify that the assertion holds for n,. Then, for n 2, we have two cases. First, if n is even, n 2 n/2 n 2 2 and the recursion formula for p n yields p n p k d 2 n + p n 2 which, by induction is (k d 2 + (n /2 a n + (k d 2 (n 2/2 2
8 8 J. ROSEN, K. SHANKAR & J. THOMAS Using the remarks above and the formula for verifies our claim for p n. A similar argument proves the statement about q n. Now, we have p n /q n /b n, so to finish the proof, we will show that P n k ( /b n. To this end, define ( s t ( (, and s n t n ( d d ( k s n t n It is clear that Pk n( s n tn, so if we show that s n and t n b n we are done. The formula for s n and t n can be written as ( ( n ( s n d k. d t n In addition, the formula for and b n can be written as ( ( ( n ( d b n k d 2. Write the right hand side of the former equation as Pk n (, and the right hand side of the latter equation as AB n (. Then, observe that AB Pk A, so (, b n (s n, t n follows by induction. Proof of Theorem Minus. Let k be onsquare positive integer, and let (d + ; e, e 2,... be the minus continued fraction for k. (a (b The equation M 2 k ( r 2 s 2 implies (d k 2(d + (d + e e from which it follows that e 2(d+ (d+ 2 k. This, along with d + k, and the fact that e is an integer, gives the desired result. (b (c 2 k If is an integer, then let d + k, e k 2 k Let x (d + ; e, e 2. It can be seen that x satisfies x d + e e 2 +(x (d+ 2 k and e k 2 k 2 2(d +.
9 SQUARE ROOTS AND CONTINUED FRACTIONS 9 This yields a quadratic equation whose only positive root is k. Therefore, k (d + ; e, e 2, and the minus continued fraction for k has period at most 2. (c (a Suppose the minus continued fraction for k has period at most 2. That is, k (d + ; e, e 2, for some d +, e, e 2. From this, we see Rearranging, this gives k d +. e e 2 ((d+ k e (2(d + e 2 k + ((d + e e 2 (d + 2 e ke e 2 Because k is irrational, we must have e (2(d + e 2 (d + e e 2 (d + 2 e ke e 2. In the first equation, e, so e 2 2(d +. Substituting for e 2 in the second equation gives ((d + 2 ke 2(d +, which in turn gives e 2(d+ (d+ 2 k. Note also that we have d + k. Next, we define the following sequence. For n, define ( b n ( d + ( n ( 2(d + (d + 2 k From this definition, it can be shown that satisfies the recurrence relation 2(d + ((d + 2 k 2, with a similar recurrence for b n. We then claim that and r n s n ((d + 2 k n/2 b n ((d + 2 k n/2
10 J. ROSEN, K. SHANKAR & J. THOMAS which is true by induction. For n, 2, this is easily verified. For n 3, we have two cases. When n is even, we have, via the recursion formula for r n : r n e r n r n 2 2(d + ((d + 2 k n/2 ((d + 2 k 2 ((d + 2 k n/2 ((d + 2 k n/2 Similar arguments hold when n is odd, and for s n. Next, we claim that if we view the map M k as a matrix, then ( ( Mk n b n ( ( To see this, let A d+ 2(d+, B (d+ 2. Then, the equation above k reduces to showing that AB n ( ( M n k. If we note that AB Mk A and that ( is a fixed point of BA, we get our result: ( (ABA n( AB n A ( AB n (BA ( AB n ( M n k which implies that r n s n which completes the proof. ((d+ 2 k n/2 b n ((d+ 2 k n/2 b n M n k ( 5. CLOSING REMARKS 5.. How many k such that k has period 2 continued fraction? Given consecutive squares, d 2, (d + 2, there are numbers between them. So if d 2 < k < (d + 2, then the plus continued fraction of k has period at most 2 if and only if k d 2 is a divisor of, where k d 2. Thus there are precisely σ ( numbers between the consecutive squares d 2, (d + 2 that have period at most 2, where σ (j is the number of divisors of j. Similarly, there are σ ( + 2 numbers with minus continued fraction of period at most 2 (we subtract, since the divisor + 2 cannot be realized.
11 SQUARE ROOTS AND CONTINUED FRACTIONS In general, σ ( 4 (counting the obvious divisors, 2, d,, and the lower bound is sharp for d prime. Moreover, it is not hard to see that for d > 3, there are exactly two numbers between d 2 and (d + 2 which have period at most 2 simultaneously for their plus and minus continued fractions; they are d 2 + d and d 2 + (d + 2. Along these lines, observe that d 2 + d + d(d + + always has period larger than 2 for either continued fraction Matrix convergents vs. continued fraction convergents. When k does not satisfy the conditions of either theorem, then the matrix yields a sequence of rational numbers that converge quite fast to k, but have no apparent relation to the continued fraction convergents. The fact that P k and M k applied to ( converge to k is a fairly straightforward exercise in the linear algebra of irreducible Perron Frobenius matrices. However, there is one strange phenomenon for which we do not have a complete proof (and leave as a conjecture for the interested reader. When the quantity is a halfinteger, then the matrix convergents form a proper k d 2 subset of the (plus continued fraction convergents in a precise way. For example, consider 3 and 44. 3; d 3, k 3, k d 2 3 2, 3 [3;,,,, 6], P3 Continued fraction convergents: { 3; 4, 2 7, 3, 8 5, 9 33, 37 38, 256 7, 393 9, 649 8, , 4936 ( Matrix convergents; P3 n 369, 9223 { 3; 3, 8 5, 9 33, 393 9, 649 8, , , , ,... ( , , } 6485,... The matrix convergents are picked from the continued fraction convergents in the following pattern: skip two, pick three (and also note that the continued fraction of 3 has period Now observe a similar phenomenon for 44. }
12 2 J. ROSEN, K. SHANKAR & J. THOMAS 44; d 6, k 44, ( k d 2 3 2, [6;,,, 2,,,, 2], P44 6 Continued fraction convergents: { 6; 7, 3 2, 2 3, 53 8, 73, 26 9, 99 3, , , , , 27 ( Matrix convergents; P44 n 382, 2947 { 6; 2 3, 26 9, 99 3, , , , , , , 554 } 756,... The matrix convergents are picked from the continued fraction convergents in the following pattern: skip two, pick one, skip two, pick three (and note that the continued fraction of 44 has period Elementary arithmetic shows that such k do not exist if d is a power of 2. In general, the number of such k (d 2, (d + 2 for which is a half k d 2 integer depends on the number of odd factors of d: if d 2 j m, where m is odd, then the number of such k is σ (m. When such k exist, we formulate the following conjecture. Conjecture. Let k be a positive integer, not a perfect square, and let d k. If k d 2 is a halfinteger, then the matrix convergents of k are a proper subset of the continued fraction convergents in the following pattern: skip two, pick three, if d is odd and skip two, pick one, skip two, pick three if d is even. In addition, it seems that the period of the continued fraction divides if d is odd, and the period divides 8 if d is even. In the case of d odd, the period is always 5 if k d 2 + 4, and the period is in other cases. Moreover, there are possibly more conjectures for patterns of the continued fraction when } k d 2 is in Z (2 { m 2 n, where n Z}, but we don t have precise statements, so we leave that to an enterprising and interested reader.
13 SQUARE ROOTS AND CONTINUED FRACTIONS 3 ACKNOWLEDGEMENTS It is a pleasure to thank Svetlana Katok who read an early draft, made several useful suggestions, and thereby improved the exposition considerably. REFERENCES [Ka3] S. Katok, Continued fractions, hyperbolic geometry, quadratic forms, in MASS Selecta, Teaching & learning advanced undergraduate mathematics (S. Katok, A. Sossinsky, S. Tabachnikov eds., American Mathematical Society, 23. [RS94] A. Rockett & P. Szüsz, Continued Fractions, World Scientific Publishing, 994. [Zag8] D. Zagier, Zetafunktionen und quadratischer Körper, Springer Verlag, 98. address: address: address:
Continued Fractions and the Euclidean Algorithm
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
More informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationCONTINUED 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 informationInduction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition
Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing
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 informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More 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 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 informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More 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 informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More 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 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 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 informationHomework 5 Solutions
Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which
More informationSECTION 102 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More information2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.
2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then
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 informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving NonConditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
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 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 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 informationBasic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
More information1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form
1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and
More informationPythagorean Triples. Chapter 2. a 2 + b 2 = c 2
Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
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 informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
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 informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
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 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 informationAppendix F: Mathematical Induction
Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another
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 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 informationMath 313 Lecture #10 2.2: The Inverse of a Matrix
Math 1 Lecture #10 2.2: The Inverse of a Matrix Matrix algebra provides tools for creating many useful formulas just like real number algebra does. For example, a real number a is invertible if there is
More informationAnswer Key for California State Standards: Algebra I
Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.
More informationMITES Physics III Summer Introduction 1. 3 Π = Product 2. 4 Proofs by Induction 3. 5 Problems 5
MITES Physics III Summer 010 Sums Products and Proofs Contents 1 Introduction 1 Sum 1 3 Π Product 4 Proofs by Induction 3 5 Problems 5 1 Introduction These notes will introduce two topics: A notation which
More informationWe now explore a third method of proof: proof by contradiction.
CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement
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 informationA Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions
A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25
More 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 informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationCore Maths C1. Revision Notes
Core Maths C Revision Notes November 0 Core Maths C Algebra... Indices... Rules of indices... Surds... 4 Simplifying surds... 4 Rationalising the denominator... 4 Quadratic functions... 4 Completing the
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 information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationIndiana State Core Curriculum Standards updated 2009 Algebra I
Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and
More informationMATH 289 PROBLEM SET 4: NUMBER THEORY
MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides
More informationArithmetic Operations. The real numbers have the following properties: In particular, putting a 1 in the Distributive Law, we get
Review of Algebra REVIEW OF ALGEBRA Review of Algebra Here we review the basic rules and procedures of algebra that you need to know in order to be successful in calculus. Arithmetic Operations The real
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More 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 informationPartial Fractions. Combining fractions over a common denominator is a familiar operation from algebra:
Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: From the standpoint of integration, the left side of Equation 1 would be much easier to work with than
More informationFractions and Decimals
Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first
More informationSection 62 Mathematical Induction
6 Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that
More informationChapter 11 Number Theory
Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications
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 information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationSYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me
SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBINCAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines
More informationLAKE ELSINORE UNIFIED SCHOOL DISTRICT
LAKE ELSINORE UNIFIED SCHOOL DISTRICT Title: PLATO Algebra 1Semester 2 Grade Level: 1012 Department: Mathematics Credit: 5 Prerequisite: Letter grade of F and/or N/C in Algebra 1, Semester 2 Course Description:
More informationMath 181 Handout 16. Rich Schwartz. March 9, 2010
Math 8 Handout 6 Rich Schwartz March 9, 200 The purpose of this handout is to describe continued fractions and their connection to hyperbolic geometry. The Gauss Map Given any x (0, ) we define γ(x) =
More informationThis is a square root. The number under the radical is 9. (An asterisk * means multiply.)
Page of Review of Radical Expressions and Equations Skills involving radicals can be divided into the following groups: Evaluate square roots or higher order roots. Simplify radical expressions. Rationalize
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 BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationIntroduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationEquations, Inequalities & Partial Fractions
Contents Equations, Inequalities & Partial Fractions.1 Solving Linear Equations 2.2 Solving Quadratic Equations 1. Solving Polynomial Equations 1.4 Solving Simultaneous Linear Equations 42.5 Solving Inequalities
More informationMath Workshop October 2010 Fractions and Repeating Decimals
Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,
More informationThe Rational Numbers
Math 3040: Spring 2011 The Rational Numbers Contents 1. The Set Q 1 2. Addition and multiplication of rational numbers 3 2.1. Definitions and properties. 3 2.2. Comments 4 2.3. Connections with Z. 6 2.4.
More information3.4 Complex Zeros and the Fundamental Theorem of Algebra
86 Polynomial Functions.4 Complex Zeros and the Fundamental Theorem of Algebra In Section., we were focused on finding the real zeros of a polynomial function. In this section, we expand our horizons and
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 informationOverview. Essential Questions. Precalculus, Quarter 4, Unit 4.5 Build Arithmetic and Geometric Sequences and Series
Sequences and Series Overview Number of instruction days: 4 6 (1 day = 53 minutes) Content to Be Learned Write arithmetic and geometric sequences both recursively and with an explicit formula, use them
More informationMath 4310 Handout  Quotient Vector Spaces
Math 4310 Handout  Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationMatrix Norms. Tom Lyche. September 28, Centre of Mathematics for Applications, Department of Informatics, University of Oslo
Matrix Norms Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 28, 2009 Matrix Norms We consider matrix norms on (C m,n, C). All results holds for
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 informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
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 information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
More information(x + a) n = x n + a Z n [x]. Proof. If n is prime then the map
22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationWelcome to Math 19500 Video Lessons. Stanley Ocken. Department of Mathematics The City College of New York Fall 2013
Welcome to Math 19500 Video Lessons Prof. Department of Mathematics The City College of New York Fall 2013 An important feature of the following Beamer slide presentations is that you, the reader, move
More informationContinuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationPYTHAGOREAN TRIPLES PETE L. CLARK
PYTHAGOREAN TRIPLES PETE L. CLARK 1. Parameterization of Pythagorean Triples 1.1. Introduction to Pythagorean triples. By a Pythagorean triple we mean an ordered triple (x, y, z) Z 3 such that x + y =
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 informationPOLYNOMIAL FUNCTIONS
POLYNOMIAL FUNCTIONS Polynomial Division.. 314 The Rational Zero Test.....317 Descarte s Rule of Signs... 319 The Remainder Theorem.....31 Finding all Zeros of a Polynomial Function.......33 Writing a
More informationSet theory as a foundation for mathematics
V I I I : Set theory as a foundation for mathematics This material is basically supplementary, and it was not covered in the course. In the first section we discuss the basic axioms of set theory and the
More informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
More information5.4 The Quadratic Formula
Section 5.4 The Quadratic Formula 481 5.4 The Quadratic Formula Consider the general quadratic function f(x) = ax + bx + c. In the previous section, we learned that we can find the zeros of this function
More informationP (A) = lim P (A) = N(A)/N,
1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or nondeterministic experiments. Suppose an experiment can be repeated any number of times, so that we
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 information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationDefinition 1 Let a and b be positive integers. A linear combination of a and b is any number n = ax + by, (1) where x and y are whole numbers.
Greatest Common Divisors and Linear Combinations Let a and b be positive integers The greatest common divisor of a and b ( gcd(a, b) ) has a close and very useful connection to things called linear combinations
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
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 informationMATH 537 (Number Theory) FALL 2016 TENTATIVE SYLLABUS
MATH 537 (Number Theory) FALL 2016 TENTATIVE SYLLABUS Class Meetings: MW 2:003:15 pm in Physics 144, September 7 to December 14 [Thanksgiving break November 23 27; final exam December 21] Instructor:
More informationWe can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b
In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should
More informationExponents and Radicals
Exponents and Radicals (a + b) 10 Exponents are a very important part of algebra. An exponent is just a convenient way of writing repeated multiplications of the same number. Radicals involve the use of
More informationProofs are short works of prose and need to be written in complete sentences, with mathematical symbols used where appropriate.
Advice for homework: Proofs are short works of prose and need to be written in complete sentences, with mathematical symbols used where appropriate. Even if a problem is a simple exercise that doesn t
More information