The Real Number System

Size: px
Start display at page:

Download "The Real Number System"

Transcription

1 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 whether or not an element is in S. The collection of large numbers does not constitute a well-defined set. The set P of prime numbers is well-defined: P is the collection of integers n that are greater than 1 for which the only positive divisors of n are 1 and n. So we can tell precisely whether or not an object is in P. For instance 13 P, but 14 P because 14 = 7 2. The set of rational numbers Q is also well-defined. A rational number is an expression of the form a / b, where a and b are integers with b 0. Two rational numbers a / b and c / d are said to be equal if and only if ad = bc. It is an easy exercise to show that the sum and product of two rational numbers are also rational numbers. The set of integers Z is a subset of Q because an integer n can be written as n / 1. Proposition 1.1. Let x and y be rational numbers with x < y. There exists another rational number z such that x < z < y. Proof. Let z = (x + y) / 2. Because x, y, and 1/2 are rational, x + y is rational, thus so is 1 2 ( x + y) = z. Moreover, x = 1 2 (x + x ) < 1 2 (x + y) < 1 (y + y) = y ; thus, x < z < y. QED 2 Existence of Irrational Numbers The Pythagorean Theorem states: In a right triangle, the square of the hypotenuse equals the sum of the squares of the other two sides. So if we let c be the length of the hypotenuse of a right triangle with two other sides of length 1, then c 2 = = 2. Thus, c is a positive number such that c 2 = 2; that is, c = 2, which exists as a physical length. But we have already proven using only facts about integers that 2 cannot be written as a ratio of integers. Thus, c is not a rational number; therefore we call it irrational. The set of real numbers R is now the union of the rationals and irrationals. Ordered Sets Definition 1.1. An order on a set S is a relation on S that satisfies two properties: (i) (Trichotomy) For all x, y S, exactly one of the following is true: x y or x = y or y x. (ii) (Transitive) For all x, y, z S, if x y and y z, then x z. We write x y to denote that either x y or x = y. Clearly is also transitive. That is, if x y and y z, then x z. In general, x y is read as x precedes y thus indicating an ordering to the set. For example, let S be the set of standard lower-case English letters. Then a c, c f, and a f.

2 We are most concerned with the ordering on the set of real numbers R, and its various subsets such as the natural numbers ℵ, the integers Z, and the rational numbers Q. The ordering used for these sets is the relation < (less than). For any two real numbers x and y, we say x < y if and only if 0 < y x (i.e., y x is positive). Then the relation < satisfies the two properties of an order. With numbers, we read x < y as x is less than y and x y is read as x is less than or equal to y. Proposition 1.2. Let E = { x 1,..., x n } be a finite subset of n distinct elements from an ordered set. There exists a first (least) element and a last (greatest) element in E. Proof. If n = 1, then x 1 is both the least and greatest element in E. If n = 2, then the result follows from the Trichotomy axiom of order. Now assume the result holds for some n 2, and assume that x 1 is the least element and x n is the greatest element in E. Now consider the set E = { x 1,..., x n, x n+1 } with a new distinct element x n+1. If x n+1 x 1, then x n+1 is the least element and x n is the greatest element in E. If x 1 x n+1 x n, then x 1 is the least element and x n is the greatest element in E. If x n x n+1, then x 1 is the least element and x n+1 is the greatest element in E. With all cases being exhausted, we see that the result holds for a set of cardinality n + 1 provided it holds for a set of cardinality n. By induction, the proposition holds for all n 1. QED Upper and Lower Bounds Definition 1.2. Let E be a subset of an ordered set S. (a) We say that E is bounded above if there exists an element β in S such that x β for all x E. Such an element β is called an upper bound of E. (b) An element β in S is called the least upper bound of E or supremum of E, denoted by lub E or sup E, if (i) β is an upper bound of E and (ii) if λ is a different upper bound of E, then β λ. Note: Suppose β = sup E and λ β. Then λ cannot be an upper bound of E. Thus there must be an element x E such that λ x. { } Example 1.1. Let E = , , ,...,9 + n n + 1,... R. We claim that sup E = 10. First, 9 + n n +1 < 9 + n + 1 = 10 for all integers n 1; thus, 10 is an upper n + 1 bound of E. Next, suppose λ is a different upper bound of E but λ < 10. Obviously 9 < λ or else it would not be an upper bound of E. Then 9 < λ < 10, which makes n 0 < λ 9 < 1. Because lim = 1, we can choose an integer n large enough such n n + 1 that λ 9 < n n < 1. But then λ < 9 + < 10, which contradicts the fact that λ is an n + 1 n + 1 upper bound of E. So we must have 10 < λ which makes 10 = sup E.

3 Proposition 1.3. Let β be an upper bound of a subset E of an ordered set S. If β E, then β = sup E. Proof. Let λ be a different upper bound of E. Then either λ β or β λ due to the Trichotomy. But if λ β, then λ would not be an upper bound of E because β E. So we must have β λ. Therefore, β is the least upper bound of E. QED Definition 1.3. Let E be a subset of an ordered set S. (a) We say that E is bounded below if there exists an element α in S such that α x for all x E. Such an element α is called a lower bound of E. (b) An element α in S is called the greatest lower bound of E or infimum of E, denoted by glb E or inf E, if (i) α is a lower bound of E and (ii) if λ is a different lower bound of E, then λ α. Note: Suppose α = inf E and α λ. Then λ cannot be a lower bound of E. Thus there must be an element x E such that x λ. Example 1.2. Let E = { 1 / n n ℵ} = {1, 1/2, 1/3, 1/4,... } R. Then sup E = 1, which is in E (see Proposition 1.3), but inf E = 0 which is not in E. Proposition 1.4. Let α be a lower bound of a subset E of an ordered set S. If α E, then α = inf E. (We leave the proof as an exercise.) The Least Upper Bound Property Definition 1.4. An ordered set S is said to have the least upper bound property if the following condition holds: Whenever E is a non-empty subset of S that is bounded above, then sup E exists and is an element in S. Proposition 1.5. The set of integers Z has the least upper bound property. Proof. Let E be a non-empty subset of the integers Z that is bounded above. Then there exists an integer N such that n N for all n E. Because E is non-empty, there is an integer n E with n N. By Prop. 1.3, if n is an upper bound of E, then n = sup E which exists as an element in Z. If n is not an upper bound of E, then by Prop we pick the greatest element in E from among the finite number of integers in E that are from n to N. By Prop. 1.3, this greatest element in E is sup E and is an integer because it was chosen from E. QED In the proof of Proposition 1.5, we found the least upper bound of the non-empty subset E and in fact sup E was an element of E. If E were bounded below, then we also would have inf E E. We therefore can state:

4 Proposition 1.6. (The Well-Ordering Principle of Z ). (a) Let E be a non-empty subset of the integers that is bounded above. Then E has a greatest element within the set E. (b) Let E be a non-empty subset of the integers that is bounded below. Then E has a least element within the set E. The Well-Ordering Principle is essential for the study of limits of sequences, and we often shall use it implicitly in the manner illustrated in the following example: Example of the Well-Ordering Principle: Let {a n } n =1 be a sequence of real numbers that increases to infinity. Then we can choose the smallest integer N such that a N 100. Because the sequence is increasing to infinity, we have a 1 < a 2 < a 3 <...< a n <... and at some point we must have 100 a k < a k+1 < a k +2 <.... The Well-Ordering Principle is then applied to the set of indices, not to the actual sequence values. Let E = {k 100 a k }, which is the set of indices k for which a k 100. Then E is a non-empty subset of the integers that is bounded below by 1 (the first index). By the Well-Ordering Principle, E has a least element within E. Thus, there exists a smallest index N such that a N 100. Example 1.3. The set of rational numbers Q does not have the least upper bound property. As an example, let E Q be defined as follows: E = { 1. 4, 1. 41, , , ,...} = 1 + a a k 10 k k 1, where a i is the ith decimal place value in 2. Then E is a non-empty subset of the rational numbers and E is bounded above by 2. In fact 2 = sup E, but 2 is not a rational number. Thus, Q does not have the least upper bound property. The Greatest Lower Bound Property Definition 1.5. An ordered set S is said to have the greatest lower bound property if the following condition holds: Whenever E is a non-empty subset of S that is bounded below, then inf E exists and is an element in S. Example 1.4. The set of integers Z has the greatest lower bound property, but the set of rational numbers Q does not. These results follow from Proposition 1.5, Example 1.3, and the following theorem:

5 Theorem 1.1. Let S be an ordered set. Then S has the greatest lower bound property if and only if S has the least upper bound property. Partial Proof. Assume S has the least upper bound property and let E be a non-empty subset of S that is bounded below. Let L be the set of all elements in S that are lower bounds of E. Then L because E is bounded below. Because E is non-empty, there exists an element x 0 in E. By definition of L, x 0 is an upper bound of L; so L is bounded above. By the least upper bound property of S, α = sup L exists and is an element of S. We claim that α = inf E. sup L = α = inf E L (All lower bounds of E) E First, let x E. By definition of L, x is an upper bound of L; thus, α x because α is the least upper bound of L. Thus α is also a lower bound of E. But suppose λ is another (different) lower bound of E. Then λ L. But then λ α because α = sup L. But because λ is different than α, we must have λ α due to the properties of an order. Thus, α is in fact the greatest lower bound of E and it exists in S. Thus, S has the greatest lower bound property. (We leave the proof of the converse as an exercise.) S Decimal Expansions: Rational vs. Irrational A commonly used result is that a rational number has a decimal expansion that terminates, such as 4.0 (an integer) or (a regular number), or has a decimal expansion that recurs such as This property characterizes rational numbers and therefore provides another distinction between rational and irrational numbers. Theorem 1.2. A real number is rational if and only if it has a decimal expansion that either terminates or recurs. Proof. Assume first that we have a real number x with a decimal expansion that either terminates or recurs. If it terminates, then x has the form x = ±(n. a 1 a 2...a k ), where n,a 1,..., a k are all non-negative integers, and 0 a i 9 for 1 i k. Thus, x = ± n + a a k 10 k is the sum of rational numbers which is rational. (If all a i are 0, then x = ±n is an integer and thus is a rational number.) If the decimal expansion is recurring, then x has the form

6 x = ±n. a 1...a j a j+1...a j+k a j+1... a j+ k a j+1... a j+k... = ± n + a a j 10 j + 1 a j+1 10 j a j+k 10 k + 1 a j+1 10 j 10 k a j+k 10 2k +... = ± n + a a j 10 j + a j j k a j+k k+1 10 j 10 k k k = ± n + a a j 10 j + a i j j+1 10 k a i j+k 1 i = 0 10 j+k 10 k i= 0 = ± n + a a j 10 j + a j+1 10 j a j+k i 1 10 j+ k 10 k i= 0 = ± n + a a j 10 j + 1 a j+1 10 j a j+k 10 k 10k 10 k, which is rational. 1 Conversely, let x = c / d be a rational number. We must obtain its decimal expansion. By dividing d into c, we may assume that x is of the form x = ±(n + a / b), where n,a,b are non-negative integers with b 0 and 0 a < b. If a = 0, then x = ±n is a terminating decimal expansion. If a 0, then let r 0 = a and divide b into 10r 0 to obtain 10r 0 = a 1 b + r 1 where 0 r 1 < b and 0 a 1 9 because 0 r 0 < b. Then divide b into 10r 1 to obtain 10r 1 = a 2 b + r 2 where 0 r 2 < b and 0 a 2 9 because 0 r 1 < b. Continue dividing b into 10r j to obtain 10r j = a j+1 b + r j+1 where 0 r j+1 < b and 0 a j+1 9 because 0 r j < b. Because all remainders r i must be from 0 to b 1, there can be at most b distinct remainders. At some point, we will have 10r k = a k+1 b + r k +1, where r k +1 = r i for some previous remainder r i. Because the next step of dividing 10r i by b yields the same quotient a i+1 and remainder as before, the pattern recurs for the successive divisions. We now claim that x = ±(n. a 1 a 2... a i a i+1..a k +1 a i+1.. a k+1 a i+1.. a k+1... ) To see this result, we first use 10a = 10r 0 = a 1 b + r 1. Dividing by 10b gives a b = a r 1 b But then 10r 1 = a 2 b + r 2, which gives r 1 b = a r 2 b ; hence,

7 a b = a a r 2 10 b = a a r b. Continuing, we obtain a b = a a a i 10 i + a i+1 10 i a k k r k k +1 b, where r k +1 = r i. But then we have a b = a a a i 10 i + a i+1 10 i a k k+1 + a i+1 10 k r i+1 10 k +2 b = a a a i 10 i + a i+1 10 i a k k+1 + a i+1 10 k +2 + a i k r i+3 10 k +3 b = a a a i 10 i + a i+1 10 i a k k+1 + a i+1 10 k +2 + a i k a k (k+1) i 1 r + k (k+1) i b By recursion, we obtain a recurring decimal expansion of x that terminates if b ever divides evenly into a remainder. QED Example 1.5 (a) Find the rational form of expansion of 3/8. (c) Find the decimal expansion of 3/14. (b) Find the decimal Solution. (a) By Theorem 1.2, we have = = = = (b) For a / b = 3 / 8, we first divide 8 into 10 3 to obtain the next remainder r 1, then continue dividing 8 into 10r i until we obtain a 0 remainder or a repeated remainder. The decimal terms of 3/8 come from the successive quotients: 30 = = = = Thus, 3/8 =

8 (c) For a / b = 3 / 14, we first divide 14 into 10 3 to obtain the next remainder r 1, then continue dividing 14 into 10r i until we obtain a 0 remainder or a repeated remainder. The decimal terms of 3/14 come from the successive quotients: 30 = = = = = = = repeated remainder 20 = repeated quotient Thus, 3/14 = Note: The decimal expansion of a rational number is not unique. An expansion that terminates also can be written as an expansion that ends in a string of all 9's. Specifically, the decimal x = n.a 1 a 2... a k, where 1 a k 9, can be re-written as x = n.a 1 a 2... (a k 1) This result follows from the geometric series 1 9 i 10 i= k +1 = 9 (1 / 10)k / 10 = 9 (1 / 10)k+1 9 / 10 1 = k. 10 For example, with k = 3 we have = As another example, we have = By convention, we always shall assume that a rational number never ends in a string of all 9's. An immediate consequence to Theorem 1.2 is the following result: Corollary 1.1. A number is irrational if and only if it has a decimal expansion that neither terminates nor recurs. We have already seen that 2 is irrational. An example of another irrational number is x =

9 Another Construction of the Reals Theorem 1.2 and Corollary 1.1 give a method of constructing the real numbers based on the natural numbers. A brief outline of the steps follows: I. Let 0 denote no length and let 1 denote a fixed unit of length. II. By extending the initial length of 1 by incremental successive lengths of 1, we obtain the natural numbers ℵ = {1, 2, 3,...}. Including 0 gives us the whole numbers W. III. By considering all quotients a / b of natural numbers, we obtain the positive rational numbers Q +. Also allowing a = 0 gives us the non-negative rational numbers. IV. Every element in Q + a can be written uniquely in the form n + i i= 110 i, where n W, 0 a i 9 for all i, the sequence {a i } either terminates by ending in all 0's or is recurring, and the sequence {a i } does not end in a string of all 9's. V. Let the non-negative irrational numbers I + be defined by all values of the form a n + i i= 110 i, where n W, 0 a i 9 for all i, and the sequence {a i } neither terminates nor recurs. (In particular, irrational numbers also cannot end in a string of all 9's.) VI. Let the positive real numbers be defined by R + = Q + I +. a VII. Negative numbers can be written in the form n ± i i=1 10 i. A real number is therefore either rational or irrational. By comparing the decimal expansions of any two real numbers x and y, we can see that either x < y, x = y, or y < x. Thus, the Reals are ordered. The next results prove that both the rational numbers and the irrational numbers are dense within the Reals. Theorem 1.3. Let x and y be any two real numbers with 0 x < y. (a) There exists a rational number z such that x < z < y. (b) There exists an irrational number w such that x < w < y. Proof. Let x = m. a 1 a 2 a 3... and y = n. b 1 b 2 b 3... be the decimal forms of x and y where 0 m n. Suppose first that m < n. Because x cannot end in a string of all 9's, let a i be the first decimal place value such that a i < 9. Then change a i to a i + 1 and let z = m. a 1 a 2 a 3...(a i + 1), which is rational, and let w = m. a 1 a 2 a 3...(a i + 1)c 1 c 2 c 3..., where the sequence {c i } neither terminates nor recurs, so that w is irrational. We then have x < z < y and x < w < y.

10 Next assume that m = n. Because x < y, we must have a 1 b 1. We now choose the smallest index i such that a i < b i. Then we must have a j = b j for 1 j < i or else x would be larger than y. Now because x cannot end in a string of all 9's, choose the least k i such that a k < 9. Now let z = m. a 1 a 2 a 3...a i...(a k + 1). Then z is rational and x < z < y. Finally, let w = m. a 1 a 2 a 3...a i... (a k + 1)c 1 c 2 c 3... where the sequence {c i } neither terminates nor recurs, so that w is irrational. Then x < w < y. QED Corollary 1.2. Let x and y be any two real numbers with x < y. (a) There exists a rational number z such that x < z < y. (b) There exists an irrational number w such that x < w < y. Proof. If 0 x < y, then the result is proved in Theorem 1.3. If x < 0 < y, then by Theorem 1.3, we can find such z and w such that x < 0 < z < y and x < 0 < w < y. If x < y 0, then 0 y < x. So we can apply Theorem 1.3 to find a rational z and an irrational w such that y < z < x and y < w < x. But then z is rational and w is irrational with x < z < y and x < w < y. QED Example 1.6. Apply Theorem 1.3 to x = and y = 9.01 assuming x is rational and assuming x is irrational. Solution. Let z = 8.995, which is rational. Then x < z < y regardless of whether x is rational or irrational. If x is irrational, then let w = x , which is irrational. Then x < w < y. However if x is rational, then let w = ( 2 1) / 1000 = , which is irrational. (This expression simply appends the decimal digits of ) Then x < w < y. 2 to the end of We continue with two of the most important property of real numbers: Theorem 1.4. The set of real numbers has the greatest lower bound property. Proof. Let E a non-empty subset of R that is bounded below. Let r R be a lower bound of E and let F be the set of all integers k such that k r. Then r is an upper bound of F ; thus, by Prop. 1.6, we can choose a greatest element n in F. Then n r, so n is also a lower bound of E. By Prop. 1.4, if n E, then n = inf E. Otherwise, we continue: Choose the greatest integer a 1 from 0 to 9 such that n + a 1 / 10 is a lower bound of E. If n + a 1 / 10 E, then n + a 1 / 10 = inf E. Otherwise, choose the greatest integer a 2 from 0 to 9 such that n + a 1 / 10 + a 2 / 10 2 is a lower bound of E.

11 Continuing, we thereby obtain a real number α = n + i=1a i / 10 i with α n + 1. k We claim α = inf E. So let x E. By construction, n + i=1a i / 10 i x for all k 1. In particular, n x. If n + 1 x, then α n + 1 x. But suppose x < n + 1 with x = n + i=1b i / 10 i where the string {b i } does not end in all 9's. If we had x < α, then we must have b k < a k for some k and we can choose the smallest integer k for which k this occurs. But then we would have x < n + i=1a i / 10 i, which is a contradiction. Thus, α x ; that is, α is a lower bound of E. Next, suppose λ is a different lower bound of E. We must show that λ < α. So write λ = m + i=1c i / 10 i Then m λ, so m is also a lower bound of E. By the choice of n above, we must have m n. If m < n, then λ < α. So suppose m = n. Now if a k < c k for some k and we choose the smallest k where this occurs, then we would k have n + c i / 10 i λ x for all x E. But then this c k contradicts the choice of a k. i= 1 So we must have c k a k for all k. That is, λ α. But because λ is different that α, we must have λ < α. That is, α = inf E. QED From Theorems 1.1 and 1.4, we obtain: Corollary 1.2. The set of real numbers has the least upper bound property. That is, any non-empty subset of R that is bounded above has a least upper bound in R. An important consequence of the glb and lub properties of the real line is the fact that the intersection of a nested decreasing sequence of closed intervals is non-empty: [a 1, b 1 ] [a 2, b 2 ] [a 3, b 3 ]... [sup{a i }, inf{b i }] a 1 a 2 a 3... a i... sup{a i } inf{b i }... b i... b 3 b 2 b 1 Theorem 1.5. (Nested Interval Property) Let [a i, b i ] be a nested decreasing sequence of closed intervals. Then [sup{a i }, inf{b i }] [a i, b i ]. In particular, [a i, b i ]. i =1 i =1 Proof. Because the intervals are nested decreasing, we have a i a i+1 b i+1 b i for i 1. So the set of points {a i } is bounded above by each b i and the set of points {b i } is bounded below by each a i ; hence a = sup{a i } and b = inf{b i } exist by the least upper bound and greatest lower bound properties of R. Because each b i is an upper bound of {a i } and a is the least upper bound of {a i }, we have a b i for all i 1. But then a becomes a lower bound of the {b i }; so a b because b is the greatest lower bound of the {b i }. For all i 1, we then have a i a b b i ; thus, [a, b] [a i, b i ]. In particular, [a i, b i ] contains a and b. QED i =1 i =1

12 Exercises 1. Prove: If c is rational, c 0, and x is irrational, then c x and c + x are irrational. 2. Prove that 12 is irrational. 3. Let E be a non-empty subset of an ordered set. Suppose α is a lower bound of E and β is an upper bound of E. Prove that α β. 4. Let E be a non-empty subset of an ordered set S that has the least upper bound property. Suppose E is bounded above and below. Prove that inf E sup E. 5. Let S be a non-empty subset of the real numbers that is bounded below. Define S by S = { x x S }. Prove: (i) S is bounded above. (ii) lub( S) = glbs. 6. Prove: Let α be a lower bound of a subset E of an ordered set S. If α E, then α = inf E. 7. Let S be an ordered set with the greatest lower bound property. Prove that S has the least upper bound property. 8. Find a rational number and an irrational number between x = and y = Let a,b R with a < b, (i) For the open interval E = (a, b), prove that inf E = a and sup E = b. (ii) For the closed interval F = [a, b], prove that inf F = a and supf = b.

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

More information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate 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 information

So let us begin our quest to find the holy grail of real analysis.

So let us begin our quest to find the holy grail of real analysis. 1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

More information

Continued Fractions and the Euclidean Algorithm

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 information

CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 Solutions CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

More information

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

More information

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

More information

MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 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 information

Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

Metric Spaces Joseph Muscat 2003 (Last revised May 2009) 1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of

More information

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL 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 information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. 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 information

8 Divisibility and prime numbers

8 Divisibility and prime numbers 8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

More information

8 Primes and Modular Arithmetic

8 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 information

Notes on metric spaces

Notes on metric spaces Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

More information

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION. 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 information

MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 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 information

MACM 101 Discrete Mathematics I

MACM 101 Discrete Mathematics I MACM 101 Discrete Mathematics I Exercises on Combinatorics, Probability, Languages and Integers. Due: Tuesday, November 2th (at the beginning of the class) Reminder: the work you submit must be your own.

More information

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors. The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

More information

SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

More information

a 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.

a 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 information

MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

More information

x a x 2 (1 + x 2 ) n.

x a x 2 (1 + x 2 ) n. Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

More information

3. Mathematical Induction

3. 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 information

Zeros of a Polynomial Function

Zeros 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 information

Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

More information

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

More information

Section 1.1 Real Numbers

Section 1.1 Real Numbers . Natural numbers (N):. Integer numbers (Z): Section. Real Numbers Types of Real Numbers,, 3, 4,,... 0, ±, ±, ±3, ±4, ±,... REMARK: Any natural number is an integer number, but not any integer number is

More information

The last three chapters introduced three major proof techniques: direct,

The last three chapters introduced three major proof techniques: direct, CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

More information

Elementary 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. 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 information

PYTHAGOREAN TRIPLES KEITH CONRAD

PYTHAGOREAN 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 information

26 Integers: Multiplication, Division, and Order

26 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

We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b

We 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 information

3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.

3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9. SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid

More information

Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some 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 information

GREATEST COMMON DIVISOR

GREATEST COMMON DIVISOR DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their

More information

THE BANACH CONTRACTION PRINCIPLE. Contents

THE 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 information

Full and Complete Binary Trees

Full and Complete Binary Trees Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full

More information

INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

More information

DigitalCommons@University of Nebraska - Lincoln

DigitalCommons@University of Nebraska - Lincoln University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-1-007 Pythagorean Triples Diane Swartzlander University

More information

Basic 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 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 information

Mathematics for Econometrics, Fourth Edition

Mathematics for Econometrics, Fourth Edition Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents

More information

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

Discrete 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 information

Math Workshop October 2010 Fractions and Repeating Decimals

Math 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 information

Previously, you learned the names of the parts of a multiplication problem. 1. a. 6 2 = 12 6 and 2 are the. b. 12 is the

Previously, you learned the names of the parts of a multiplication problem. 1. a. 6 2 = 12 6 and 2 are the. b. 12 is the Tallahassee Community College 13 PRIME NUMBERS AND FACTORING (Use your math book with this lab) I. Divisors and Factors of a Number Previously, you learned the names of the parts of a multiplication problem.

More information

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

More information

Continued Fractions. Darren C. Collins

Continued 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 information

A 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 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 information

Convex analysis and profit/cost/support functions

Convex analysis and profit/cost/support functions CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m

More information

= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

More information

10.2 Series and Convergence

10.2 Series and Convergence 10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and

More information

4.2 Euclid s Classification of Pythagorean Triples

4.2 Euclid s Classification of Pythagorean Triples 178 4. Number Theory: Fermat s Last Theorem Exercise 4.7: A primitive Pythagorean triple is one in which any two of the three numbers are relatively prime. Show that every multiple of a Pythagorean triple

More information

Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

Kevin 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 information

Section 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4.

Section 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4. Difference Equations to Differential Equations Section. The Sum of a Sequence This section considers the problem of adding together the terms of a sequence. Of course, this is a problem only if more than

More information

Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.

Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set. Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

More information

Gröbner Bases and their Applications

Gröbner Bases and their Applications Gröbner Bases and their Applications Kaitlyn Moran July 30, 2008 1 Introduction We know from the Hilbert Basis Theorem that any ideal in a polynomial ring over a field is finitely generated [3]. However,

More information

Zero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.

Zero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P. MATH 11011 FINDING REAL ZEROS KSU OF A POLYNOMIAL Definitions: Polynomial: is a function of the form P (x) = a n x n + a n 1 x n 1 + + a x + a 1 x + a 0. The numbers a n, a n 1,..., a 1, a 0 are called

More information

Lectures on Number Theory. Lars-Åke Lindahl

Lectures on Number Theory. Lars-Åke Lindahl Lectures on Number Theory Lars-Åke Lindahl 2002 Contents 1 Divisibility 1 2 Prime Numbers 7 3 The Linear Diophantine Equation ax+by=c 12 4 Congruences 15 5 Linear Congruences 19 6 The Chinese Remainder

More information

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

More information

Basic Proof Techniques

Basic 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 information

6.2 Permutations continued

6.2 Permutations continued 6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

More information

Computational Models Lecture 8, Spring 2009

Computational Models Lecture 8, Spring 2009 Slides modified by Benny Chor, based on original slides by Maurice Herlihy, Brown Univ. p. 1 Computational Models Lecture 8, Spring 2009 Encoding of TMs Universal Turing Machines The Halting/Acceptance

More information

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

More information

THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

More information

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +... 6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

More information

Basics of Counting. The product rule. Product rule example. 22C:19, Chapter 6 Hantao Zhang. Sample question. Total is 18 * 325 = 5850

Basics of Counting. The product rule. Product rule example. 22C:19, Chapter 6 Hantao Zhang. Sample question. Total is 18 * 325 = 5850 Basics of Counting 22C:19, Chapter 6 Hantao Zhang 1 The product rule Also called the multiplication rule If there are n 1 ways to do task 1, and n 2 ways to do task 2 Then there are n 1 n 2 ways to do

More information

Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions

Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Stanford Math Circle: Sunday, May 9, 00 Square-Triangular 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 information

k, then n = p2α 1 1 pα k

k, 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 information

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 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 information

This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements. 3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

More information

ON THE COEFFICIENTS OF THE LINKING POLYNOMIAL

ON THE COEFFICIENTS OF THE LINKING POLYNOMIAL ADSS, Volume 3, Number 3, 2013, Pages 45-56 2013 Aditi International ON THE COEFFICIENTS OF THE LINKING POLYNOMIAL KOKO KALAMBAY KAYIBI Abstract Let i j T( M; = tijx y be the Tutte polynomial of the matroid

More information

Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:

Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold: Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),

More information

Quotient Rings and Field Extensions

Quotient Rings and Field Extensions Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

More information

Trigonometric Functions and Triangles

Trigonometric Functions and Triangles Trigonometric Functions and Triangles Dr. Philippe B. Laval Kennesaw STate University August 27, 2010 Abstract This handout defines the trigonometric function of angles and discusses the relationship between

More information

Collinear Points in Permutations

Collinear Points in Permutations Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

More information

Fundamentele Informatica II

Fundamentele Informatica II Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear

More information

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM 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 information

Homework until Test #2

Homework until Test #2 MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

More information

An example of a computable

An example of a computable An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

More information

Section 3-3 Approximating Real Zeros of Polynomials

Section 3-3 Approximating Real Zeros of Polynomials - Approimating Real Zeros of Polynomials 9 Section - Approimating Real Zeros of Polynomials Locating Real Zeros The Bisection Method Approimating Multiple Zeros Application The methods for finding zeros

More information

This chapter is all about cardinality of sets. At first this looks like a

This chapter is all about cardinality of sets. At first this looks like a CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

More information

Applications of Fermat s Little Theorem and Congruences

Applications of Fermat s Little Theorem and Congruences Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4

More information

Handout #1: Mathematical Reasoning

Handout #1: Mathematical Reasoning Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

More information

An Introduction to Real Analysis. John K. Hunter. Department of Mathematics, University of California at Davis

An Introduction to Real Analysis. John K. Hunter. Department of Mathematics, University of California at Davis An Introduction to Real Analysis John K. Hunter Department of Mathematics, University of California at Davis Abstract. These are some notes on introductory real analysis. They cover the properties of the

More information

Lecture 3: Finding integer solutions to systems of linear equations

Lecture 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 information

E3: PROBABILITY AND STATISTICS lecture notes

E3: PROBABILITY AND STATISTICS lecture notes E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................

More information

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

More information

Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.

Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p. Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a

More information

CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED 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 information

Today s Topics. Primes & Greatest Common Divisors

Today s Topics. Primes & Greatest Common Divisors Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime

More information

6.3 Conditional Probability and Independence

6.3 Conditional Probability and Independence 222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

More information

CONTENTS 1. Peter Kahn. Spring 2007

CONTENTS 1. Peter Kahn. Spring 2007 CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................

More information

Elements of probability theory

Elements of probability theory 2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted

More information

Automata and Formal Languages

Automata and Formal Languages Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

More information

Math 3000 Section 003 Intro to Abstract Math Homework 2

Math 3000 Section 003 Intro to Abstract Math Homework 2 Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these

More information

Real Roots of Univariate Polynomials with Real Coefficients

Real Roots of Univariate Polynomials with Real Coefficients Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials

More information

4. How many integers between 2004 and 4002 are perfect squares?

4. How many integers between 2004 and 4002 are perfect squares? 5 is 0% of what number? What is the value of + 3 4 + 99 00? (alternating signs) 3 A frog is at the bottom of a well 0 feet deep It climbs up 3 feet every day, but slides back feet each night If it started

More information

1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]

1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ] 1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not

More information

U.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 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 information