# 1 Die hard, once and for all

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 ENGG 2440A: Discrete Mathematics for Engineers Lecture 4 The Chinese University of Hong Kong, Fall and 7 October 2014 Number theory is the branch of mathematics that studies properties of the integers. It is full of conjectures (propositions that have not been proven and have not been refuted) that are very simple to state, but extremely difficult to resolve. We ll stick to a lighter side of number theory that gives us a nice playground to exercise the concepts we just learned logic, proofs, induction, invariants. We ll also see how this concepts help us figure out correctness and termination of algorithms. 1 Die hard, once and for all You are standing next to a water source. You have two empty jugs: A 3 litre jug and a 5 litre jug with no marks on them. You must fill the larger jug with precisely 4 litres of water. Can you do it? This scenario is straight out of the 1995 classic Die Hard 3: With a Vengeance featuring Bruce Willis and Samuel L. Jackson. Should they fail to complete this task within 5 minutes, a bomb goes off and New York City is obliterated. In the nick of time, Bruce and Samuel come up with a solution: small jug large jug action fill up large jug from source 5l fill up small jug from large jug 3l 2l empty small jug 2l pour large jug contents into small jug 2l fill up large jug from source 2l 5l fill up small jug from large jug 3l 4l done! Rumour is that in the sequels, Bruce and Samuel will be asked to measure always 4 litres with a 21 litre and a 26 litre jug; with an 899 litre and 1,147 litre jug; and finally, in the last movie of the series, Die once and for all, with a 3 litre and 6 litre jug. What should they do? To help them out, let us first come up with a mathematical model of their problem. The water jug problem. Let a, b be two positive integers with and v be another positive integer. Given two initially empty jugs jug A and jug B with capacities a litres and b litres, respectively, and an infinite source of water, does there exist a sequence of pouring steps so that one of the jugs ends up with v litres of water? To be precise, let us clearly specify the rules for pouring water: Rules for pouring water. We are allowed to perform the following steps: 1. Empty out a jug: The emptied out jug now contains 0 litres. The contents of the other jug stay the same. 1

2 2 2. Fill up a jug from the source: The filled up jug now contains as much water as its capacity. The contents of the other jug stay the same. 3. Transfer water between jugs: Water can be poured from jug X into jug Y until jug Y is full or jug X is empty. Greatest common divisors and integer combinations Let a, b be two integers. We say a divides b if ak = b for some integer k. For example, 2 divides 4 and 6 but 2 does not divide 5; 4 does not divide 2; and every number divides zero. The greatest common divisor (GCD) of two integers a, b is the largest integer k so that k divides a and k divides b. We write gcd(a, b) for the GCD of a and b. For example, gcd(2, 6) = 2, gcd(4, 6) = 2, gcd(3, 5) = 1. A number c is an integer combination of a and b if there exist integers s and t such that c = s a+t b. For example, 2 is an integer combination of 2 and 6 because 2 = is an integer combination of 4 and 6 because 2 = ( 1) is an integer combination of 3 and 5 because 1 = ( 1) 5. It looks like GCDs and integer combinations are closely related. This is not an accident. Lemma 1. For all integers a and b, gcd(a, b) divides every integer combination of a and b. Proof. Let c be an integer combination of a and b. Then we can write c = s a + t b (1) for some integers a and b. Since gcd(a, b) divides a, we can write a = a gcd(a, b) for some integer a. Since gcd(a, b) divides b, we can write b = b gcd(a, b) for some integer b. Substituting into (1) this gives c = s a gcd(a, b) + t b gcd(a, b) = (sa + tb ) gcd(a, b). Therefore c is a multiple of gcd(a, b). An invariant We can now state an invariant about the die hard problem: Lemma 2. The amount of water in each jug is always an integer combination of a and b.

3 3 Proof. We prove this lemma by induction on the number of pourings n. Base case n = 0: Initially, each jug has 0 liters of water and 0 = 0 a + 0 b. Inductive step: Assume the amount of water in each jug is an integer combination of a and b after n pourings. Specifically, assume jug A has x = s 1 a + t 1 b liters and jug B has y = s 2 a + t 2 b litres. We consider cases depending on the action taken in the (n + 1)st pouring: Case 1. One of the jugs is emptied: Then the emptied jug has 0 litres and the other one has the same amount of water it had before. They are both integer combinations of a and b. Case 2. One of the jugs is filled up from the source. We consider two subcases: If jug A is filled up from the source, then jug A has a litres and a = 1 a + 0 b. The contents of jug B don t change, so their contents are both linear combinations of a and b. If jug B is filled up from the source, the argument is analogous. 1 Case 3. Water is poured from one jug into the other. We consider four subcases: Water is poured from A to B and A becomes empty. Then B will have x + y litres of water and x + y = (s 1 + s 2 )a + (t 1 + t 2 )b, which is an integer combination of a and b. Water is poured from A to B and B becomes full. Then A will have x + (b y) litres of water remaining and x+(b y) = (s 1 s 2 )a+(t 1 t 2 +1)b, which is a linear combination of a and b. Water is poured from B to A. The argument is analogous to the previous two cases. It follows that in all cases, the amount of water in each jug is an integer combination of a and b after n + 1 pourings. Now from Lemma 14 and Lemma 1, we can obtain a useful corollary: Corollary 3. gcd(a, b) always divides the amount of water in each jug. In particular, if we have a 3 litre jug and a 6 litre jug, we can never end up with 4 litres of water: Corollary 4. In Die once and for all, Bruce dies. 2 Euclid s algorithm Euclid s algorithm is a procedure for calculating the GCD of two positive integers. It was invented by the Euclideans around 3,000 years ago and it still the best known procedure for calculating GCDs. To explain Euclid s algorithm, we need to recall division with remainder. Theorem 5. Let n and d be integers with d > 0. There exists unique integers q and r such that n = q d + r and 0 r < d. 1 Analogous means that it follows by the exact same logic as the previous case by a change of notation. Writing it out and reading through it is tedious, but you should be comfortable doing this if the need arose.

4 4 For example, if n = 13 and d = 3, we can write 13 = Moreover, q = 4 and r = 1 are unique assuming r is in the range 0 r < d. The number q can be calculated using the usual division rule you learn in school (stopping at the decimal point). The number r is the remainder you obtain after you subtract qd from n. Proof. First, we show existence: Let q be the largest integer such that qd n. (q + 1)d > n. Then 0 n qd < d. Set r = n qd. That means Now we show uniqueness: Suppose we can write n in the desired form in two different ways: n = qd + r, 0 r < d n = q d + r, 0 r < d. Then qd + r = q d + r, so (q q )d = r r. Therefore r r divides d. Since 0 r, r < d we must have d < r r < d. The only number in this range that divides d is zero, so r r = 0 and q q = 0. It follows that q = q and r = r, so the two representations are the same. Euclid s algorithm is a recursive algorithm for calculating the GCD of positive integers. Euclid s algorithm E(n, d), where n, d are integers such that n > d 0. If d = 0, return n. Otherwise, write n = qd + r where 0 r < d. Return E(d, r). Let s apply Euclid s algorithm to calculate the GCD of 1147 and 899: E(1147, 899) = E(899, 248) because 1147 = = E(248, 155) because 899 = = E(155, 93) because 248 = = E(93, 62) because 155 = = E(62, 31) because 155 = = E(31, 0) because 62 = = 31. How can we be sure that Euclid s algorithm indeed outputs the GCD of n and d? How can we even be sure that Euclid s algorithm terminates? This is a theorem that we will have to prove: Theorem 6. For every pair of integers n, d such that n > d 0, E(n, d) terminates and outputs gcd(n, d). To prove this theorem, we ll need a little lemma. Lemma 7. For all integers a, b, and t, gcd(a, b) = gcd(a + tb, b).

5 5 Proof of Theorem 11. We will prove the theorem by strong induction on d. Base case: When d = 0, the algorithm returns n = gcd(n, 0) and terminates. Inductive step: Now assume the algorithm terminates and outputs gcd(n, d ) for all input pairs (n, d ), where n > d and 0 d d. Consider what the algorithm does on input (n, d+1): It writes n = q(d+1)+r with 0 r < d+1 and returns E(d+1, r). By our inductive assumption, E(d+1, r) must terminate since r is between 0 and d and E(d+1, r) outputs gcd(r, d+1). Therefore, E(n, d+1) must terminate as well. Moreover, E(n, d + 1) outputs gcd(r, d + 1) = gcd(n q(d + 1), d + 1). By Lemma 7, this number equals gcd(n, d + 1). Proof of Lemma 7. We will show that, for every integer k, k divides a and b if and only if k divides a+tb and b. In particular, this means that the largest divisors of the two pairs of numbers namely, their GCDs must be equal. First, assume k divides both a and b. Then we can write a = a k and b = b k for integers a, b. We get that a + tb = (a + tb )k, so k also divides a + tb. For the other direction, assume k divides both a + tb and b and write a + tb = a k and b = b k for integers a, b. Then a = a k tb k = (a tb )k, so k also divides a. 3 How to solve any water jug problem Corollary 3 is sufficient condition for Bruce to die: If gcd(a, b) is not 1, 2, or 4, then Bruce dies. This happens in the 3 litre + 6 litre scenario, as well as the 1147 litre litre one. What if we have a 21 litre and a 26 litre jug? The GCD of 21 and 26 is 1, so Corollary 3 does not rule out the possibility that Bruce may survive. But can he, actually, survive? The key to survival is the following converse to Lemma 1. Lemma 8. Let a, b be any two nonnegative 2 integers. Then gcd(a, b) can be written as an integer combination of a and b. Corollary 9. Let a, b be any two positive integers. Then there exist nonnegative integers s and t such that gcd(a, b) = s a t b. Proof. By Lemma 8, there exist integers s and t such that gcd(a, b) = s a + t b. Then for every integer k, (s + kb) a + (t ka) b = sa + tb = gcd(a, b). No matter what the values of s and t are, when k is sufficiently large, s + kb is positive and t ka is negative. This gives us a representation of gcd(a, b) of the desired form. For example, if a = 21 and b = 26, then gcd(21, 26) = 1 and we can write 1 = The assumption that the integers are nonnegative is not important; in fact, it is not necessary, but we will make it because it makes the arguments a bit simpler.

6 6 Multiplying both sides by 4, we get 4 = Now here is how Bruce can handle a 21 litre and a 26 litre jug: Keep filling up the 21 litre jug for a total of 20 times. Whenever it becomes full, pour all the water into the 26 litre jug. If that one becomes full, empty it out and continue pouring into it. At the end, the 26 litre jug will contain exactly 4 litres. Here is why: We poured a total of litres from the source, and some multiple of 26 litres out of the larger jug, so the amount of water left in the larger jug is of the form 4 = t 26. Let s see what these numbers look like: t t So there must be 4 liters left in the 26 liter jug: This is the only number in the list which is within the capacity of the jug! We can now specify the exact conditions under which the water jug problem has a solution: Theorem 10. Assume a, b, v are positive integers and a b. The water jug problem with jugs of capacity a and b and target v has a solution if and only if gcd(a, b) divides v and 0 v b. Proof. Assume the water jug problem has a solution. By Corollary 3, gcd(a, b) must divide v. Clearly v must also be within the size of the larger bin. Now assume v is a multiple of gcd(a, b) and 0 v b. The cases v = 0 and v = b are easy, so from here on we ll assume 0 < v < b. By Corollary 9 we can write gcd(a, b) = sa tb for some nonnegative integers s, t. Since v divides gcd(a, b), we can write v = kgcd(a, b) for some k and v = (ks)a (kt)b. To obtain v litres, we proceed like this: Keep filling jug A for a total of ks times. Whenever it becomes full, pour all the water into jug B. If that one becomes full, empty it out and continue pouring into it. Suppose jug B was emptied a total of t times. Then the amount of water left inside jug B in the end is (ks)a t b = (ks)a (kt)b + (kt t )b = v + (kt t )b If kt t < 0, this number is negative; if kt t > 0, then it is larger than b. In either case, this is not a valid amount of water to be left in jug B. It must be that kt t = 0 and there are exactly v litres left in jug B. In fact, we do not need to fill jug A exactly ks times; we can interrupt the procedure as soon as we get 4 litres into jug B. I wrote a program that implements this strategy. You can play with it.

7 7 We are almost done all that remains is to prove Lemma 8. This follows by analysing an extension of Euclid s algorithm, which you will do in the homework. The purpose of the extended Euclid s algorithm is exactly to compute the numbers s and t from Lemma 8. Extended Euclid s algorithm X(n, d), where n, d are integers such that n > d 0. If d = 0, return (1, 0). Otherwise, Write n = qd + r where 0 r < d. Calculate (s, t) = X(d, r). Return (t, s q t). Lemma 8 is now a consequence of the following Theorem: Theorem 11. For every pair of integers n, d such that n > d 0, X(n, d) terminates and outputs a pair of integers (s, t) such that s a + t b = gcd(a, b). 4 Prime numbers I am sure you already know quite a bit about prime numbers, so let me just state two useful facts. If you want to read the proofs, you can find them in the textbook. Lemma 12. If p is a prime and p divides a b, then p divides a or p divides b. Theorem 13 (Fundamental theorem of arithmetic). Every positive integer n can be written uniquely as a product of primes. For example, 15 = 3 5, 8 = 2 2 2, 12 = 2 2 3, and 17 = Modular arithmetic Let s fix an integer p, which we will call the modulus. Theorem 5 says that for every integer n there exists a unique integer between 0 and p 1 such that n = qp + r for some q. We call r the remainder of n modulo p in short n modulo p and we write r = n mod p. We can do arithmetic using the numbers 0, 1,..., p 1: additions, subtractions, multiplications, divisions. The arithmetic remains valid as long as we take the remainders of all expressions modulo p. Taking remainders all the time is tedious so instead we ll take advantage of the concept of congruence: Two integers m and n are congruent modulo p if p divides m n. We write m n (mod p) for m and n are congruent modulo p. Congruences behave nicely with respect to additions and multiplications: If x x (mod p) and y y (mod p), then x + x y + y (mod p) and x x y y (mod p).

8 8 Addition and subtraction Addition and subtraction modulo p is fairly easy: For example, if I want to calculate modulo 9 first I add 3 and 8 as integers to get 11 then I take the remainder of 11 modulo 9 to get 2: (3 + 8) mod 9 = 11 mod 9 = 2. The additive inverse of a modulo p is the number ( a) mod p. Say the modulus is 5. Then the additive inverse of 0 is 0, the additive inverse of 1 is 4, the additive inverse of 2 is 3, and vice versa. Subtraction can then be done by replacing each negative number with its additive inverse. (3 7) mod 8 = (3 + 1) mod 8 = 4 mod 8 = 4. Multiplication and division From here on we will assume that the modulus p is a prime number. (If it isn t, some of the following statements won t be true.) Just like addition, to multiply two numbers modulo p, first we multiply them as integers and then we take the remainder modulo p, for example 3 4 mod 7 = 12 mod 7 = 5. What about division? First, let s show how to calculate multiplicative inverses, namely ratios of the form 1/x. This is more commonly written as x 1. Division by zero is forbidden, but otherwise we have a nice lemma: Lemma 14. For every x between 1 and p 1 there exists a unique y between 1 and p 1 such that xy 1 (mod p). Proof. First we show existence of y. Take any x between 1 and p 1. Since p is prime, gcd(x, p) = 1. By Lemma 8 there exist integers s, t for which s x + t p = 1. Taking both sides modulo p, we get that s x 1 (mod p). Take y = s mod p. Then y x s x (mod p), so y x 1 (mod p). Now we show uniqueness. We just saw that for every x between 1 and p 1 there is at least one y in the same range such that xy 1 (mod p). Now we show there is at most one such y. Suppose xy 1 (mod p) and xy 1 (mod p). Then x(y y ) 0 (mod p), so p divides x(y y ). By Lemma 12, p divides x or p divides y y. Since x < p, p must divide y y. But y y is a number between (p 2) and p 2, so this is only possible if y = y, namely y y = 0. The proof of Lemma 14 not only tells us that x 1 exists, but also how to calculate it: First, use the Extended Euclid s algorithm to find s and t such that s x + t p = 1. Then output s mod p. For example, to get the multiplicative inverse of 11 modulo 17, I run X(11, 17) to get ( 3, 2), namely ( 3) = 1. Therefore 11 1 mod 17 = 3 mod 17 = 14. To divide two numbers, we first take the multiplicative inverse of the denominator, then multiply by the numerator, for instance to divide 3 by 11 modulo 17 we calculate mod 17 = 3 14 mod 17 = 42 mod 17 = 8.

9 9 References This lecture is based on Chapter 4 of the text Mathematics for Computer Science by E. Lehman, T. Leighton, and A. Meyer.

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

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

### Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

### 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

### Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### 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

### 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

### 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

### CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010

CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010 1. Greatest common divisor Suppose a, b are two integers. If another integer d satisfies d a, d b, we call d a common divisor of a, b. Notice that as

### Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices. A Biswas, IT, BESU SHIBPUR

Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices A Biswas, IT, BESU SHIBPUR McGraw-Hill The McGraw-Hill Companies, Inc., 2000 Set of Integers The set of integers, denoted by Z,

### 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

### 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

### Section 4.2: The Division Algorithm and Greatest Common Divisors

Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948

### 3. Applications of Number Theory

3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a

### 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

### 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

### 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

### Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may

Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition

### Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

### 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

### Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

### Discrete Mathematics, Chapter 4: Number Theory and Cryptography

Discrete Mathematics, Chapter 4: Number Theory and Cryptography Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 4 1 / 35 Outline 1 Divisibility

### Definition 1 Let a and b be positive integers. A linear combination of a and b is any number n = ax + by, (1) where x and y are whole numbers.

Greatest Common Divisors and Linear Combinations Let a and b be positive integers The greatest common divisor of a and b ( gcd(a, b) ) has a close and very useful connection to things called linear combinations

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

### Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00

18.781 Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list

### 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

### Handout NUMBER THEORY

Handout of NUMBER THEORY by Kus Prihantoso Krisnawan MATHEMATICS DEPARTMENT FACULTY OF MATHEMATICS AND NATURAL SCIENCES YOGYAKARTA STATE UNIVERSITY 2012 Contents Contents i 1 Some Preliminary Considerations

### a = bq + r where 0 r < b.

Lecture 5: Euclid s algorithm Introduction The fundamental arithmetic operations are addition, subtraction, multiplication and division. But there is a fifth operation which I would argue is just as fundamental

### An Example of a Numerical Calculation Class - Rational Numbers

An Example of a Numerical Calculation Class - Rational Numbers Because a rational number is determined by the integer numerator and integer denominator, we defined our data structure for a rational number

### 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

### Introduction to Diophantine Equations

Introduction to Diophantine Equations Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles September, 2006 Abstract In this article we will only touch on a few tiny parts of the field

### Stupid Divisibility Tricks

Stupid Divisibility Tricks 101 Ways to Stupefy Your Friends Appeared in Math Horizons November, 2006 Marc Renault Shippensburg University Mathematics Department 1871 Old Main Road Shippensburg, PA 17013

### Fractions and Decimals

Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first

### Factoring & Primality

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

### 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

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

### 12 Greatest Common Divisors. The Euclidean Algorithm

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 12 Greatest Common Divisors. The Euclidean Algorithm As mentioned at the end of the previous section, we would like to

### COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012

Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about

### Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

### Computing exponents modulo a number: Repeated squaring

Computing exponents modulo a number: Repeated squaring How do you compute (1415) 13 mod 2537 = 2182 using just a calculator? Or how do you check that 2 340 mod 341 = 1? You can do this using the method

### 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

### Number Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures

Number Theory Hungarian Style Cameron Byerley s interpretation of Csaba Szabó s lectures August 20, 2005 2 0.1 introduction Number theory is a beautiful subject and even cooler when you learn about it

### WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

### GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!

GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!!! Challenge Problem 2 (Mastermind) due Fri. 9/26 Find a fourth guess whose scoring will allow you to determine the secret code (repetitions are

### Elementary Number Theory

Elementary Number Theory A revision by Jim Hefferon, St Michael s College, 2003-Dec of notes by W. Edwin Clark, University of South Florida, 2002-Dec L A TEX source compiled on January 5, 2004 by Jim Hefferon,

### Settling a Question about Pythagorean Triples

Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:

### CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

### SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

### The Euclidean Algorithm

The Euclidean Algorithm A METHOD FOR FINDING THE GREATEST COMMON DIVISOR FOR TWO LARGE NUMBERS To be successful using this method you have got to know how to divide. If this is something that you have

### The Chinese Remainder Theorem

The Chinese Remainder Theorem Evan Chen evanchen@mit.edu February 3, 2015 The Chinese Remainder Theorem is a theorem only in that it is useful and requires proof. When you ask a capable 15-year-old why

### 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,

### 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)

### V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography

V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography 3 Congruence Congruences are an important and useful tool for the study of divisibility. As we shall see, they are also critical

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

### 11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

### Public Key Cryptography: RSA and Lots of Number Theory

Public Key Cryptography: RSA and Lots of Number Theory Public vs. Private-Key Cryptography We have just discussed traditional symmetric cryptography: Uses a single key shared between sender and receiver

### 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

### DIVISIBILITY AND GREATEST COMMON DIVISORS

DIVISIBILITY AND GREATEST COMMON DIVISORS KEITH CONRAD 1 Introduction We will begin with a review of divisibility among integers, mostly to set some notation and to indicate its properties Then we will

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

### Factoring Algorithms

Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors

### PYTHAGOREAN TRIPLES PETE L. CLARK

PYTHAGOREAN TRIPLES PETE L. CLARK 1. Parameterization of Pythagorean Triples 1.1. Introduction to Pythagorean triples. By a Pythagorean triple we mean an ordered triple (x, y, z) Z 3 such that x + y =

### 3.4 Complex Zeros and the Fundamental Theorem of Algebra

86 Polynomial Functions.4 Complex Zeros and the Fundamental Theorem of Algebra In Section., we were focused on finding the real zeros of a polynomial function. In this section, we expand our horizons and

### Reading 13 : Finite State Automata and Regular Expressions

CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

### 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

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

### MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions

### MATH 537 (Number Theory) FALL 2016 TENTATIVE SYLLABUS

MATH 537 (Number Theory) FALL 2016 TENTATIVE SYLLABUS Class Meetings: MW 2:00-3:15 pm in Physics 144, September 7 to December 14 [Thanksgiving break November 23 27; final exam December 21] Instructor:

### Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system

CHAPTER Number Theory FIGURE FIGURE FIGURE Plus hours Plus hours Plus hours + = + = + = FIGURE. Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter described a mathematical

### We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### An Innocent Investigation

An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number

### Integers, Division, and Divisibility

Number Theory Notes (v. 4.23 October 31, 2002) 1 Number Theory is the branch of mathematics that deals with integers and their properties, especially properties relating to arithmetic operations like addition,

### PROBLEM SET 6: POLYNOMIALS

PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other

### = 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

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS 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 the identity, such that (i) the

### 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

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### The Teacher s Circle Number Theory, Part 1 Joshua Zucker, August 14, 2006

The Teacher s Circle Number Theory, Part 1 Joshua Zucker, August 14, 2006 joshua.zucker@stanfordalumni.org [A few words about MathCounts and its web site http://mathcounts.org at some point.] Number theory

### (x + a) n = x n + a Z n [x]. Proof. If n is prime then the map

22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find

### The Division Algorithm for Polynomials Handout Monday March 5, 2012

The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,

### 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

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

### Primes in Sequences. Lee 1. By: Jae Young Lee. Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov

Lee 1 Primes in Sequences By: Jae Young Lee Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov Lee 2 Jae Young Lee MA341 Number Theory PRIMES IN SEQUENCES

### Chapter 11 Number Theory

Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications

### Number Theory: A Mathemythical Approach. Student Resources. Printed Version

Number Theory: A Mathemythical Approach Student Resources Printed Version ii Contents 1 Appendix 1 2 Hints to Problems 3 Chapter 1 Hints......................................... 3 Chapter 2 Hints.........................................

### 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

### COMPASS Numerical Skills/Pre-Algebra Preparation Guide. Introduction Operations with Integers Absolute Value of Numbers 13

COMPASS Numerical Skills/Pre-Algebra Preparation Guide Please note that the guide is for reference only and that it does not represent an exact match with the assessment content. The Assessment Centre

### 9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role

### Subsets of Euclidean domains possessing a unique division algorithm

Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

### Intermediate Math Circles March 7, 2012 Linear Diophantine Equations II

Intermediate Math Circles March 7, 2012 Linear Diophantine Equations II Last week: How to find one solution to a linear Diophantine equation This week: How to find all solutions to a linear Diophantine

### THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0

THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0 RICHARD J. MATHAR Abstract. We count solutions to the Ramanujan-Nagell equation 2 y +n = x 2 for fixed positive n. The computational

### Binary Number System. 16. Binary Numbers. Base 10 digits: 0 1 2 3 4 5 6 7 8 9. Base 2 digits: 0 1

Binary Number System 1 Base 10 digits: 0 1 2 3 4 5 6 7 8 9 Base 2 digits: 0 1 Recall that in base 10, the digits of a number are just coefficients of powers of the base (10): 417 = 4 * 10 2 + 1 * 10 1

### Click on the links below to jump directly to the relevant section

Click on the links below to jump directly to the relevant section Basic review Writing fractions in simplest form Comparing fractions Converting between Improper fractions and whole/mixed numbers Operations

### Integers and division

CS 441 Discrete Mathematics for CS Lecture 12 Integers and division Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Symmetric matrix Definition: A square matrix A is called symmetric if A = A T.