MATH10040 Chapter 1: Integers and divisibility

Size: px
Start display at page:

Download "MATH10040 Chapter 1: Integers and divisibility"

Transcription

1 MATH10040 Chapter 1: Integers and divisibility Recall the basic definition: 1. Divisibilty Definition 1.1. If a, b Z, we say that b divides a, or that a is a multiple of b and we write b a if there is an integer c such that a = bc. Example 1.2. Take a = 75, b = since 75 = (So in this case c = 15.) Example 1.3. If b is any integer, then b 0 since 0 = b 0. So 0 is divisible by every integer. Example 1.4. If 0 a then a = 0 c for some integer c, and hence a = 0. Thus the only integer divisible by 0 is 0. Example 1.5. An integer is even if and only if it is divisible by 2. It is odd if and only if it is not divisible by Elementary properties of divisibility. Lemma 1.6. If a, b Z and if b a then b ta for all integers t. Proof. Since b a there is some integer c with a = bc. Let t Z. Then at = (bc)t = b(ct) is a multiple of b since ct is an integer. Lemma 1.7. If d Z and if d a and d b, then d a + b. Proof. Since d a, a = dm for some m Z. Since d b, b = dn for some n Z. Thus a + b = dm + dn = d(m + n) is a multiple of d, since m + n Z. Lemma 1.8. If d Z and if d a and d b, then d as + bt for any s, t Z. Proof. d as and d bt by Lemma 1.6. Therefore d as + bt by Lemma The Division Algorithm. Of course, in general, given two integers a and b, it will not be true that b a. Even in primary school we learn how to make the best of this situation: (when a > 0) we find the largest multiple of a which is less than b. The remaining difference is called the remainder 1

2 2 Example 1.9. Given a = 37 and b = 5. Then 35 = 5 7 is the multiple of 5 which is closest to but not greater than 37. The remainder is = 2. We say that 37 leaves remainder 2 on division by 5. Note that our calculation can be summarised as 37 = Dividing across by 5, we can write this as 37 5 = Here, 7 is the largest integer which is not greater than 37/5. It is called the integer part or greatest integer of 37/5. 2/5 is called the fractional part of 37/5. Definition Let x be a real number. We denote by x the largest integer which is less than or equal to x. ( x is called the greatest integer of x or the floor of x.) Example = 1. 37/5 = 7. π = = = 2. π = 4. Lemma Let x R. (1) Let t = x. Then t x < t + 1. (2) Conversely, if s Z and s x < s + 1 then s = x. Proof. (1) By definition of x, t x. Suppose, for the sake of contradiction, that x t+1. Then t+1 x. But since t Z, t + 1 Z. Since t + 1 > t, this contradicts the fact that t is the largest integer which is less than or equal to x. (2) From the information given, s x while if r is an integer greater than s then r s + 1 > x. Thus s is the largest integer which less than or equal to x; i.e. s = x. The following (very important) theorem just sets down in formal mathematical language something you have known (or at least assumed true) since primary school. We will use it extensively throughout the semester: it is the basis for almost everything which follows.

3 3 Theorem 1.13 (The Division Algorithm). Let p, q Z with q > 0. Existence There exist integers t, r Z such that p = tq + r and 0 r < q. Uniqueness There is only one pair of integers t and r satisfying the conditions p = tq + r and 0 r < q. Remark We say that r is the remainder of p on division by q. (Because of the uniqueness part of the theorem, it makes sense to use the definite article - the - here.) We will sometimes use the notation R q (p) for the remainder of p on division by q. Thus R 5 (27) = 2, R 7 (50) = 1, R 10 (123456) = 6, etc. (This notation is not standard; there is no standard agreed notation for remainders.) Remark Of course, if we do not require that 0 r < q, then there are many pairs t, r satisfying the equation p = tq + r: take any integer t and then take r := p tq. The point of the theorem is that there is one and only one solution satisfying the crucial extra condition that 0 r < q. Proof. We first prove the existence part: Existence Let t = p/q. Then t Z, and t p q < t + 1 by our Lemma. Multiply across by q to get Subtracting tq gives tq p < tq + q. 0 p tq < q. Thus, if we let r := p tq then 0 r < q and p = tq + r. Uniqueness Suppose that t, r Z satisfy (1) p = tq + r and 0 r < q. We ll show first that t must be equal to p/q : dividing across by q in (1) gives p q = t + r and 0 r q q < 1.

4 4 Since 0 r we have p = t + r t. Since r < 1, p = t + r < t + 1. q q q q q q Thus the integer t satisfies t p < t + 1. Thus it is the largest q integer which is less than or p. By definition, it follows that t = p. q q Hence t is determined by p and q. Since r = p qt = p p t, it follows that r is also uniquely q determined by p and q. 2. Greatest Common Divisors 2.1. Example: Water-pouring problems. These problems and their connection with Die Hard 3 will be covered in the lectures Definition and elementary properties. Definition 2.1. Let a, b Z \ {0}. An integer which divides both a and b is called a common divisor. The greatest common divisor of a and b is the largest integer which divides both a and b. We will denote it gcd(a, b), or, more simply when no confusion can arise, (a, b). We begin with the following observation: Lemma 2.2. For any a, b Z \ {0}, (a, b) 1. Proof. Certainly 1 is a common divisor of a and b. So the greatest common divisor is at least as big as 1. For small pairs of numbers, it is easy to calculate the gcd by considering the factors of the smaller number: (6, 15) = 3. (5, 15) = 5. (37, 43) = 1. etc For larger pairs, this is not a feasible or efficient approach. (Try to calculate (1517, 2183).) We will see below that there is a beautifully efficient method for calculating the gcd of two integers a and b without factoring either of them. (This is Euclid s Algorithm.) Definition 2.3. More generally suppose that a 1,..., a t are any t nonzero integers. If d a i for i = 1,..., t we say that d is a common divisor of a 1,..., a t. The largest common divisor of a 1,..., a t is called the greatest common divisor, and is denoted gcd(a 1,..., a t ) or, more simply, (a 1,..., a t ).

5 Example 2.4. gcd(12, 33, 48) = 3. gcd(14, 49, 21, 56) = 7. Exercise 2.5. Find three nonzero integers a, b, c such that (a, b) > 1, (a, c) > 1 and (b, c) > 1 but (a, b, c) = 1. We will often use the following elementary observation about gcds: Lemma 2.6. Suppose that a, b are nonzero integers and let g = (a, b). Then a/g, b/g Z and ( a g, b ) = 1. g Proof. Since g is a common divisor of a and b there are integers m, n such that a = gm and b = gn; i.e. a/g = m, b/g = n Z. Suppose that d 1 is a common divisor of m and n. So m = ds and n = dt for some integers s and t. It follows that a = (gd)s and b = (gd)t, and hence gd is a common divisor of a and b. Since g is the greatest common divisor of a and b, this implies that d = 1. Corollary 2.7. Let q be a nonzero rational number. Then there exist integers m, n satisfying (m, n) = 1 and q = m/n. Proof. Since q is rational, q = a/b for some nonzero integers a and b. Let g = (a, b). Then there are integers m, n with a = gm, b = gn. By Lemma 2.6, (m, n) = 1. Also q = a b = gm gn = m n. If q is a nonzero rational number and q = m/n with (m, n) = 1, we say that we have written it in reduced form or in lowest terms. Example 2.8. Write the rational number 24/16 in reduced form. Answer: 3/2 (cancel the gcd 8 above and below). Suppose given two nonzero integers a and b. Let us consider the following problem: Which integers can be written as a combination of the form as+bt for some integers s and t? (We will discuss the connection of this question with water-pouring problems in class.) 5

6 6 The theory of divisors tells us that in general we cannot expect that every integer can be expressed in this way: Recall that if d is a common divisor of a and b then d also divides every integer of the form as + bt. In particular, the greatest common divisor g = (a, b) must divide every integer of the form as + bt. To put this another way: If the integer n is not divisible by (a, b) then it cannot be expressed as as + bt for some integers s, t. Example 2.9. The equation 1849 = 27s+15t has no integer solutions since 3 = (27, 15) and We can express this fact as follows: A necessary condition for the equation n = as + bt to have integer solutions is that (a, b) n. The obvious follow-up question is: Is this condition also sufficient?: If (a, b) n does it follow that there are integers s and t satisfying n = as + bt? Let g = (a, b). A particular case of this last question is: can g be expressed as a combination of a and b; do there exist integers s and t such that g = as + bt? Amazingly, the answer to these questions is yes: Theorem 2.10 (GCD Theorem). Let a, b be nonzero integers. Let g = (a, b). Then there exist integers s and t such that g = as + bt. Proof. We are going to use the well-ordering principle: every nonempty set of positive integers has a least element. First let I be the set of all integers which can be expressed in the form au + bv for some u, v Z; i.e. I := {n Z n = au + bv for some u, v Z}. Note that a I since a = a 1 + b 0. Similarly a = a ( 1) + b 0 I. Similarly ±b I. Let S be the subset of positive integers which belong to I: S := {n I n > 0}. S is non-empty (since, for example, either a S if a > 0 or a S if a < 0). By the well-ordering principle S has a least element. Let s call it h. Since h S I, there exist s, t Z such that h = as+bt. By our discussion above, it follows that g h. Claim: h is a common divisor of a and b. Proof of Claim: We will show that h a. An identical proof shows that h b. By the division algorithm, we can write a = wh + r for some w Z and r satisfying 0 r < h.

7 However, note that r I, since r = a wh = a w(as + bt) = a (1 ws) + b ( wt), 1 ws, wt Z. However, since r < h and h is the least element of S, it follows that r S; i.e. r 0. Since 0 r it follows that r = 0, and hence a = wh, proving the claim. Since h is a common divisor of a and b, and since g is the greatest common divisor of a and b, it follows that h g. But h > 0 and g h. This implies h = g, and the proof is complete (since h is of the form as + bt). Observe that as a consequence of the proof we have: Corollary Let a and b be nonzero integers, and let g = (a, b). Then g is the smallest positive integer which can be written in the form as + bt for some s, t Z. Another corollary of the Theorem is the following: Corollary Let a, b be nonzero integers and let d be any common divisor of a and b. Then d (a, b). Proof. Let g = (a, b). Then g = as + bt for some s, t Z by the Theorem. Thus, if d a and d b then d as + bt = g by Lemma 1.8. Hence, not only is the greatest common divisor larger than any other common divisor; it is in fact a multiple of any other common divisor. The theorem also allows us to answer completely the question with which we began this discussion: Corollary Let a and b be nonzero integers and let g = (a, b). An integer n can be expressed in the form as + bt with s, t Z if and only if n is a multiple of g. Proof. We have already seen in the discussion above that any integer of the form as + bt is divisible by g. We must prove the converse statement: Suppose that g n. We must show that n = as + bt for some integers s and t. Now g n = n = gm for some m Z. By the GCD Theorem, g = au + bv for some u, v Z. Therefore n = gm = (au + bv)m = a(um) + b(vm) which is of the required form, since s = um, t = vm Z. We will often have occasion to use the following very important special case (when g = 1) of this last corollary: 7

8 8 Corollary Let a and b be nonzero integers and suppose that (a, b) = 1. Then there exist integers s and t satisfying 1 = as + bt. We also make the simple observation that the converse statement is also true: Corollary Let a and b be nonzero integers. Then (a, b) = 1 there exist s, t Z with as + bt = 1. Proof. = is just the last result. =: Suppose conversely that there are integers s and t satisfying as+bt = 1. Suppose that d is a common divisor of a and b. Then d as + bt = 1. So d = ±1. Hence (a, b) = 1. Definition We say that the nonzero integers a and b are relatively prime if (a, b) = 1. Example Are there integers s and t such that the equation 55 = 97s + 61t? Answer: yes! (61, 97) = 1. So any multiple of 1 (i.e. any integer) can be expressed in the form 97s + 61t. In particular, 55 can be expressed in this way. Example Are there integers s and t such that 55 = 91s + 63t? Answer: No. (91, 63) = 7 and Euclid s Algorithm. We know that the equation 55 = 97s + 61t has integer solutions, but how do we find them? There is a very elegant procedure, due to Euclid, which simultaneously finds the gcd, g of two numbers a and b, and finds a solution of the equation g = as + bt. The principle behind this procedure is the following simple result: Lemma Let a and b be nonzero integers and suppose that b = am + c for some integers m, c with c 0. Then (a, b) = (a, c). (That is, in calculating the gcd of a and b, we can replace b with c and instead calculate the gcd of a and c). Proof. We simply show that the pairs of integers a, b and a, c have precisely the same common divisors. It follows that they have the same greatest common divisor. Suppose first that d is a common divisor of a and b. Since c = am + b we have d c. Thus d is acommon divisor of a and c.

9 Conversely, suppose that f is a common divisor of a and c. Since b = am+c, we have f b also and hence f is a common divisor of a and b. In particular, Euclid s algorithm consists of using the following special case over and over again to reduce the size of the numbers involved: Lemma Let a and b be positive integers with a < b. Let r be the remainder of b on division by a. Then (a, b) = (a, r). Proof. By the division algorithm, b = ta + r for some integer t. By the last lemma (a, b) = (a, r). We begin with a very elementary example, just to illustrate the method: Example Find the greatest common divisor g of 15 and 37. Express g is the form 15s + 37t for some s, t Z. We first divide the smaller into the larger: (2) 37 = By Lemma 2.20, g = (15, 37) = (15, 7) = (7, 15). Divide the smaller into the larger again: (3) 15 = By Lemma 2.20 again, g = (7, 15) = (1, 7) = 1. So far, this tells us what we can see at a glance: (15, 37) = 1. However, we can use the equations (2) and (3) to determine values of s and t such that 15s + 37t = 1: First, start with the last equation equation (3) and use it to express 1 in terms of 7 and 15: (4) 1 = Then use the previous equation to express 7 in terms of 15 and 37 and substitute this expression for 7 into (4): 1 = = 15 2 ( ) = So s = 5 and t = 2 are the required integers. Here are some less elementary examples. Example Find the greatest common divisor g of the numbers 986 and 437, and find integers s and t satisfying g = 986s + 437t. 9

10 10 Solution: First we use the division algorithm repeatedly until (our remainder is a common divisor): (5) (6) (7) (8) (9) 986 = = = = = This gives g = (986, 437) = 1. (To spell this out: Using Lemma 2.20 repeatedly (986, 437) = (437, 112) = (112, 101) = (101, 11) = (11, 2) = 1.) Now we bootstrap our way in reverse through the equations to find s and t: 1 = by (9) = 11 5 ( ) = using (8) = 46 ( ) = using (7) = ( ) = using (6) = 199 ( ) = using (5). Thus s = 199 and t = 437 work. Example Find the gcd of 1517 and 2183 and express it as a linear combination of these two numbers. Solution: 2183 = = = = = Since 37 divides 74 (and hence also 111) we have reached the end of the road, and we can deduce that (2183, 1517) = 37. Finally, 37 = = 111 ( ) = = 2 ( ) 185 = = ( ) = = 16 ( ) =

11 11 Thus, 37 = 2183s t where s = 16 and t = 23. Example Find a solution of the equation 55 = 97x + 61y in integers x and y. Solution: We use the method suggested by the proof of Corollary = = = = = = So 1 = 3 2 = 3 (11 3 3) = = 4 ( ) 11 = = (36 25) = = 13 (61 36) 9 36 = = (97 61) = Multiplying across the equation 1 = by 55 gives 55 = (35 55) 61 (22 55) 97 = Thus x = 1210 and y = 1925 is a solution.

The following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers:

The following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers: Divisibility Euclid s algorithm The following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers: Divide the smaller number into the larger, and

More information

Elementary Properties of the Integers

Elementary Properties of the Integers Elementary Properties of the Integers 1 1. Basis Representation Theorem (Thm 1-3) 2. Euclid s Division Lemma (Thm 2-1) 3. Greatest Common Divisor 4. Properties of Prime Numbers 5. Fundamental Theorem of

More information

NOTES ON INTEGERS. 1. Integers

NOTES ON INTEGERS. 1. Integers NOTES ON INTEGERS STEVEN DALE CUTKOSKY The integers 1. Integers Z = {, 3, 2, 1, 0, 1, 2, 3, } have addition and multiplication which satisfy familar rules. They are ordered (m < n if m is less than n).

More information

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. 2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say

More information

Chapter 2. Divisibility. 2.1 Common Divisors

Chapter 2. Divisibility. 2.1 Common Divisors Chapter 2 Divisibility 2.1 Common Divisors Definition 2.1.1. Let a and b be integers. A common divisor of a and b is any integer that divides both a and b. Suppose that a and b are not both zero. By Proposition

More information

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

More information

1 Overview and revision

1 Overview and revision MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction

More information

This is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time.

This is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time. 8 Modular Arithmetic We introduce an operator mod. Let d be a positive integer. For c a nonnegative integer, the value c mod d is the remainder when c is divided by d. For example, c mod d = 0 if and only

More information

Notes on Systems of Linear Congruences

Notes on Systems of Linear Congruences MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the

More information

All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.

All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1

More information

4 Powers of an Element; Cyclic Groups

4 Powers of an Element; Cyclic Groups 4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)

More information

MATH10040: Chapter 0 Mathematics, Logic and Reasoning

MATH10040: Chapter 0 Mathematics, Logic and Reasoning MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly

More information

INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.

INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b

More information

Greatest Common Divisor MATH Greatest Common Divisor. Benjamin V.C. Collins, James A. Swenson MATH 2730

Greatest Common Divisor MATH Greatest Common Divisor. Benjamin V.C. Collins, James A. Swenson MATH 2730 MATH 2730 Greatest Common Divisor Benjamin V.C. Collins James A. Swenson The world s least necessary definition Definition Let a, b Z, not both zero. The largest integer d such that d a and d b is called

More information

Lecture 4: Number theory

Lecture 4: Number theory Lecture 4: Number theory Rajat Mittal IIT Kanpur In the next few classes we will talk about the basics of number theory. Number theory studies the properties of natural numbers and is considered one of

More information

Cool Results on Primes

Cool Results on Primes Cool Results on Primes LA Math Circle (Advanced) January 24, 2016 Recall that last week we learned an algorithm that seemed to magically spit out greatest common divisors, but we weren t quite sure why

More information

Ch 4.2 Divisibility Properties

Ch 4.2 Divisibility Properties Ch 4.2 Divisibility Properties - Prime numbers and composite numbers - Procedure for determining whether or not a positive integer is a prime - GCF: procedure for finding gcf (Euclidean Algorithm) - Definition:

More information

Chapter 5: The Integers

Chapter 5: The Integers c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition

More information

cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska

cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska LECTURE 12 CHAPTER 4 NUMBER THEORY PART1: Divisibility PART 2: Primes PART 1: DIVISIBILITY Basic Definitions Definition Given m,n Z, we say

More information

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime

More information

NOTES ON SIMPLE NUMBER THEORY

NOTES ON SIMPLE NUMBER THEORY NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,

More information

2 Elementary number theory

2 Elementary number theory 2 Elementary number theory 2.1 Introduction Elementary number theory is concerned with properties of the integers. Hence we shall be interested in the following sets: The set if integers {... 2, 1,0,1,2,3,...},

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

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

1. Factorization Divisibility in Z.

1. Factorization Divisibility in Z. 8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that

More information

Summary: Divisibility and Factorization

Summary: Divisibility and Factorization Summary: Divisibility and Factorization One of the main subjects considered in this chapter is divisibility of integers, and in particular the definition of the greatest common divisor Recall that we have

More information

Chapter 1 A Survey of Divisibility 14

Chapter 1 A Survey of Divisibility 14 Chapter 1 A Survey of Divisibility 14 SECTION C Euclidean Algorithm By the end of this section you will be able to use properties of the greatest common divisor (gcd) obtain the gcd using the Euclidean

More information

Chapter 5. Number Theory. 5.1 Base b representations

Chapter 5. Number Theory. 5.1 Base b representations Chapter 5 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,

More information

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...} WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not

More information

The Euclidean Algorithm and Multiplicative Inverses

The Euclidean Algorithm and Multiplicative Inverses 1 The Euclidean Algorithm and Multiplicative Inverses Lecture notes for Access 2009 The Euclidean Algorithm is a set of instructions for finding the greatest common divisor of any two positive integers.

More information

11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic

11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic 11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic Bezout s Lemma Let's look at the values of 4x + 6y when x and y are integers. If x is -6 and y is 4 we

More information

Intermediate Math Circles February 29, 2012 Linear Diophantine Equations I

Intermediate Math Circles February 29, 2012 Linear Diophantine Equations I Intermediate Math Circles February 29, 2012 Linear Diophantine Equations I Diophantine equations are equations intended to be solved in the integers. We re going to focus on Linear Diophantine Equations.

More information

5: The Integers (An introduction to Number Theory)

5: The Integers (An introduction to Number Theory) c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset

More information

1. multiplication is commutative and associative;

1. multiplication is commutative and associative; Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.

More information

PRIME NUMBERS YANKI LEKILI

PRIME NUMBERS YANKI LEKILI PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume

More information

PRACTICE PROBLEMS: SET 1

PRACTICE PROBLEMS: SET 1 PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if

More information

1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11.

1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 000 Chapter 1 Arithmetic in 1.1 The Division Algorithm Revisited 1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = 3. 2. (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 3. (a) q = 6, r =

More information

Divisibility. Def: a divides b (denoted a b) if there exists an integer x such that b = ax. If a divides b we say that a is a divisor of b.

Divisibility. Def: a divides b (denoted a b) if there exists an integer x such that b = ax. If a divides b we say that a is a divisor of b. Divisibility Def: a divides b (denoted a b) if there exists an integer x such that b ax. If a divides b we say that a is a divisor of b. Thm: (Properties of Divisibility) 1 a b a bc 2 a b and b c a c 3

More information

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z: NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,

More information

Divisibility. Chapter Divisors and Residues

Divisibility. Chapter Divisors and Residues Chapter 1 Divisibility Number theory is concerned with the properties of the integers. By the word integers we mean the counting numbers 1, 2, 3,..., together with their negatives and zero. Accordingly

More information

a = qb + r where 0 r < b. Proof. We first prove this result under the additional assumption that b > 0 is a natural number. Let

a = qb + r where 0 r < b. Proof. We first prove this result under the additional assumption that b > 0 is a natural number. Let 2. Induction and the division algorithm The main method to prove results about the natural numbers is to use induction. We recall some of the details and at the same time present the material in a different

More information

Direct Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24

Direct Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24 Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using

More information

7.2 Applications of Euler s and Fermat s Theorem.

7.2 Applications of Euler s and Fermat s Theorem. 7.2 Applications of Euler s and Fermat s Theorem. i) Finding and using inverses. From Fermat s Little Theorem we see that if p is prime and p a then a p 1 1 mod p, or equivalently a p 2 a 1 mod p. This

More information

Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z:

Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z: Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some z Z Notation: b Fact: for all, b, c Z:, 1, and 0 0 = 0 b and b c = c b and c = (b + c) b and b = ±b 1

More information

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald)

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures

More information

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer? Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

More information

Math 109 HW 9 Solutions

Math 109 HW 9 Solutions Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we

More information

1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11.

1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 000 Chapter 1 Arithmetic in 1.1 The Division Algorithm Revisited 1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = 3. 2. (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 3. (a) q = 6, r =

More information

Chapter 3 Basic Number Theory

Chapter 3 Basic Number Theory Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of

More information

Definition For a set F, a polynomial over F with variable x is of the form

Definition For a set F, a polynomial over F with variable x is of the form *6. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the

More information

(e) Commutativity: a b = b a. (f) Distributivity of times over plus: a (b + c) = a b + a c and (b + c) a = b a + c a.

(e) Commutativity: a b = b a. (f) Distributivity of times over plus: a (b + c) = a b + a c and (b + c) a = b a + c a. Math 299 Midterm 2 Review Nov 4, 2013 Midterm Exam 2: Thu Nov 7, in Recitation class 5:00 6:20pm, Wells A-201. Topics 1. Methods of proof (can be combined) (a) Direct proof (b) Proof by cases (c) Proof

More information

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31 Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15

More information

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer? Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

More information

Lecture 7: Polynomial rings

Lecture 7: Polynomial rings Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules

More information

Modular Arithmetic Instructor: Marizza Bailey Name:

Modular Arithmetic Instructor: Marizza Bailey Name: Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find

More information

Prof. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.

Prof. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even. 1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and

More information

Remainders. We learned how to multiply and divide in elementary

Remainders. We learned how to multiply and divide in elementary Remainders We learned how to multiply and divide in elementary school. As adults we perform division mostly by pressing the key on a calculator. This key supplies the quotient. In numerical analysis and

More information

MATH 145 Algebra, Solutions to Assignment 4

MATH 145 Algebra, Solutions to Assignment 4 MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178

More information

CS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II

CS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

MATH 3330 ABSTRACT ALGEBRA SPRING Definition. A statement is a declarative sentence that is either true or false.

MATH 3330 ABSTRACT ALGEBRA SPRING Definition. A statement is a declarative sentence that is either true or false. MATH 3330 ABSTRACT ALGEBRA SPRING 2014 TANYA CHEN Dr. Gordon Heier Tuesday January 14, 2014 The Basics of Logic (Appendix) Definition. A statement is a declarative sentence that is either true or false.

More information

Math 412, Introduction to abstract algebra. Overview of algebra.

Math 412, Introduction to abstract algebra. Overview of algebra. Math 412, Introduction to abstract algebra. Overview of algebra. A study of algebraic objects and functions between them; an algebraic object is typically a set with one or more operations which satisfies

More information

1 Continued Fractions

1 Continued Fractions Continued Fractions To start off the course, we consider a generalization of the Euclidean Algorithm which has ancient historical roots and yet still has relevance and applications today.. Continued Fraction

More information

and LCM (a, b, c) LCM ( a, b) LCM ( b, c) LCM ( a, c)

and LCM (a, b, c) LCM ( a, b) LCM ( b, c) LCM ( a, c) CHAPTER 1 Points to Remember : REAL NUMBERS 1. Euclid s division lemma : Given positive integers a and b, there exists whole numbers q and r satisfying a = bq + r, 0 r < b.. Euclid s division algorithm

More information

MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS. Contents 1. Polynomial Functions 1 2. Rational Functions 6

MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS. Contents 1. Polynomial Functions 1 2. Rational Functions 6 MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS PETE L. CLARK Contents 1. Polynomial Functions 1 2. Rational Functions 6 1. Polynomial Functions Using the basic operations of addition, subtraction,

More information

CHAPTER 8: EXPLORING R

CHAPTER 8: EXPLORING R CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed

More information

Mathematical Reasoning & Proofs

Mathematical Reasoning & Proofs Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0

More information

CISC-102 Winter 2016 Lecture 11 Greatest Common Divisor

CISC-102 Winter 2016 Lecture 11 Greatest Common Divisor CISC-102 Winter 2016 Lecture 11 Greatest Common Divisor Consider any two integers, a,b, at least one non-zero. If we list the positive divisors in numeric order from smallest to largest, we would get two

More information

The theory of numbers

The theory of numbers 1 AXIOMS FOR THE INTEGERS 1 The theory of numbers UCU Foundations of Mathematics course 2017 Author: F. Beukers 1 Axioms for the integers Roughly speaking, number theory is the mathematics of the integers.

More information

As the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic

As the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic Chapter 4 Three Famous Theorems As the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic The goal of this section is to prove The Fundamental Theorem

More information

Divisibility = 16, = 9, = 2, = 5. (Negative!)

Divisibility = 16, = 9, = 2, = 5. (Negative!) Divisibility 1-17-2018 You probably know that division can be defined in terms of multiplication. If m and n are integers, m divides n if n = mk for some integer k. In this section, I ll look at properties

More information

CHAPTER 4: EXPLORING Z

CHAPTER 4: EXPLORING Z CHAPTER 4: EXPLORING Z MATH 378, CSUSM. SPRING 2009. AITKEN 1. Introduction In this chapter we continue the study of the ring Z. We begin with absolute values. The absolute value function Z N is the identity

More information

Number Theory and Graph Theory. Prime numbers and congruences.

Number Theory and Graph Theory. Prime numbers and congruences. 1 Number Theory and Graph Theory Chapter 2 Prime numbers and congruences. By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-1:Primes

More information

Solutions to Assignment 1

Solutions to Assignment 1 Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive

More information

Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures

Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures Lance Burger Fresno State Preliminary Edition Contents Preface ix 1 Z The Integers 1 1.1 What are the Integers?......................

More information

Elementary Number Theory

Elementary Number Theory Elementary Number Theory CIS002-2 Computational Alegrba and Number Theory David Goodwin david.goodwin@perisic.com 09:00, Tuesday 25 th October 2011 Contents 1 Some definitions 2 Divisibility Divisors Euclid

More information

Math 511, Algebraic Systems, Fall 2017 July 20, 2017 Edition. Todd Cochrane

Math 511, Algebraic Systems, Fall 2017 July 20, 2017 Edition. Todd Cochrane Math 511, Algebraic Systems, Fall 2017 July 20, 2017 Edition Todd Cochrane Department of Mathematics Kansas State University Contents Notation v Chapter 0. Axioms for the set of Integers Z. 1 Chapter 1.

More information

MATH FINAL EXAM REVIEW HINTS

MATH FINAL EXAM REVIEW HINTS MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any

More information

EUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972)

EUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972) Intro to Math Reasoning Grinshpan EUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972) We all know that every composite natural number is a product

More information

Proof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have

Proof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.

More information

Basic elements of number theory

Basic elements of number theory Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a

More information

. As the binomial coefficients are integers we have that. 2 n(n 1).

. As the binomial coefficients are integers we have that. 2 n(n 1). Math 580 Homework. 1. Divisibility. Definition 1. Let a, b be integers with a 0. Then b divides b iff there is an integer k such that b = ka. In the case we write a b. In this case we also say a is a factor

More information

Basic elements of number theory

Basic elements of number theory Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation

More information

Math 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.

Math 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n. Math 324, Fall 2011 Assignment 7 Solutions Exercise 1. (a) Suppose a and b are both relatively prime to the positive integer n. If gcd(ord n a, ord n b) = 1, show ord n (ab) = ord n a ord n b. (b) Let

More information

Beautiful Mathematics

Beautiful Mathematics Beautiful Mathematics 1. Principle of Mathematical Induction The set of natural numbers is the set of positive integers {1, 2, 3,... } and is denoted by N. The Principle of Mathematical Induction is a

More information

Number Theory Solutions Packet

Number Theory Solutions Packet Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of

More information

Fall 2017 Test II review problems

Fall 2017 Test II review problems Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and

More information

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same

More information

CHAPTER 3. Number Theory

CHAPTER 3. Number Theory CHAPTER 3 Number Theory 1. Factors or not According to Carl Friedrich Gauss (1777-1855) mathematics is the queen of sciences and number theory is the queen of mathematics, where queen stands for elevated

More information

An Introduction to Mathematical Thinking: Algebra and Number Systems. William J. Gilbert and Scott A. Vanstone, Prentice Hall, 2005

An Introduction to Mathematical Thinking: Algebra and Number Systems. William J. Gilbert and Scott A. Vanstone, Prentice Hall, 2005 Chapter 2 Solutions An Introduction to Mathematical Thinking: Algebra and Number Systems William J. Gilbert and Scott A. Vanstone, Prentice Hall, 2005 Solutions prepared by William J. Gilbert and Alejandro

More information

MATH 145 Algebra, Solutions to Assignment 4

MATH 145 Algebra, Solutions to Assignment 4 MATH 145 Algebra, Solutions to Assignment 4 1: a Let a 975 and b161 Find d gcda, b and find s, t Z such that as + bt d Solution: The Euclidean Algorithm gives 161 975 1 + 86, 975 86 3 + 117, 86 117 + 5,

More information

Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur

Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture 02 Groups: Subgroups and homomorphism (Refer Slide Time: 00:13) We looked

More information

Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.

Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R. Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over

More information

MAS1202/MAS2202 Number Systems and the Foundations of Analysis. Semester 1, 2009/2010

MAS1202/MAS2202 Number Systems and the Foundations of Analysis. Semester 1, 2009/2010 MAS1202/MAS2202 Number Systems and the Foundations of Analysis Semester 1, 2009/2010 Lecturer: Dr A Duncan This module is an introduction to Pure Mathematics. The central theme of the course is the notion

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In N we can do addition, but in order to do subtraction we need to extend N to the integers Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need

More information

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4 Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement

More information

2. Two binary operations (addition, denoted + and multiplication, denoted

2. Two binary operations (addition, denoted + and multiplication, denoted Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between

More information

Number Theory Math 420 Silverman Exam #1 February 27, 2018

Number Theory Math 420 Silverman Exam #1 February 27, 2018 Name: Number Theory Math 420 Silverman Exam #1 February 27, 2018 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name neatly at the top of this page. Write your final answer

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In N we can do addition, but in order to do subtraction we need to extend N to the integers Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend

More information