# MATH 289 PROBLEM SET 4: NUMBER THEORY

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 n and m, then d also divides n + m and n m and an + bm for all integers a, b. Theorem 1. If n and m are integers and m 0, then there exists an integer q such that where 0 r < m. n = qm + r Proof. First reduce to the case that n 0. Then use induction on n. (Exercise.) A useful variation is the following result. Theorem 2. If n and m are integers and m 0, then there exists an integer q such that where m /2 r < m /2. n = qm + r Suppose that n and m are integers, not both equal to 0. The greatest common divisor of n and m is the largest positive integer d such that d divides both n and m. We denote the greatest common divisor of n and m by gcd(n, m). We will also use the convention that gcd(0, 0) = 0. The following observation will be useful. Lemma 3. If n, m, q Z, then We have gcd(n, m) = gcd(m, n qm). Proof. The case n = m = 0 is clear. Assume that at least one of n and m is nonzero. Now gcd(n, m) divides n, m and n qm, hence gcd(n, m) gcd(m, n qm). On the other hand, gcd(m, n qm) divides m, n qm and n = (n qm) + qm. so gcd(m, n qm) gcd(n, m). Example 4. Suppose we have two large integers, say 9081 and How do we find their greatest common divisor? We do division with remainder: (1) 9081 = Now gcd(9081, 3270) = gcd(3270, 729). We have simplified our problem! Now we can play this game again: (2) 3270 =

2 so gcd(3270, 729) = gcd(729, 354). (3) 729 = so gcd(729, 354) = gcd(354, 21). (4) 354 = so gcd(354, 21) = gcd(21, 3) = 3 because 21 = 7 3. We have found that gcd(9081, 3270) = 3. This method of computing the gcd is called Euclid s algorithm. Algorithm 5 (Euclid s Algorithm). Suppose that r 0, r 1 Z are nonzero integers. Define q 1, q 2, Z and r 2, r 3, Z inductively as follows. If r i 1 and r i are already defined, then we define q i and r i+1 by r i 1 = q i r i + r i+1 where 0 r i+1 < r i as in Theorem 1 (or r i /2 r i+1 < r i /2 as in Theorem 2). (Note r i+1 and q i are well defined as long as r i 0). Since r 1 > r 2 > we have that r +1 = 0 for some positive integer. Suppose that r +1 = 0 and that r i 0 for i. Then gcd(r 0, r 1 ) = r. If one uses Theorem 2 then it is clear that Euclid s algorithm is very fast. The number of divisions with remainder one has to do is roughly log 2 r 1. (A similar bound also holds if one uses Theorem 1 though). Proof. It is not hard to show that Euclid s algorithm wors. Note that gcd(r i 1, r i ) = gcd(r i, r i+1 ) for all i. By induction on i one shows that gcd(r 0, r 1 ) = gcd(r i, r i+1 ) for all i. In particular, gcd(r 0, r 1 ) = gcd(r, r +1 ) = gcd(r, 0) = r. Example 6. Euclid s algorithm can be used to find integers x and y such that gcd(n, m) = xn + ym. It wors as follows. First use Euclid s algorithm to compute gcd(n, m) and then wor bac. For example, we already saw that gcd(9081, 3270) = 3. We would lie to find x and y such that 3 = 9081x y. Now we wor bac in the computation of gcd(9081, 3270). From (4) follows that From (3) follows that 3 = ( 1) = ( 1) ( ) = ( ) 354 = From (2) follows that 3 = ( ) = = ( ) 729 =

3 and finally, from (1) follows that 3 = ( ) = = ( ) 3270 = This method is sometimes called the extended Euclid s algorithm. Algorithm 7. (Extended Euclid s Algorithm) Let r 0, r 1,...,r, r +1 = 0 and q 0, q 1,..., q as in Algorithm 5. Define x = 0 and x +1 = 1. For i 1, define x i by induction by x i 1 = x i+1 q i x i. Then we have that gcd(r 0, r 1 ) = x i+1 r i + x i r i+1 for i = 0, 1,...,. In particular, gcd(r 0, r 1 ) = x 1 r 0 + x 0 r 1. Proof. Let i = j. We prove by induction on j that For j = 0 we have to prove that gcd(r 0, r 1 ) = x j+1 r j + x j r j+1. gcd(r 0, r 1 ) = 1 r + 0 r +1 = r but this follows from Algorithm 5. Suppose that gcd(r 0, r 1 ) = x j+1 r j + x j r j+1. If we substitute, r j+1 = r j 1 q j r j we obtain gcd(r 0, r 1 ) = x j+1 r j + x j (r j 1 q j r j ) = = x j r j 1 + (x j+1 q j x j )r j = x j r j 1 + x j 1 r j. Theorem 8. Suppose that n and m are integers. There exist integers x and y such that gcd(n, m) = xn + ym. Proof. This follows from the extended Euclid s Algorithm (Algorithm 7). If n and m are integers with gcd(n, m) then we say that m and n are relatively prime. Corollary 9. If a, n, m are integers and a divides both n and m then a also divides gcd(n, m). Proof. This follows immediately from the previous Theorem 8. Example 10 (Putnam 2000). Prove that the expression ( ) gcd(m, n) n n m is an integer. 3

4 Given our previous discussion, it seems natural to write gcd(m, n) = xm + yn where x, y are integers. The solution then follows quicly. Proof. We can write gcd(m, n) = xm + yn where x, y Z. Then Now ( ) m n = m n m n is an integer. It follows that is an integer. gcd(m, n) n ( ) n = x m ( ) n + y m m n ( ) n. m n! m!(n m)! = (n 1)! (m 1)!(n m)! = gcd(m, n) n ( ) n m ( ) n 1 m Lemma 11. Suppose that n, m, r are integers such that gcd(m, n) = 1. If m divides nr then m divides r. Proof. We can write 1 = xm + yn for certain x, y Z. Clearly m divides xmr and ynr, so m divides r = r 1 = r (xm + yn) = xmr + ynr. If n and m are nonzero integers then the least common multiple lcm(m, n) of n and m is defined as the smallest positive integer that is divisible by both m and n. Moreover we define lcm(m, 0) = 0 for all integers m. Lemma 12. If n and m are positive integers and a is an integer divisible by both n and m, then a is divible by lcm(m, n). Proof. We can write a = q lcm(m, n) + r with 0 r < lcm(m, n). NOw r is also divisible by m and n. We must have that r = 0 otherwise we get a contradiction with the definition of lcm(m, n). This proves that a is divisible by lcm(m, n). Lemma 13. If n and m are positive integers then gcd(m, n) lcm(m, n) = mn Proof. The positive integer mn/ gcd(m, n) is divisible by m and n, so mn lcm(m, n). gcd(m, n) The positive integer mn/ lcm(m, n) divides both m and n.so we have mn gcd(m, n). lcm(m, n) 4

5 Example 14. In the strange country Oz, the only official coins are the 7-cents coin and the 13-cents coin. What is the largest amount that cannot be paid with these coins if a shop has no change at all? We can first mae a list of amounts that we can mae: 7, 13, 14, 20, 21, 26, 27, 28, 33, 34,35, 39, 40, 41,42, 46, 48, 48,49, 52, 53, 54,55, 56, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70,72, 73, 74, 75,76, 77, 78, 79,... The largest amount that cannot be made seems to be 71. It is easy to chec that 71 is not a nonnegative combination of 7 and 13. Let us try to understand why all the amounts of 72 can be made by using the two types of coins. Suppose that m 72. We would lie to find nonnegative integers x and y such that m = 13x + 7y If x and y are not necessarily nonnegative then this is certainly possible. We can write and 1 = 13 ( 1) m = 13 ( m) + 7 2m. Using this solution we find many other solutions. If is an integer then m = 13 ( m + 7) + 7 (2m 13). For a suitable, we might have that both m+7 and 2m 13 are nonnegative. Consider the smallest for which m + 7 is nonnegative. Then we have 0 m + 7 < 7. Now 7 (2m 13) m 13 ( m + 7) = 6. It follows that 2m 13 > 1, so 2m 13 is nonnegative. Now we would lie to prove that if (5) 71 = 13x + 7y with x, y Z, then at least one of the integers x, y is negative. We already saw one solution, namely (6) 71 = 13 ( 71) + 7 (142). Combining (5) and (6) yields: 13 (x + 71) = 7 (142 y). Since gcd(13, 7) = 1, we have that 7 divides x Say x + 71 = 7. Then we alsy have that 142 y = 13. From x + 71 = 7 and x 0 follows that 11. But then y =

6 2. Prime Numbers Recall that a prime number is a positive integer with exactly 2 positive divisors, namely 1 and itself. Lemma 15. If p is a prime number dividing mn where m and n are integers, then p divides m or p divides n. Proof. If p divides m then were are done. Otherwise gcd(p, m) = 1, so p divides n by Lemma 11. Theorem 16. (Euclid) Every positive integer can uniquely be written as a product of prime numbers. Proof. We already have seen in problem set 1 that every positive integer is a product of prime numbers. We still have to prove the uniqueness. Suppose that p 1 < p 2 < < p are distinct prime numbers such that Suppose that a 1 > b 1. Then p a 1 1 p a 2 = pb 1 1 p b 2. p a 1 b 1 1 p a 2 = pb 2 and p 1 divides p b 2. This implies that p 1 divides p i for some i 2. This is impossible because the only divisors of p i are 1 and p i itself. Constradiction. Therefore a 1 b 1. Similarly we see that a 1 b 1 and therefore a 1 = b 1. Similarly we can prove that a i = b i for i = 2, 3,.... Many properties can be expressed in terms of the prime factorization. Suppose that A = p a 1 1 p a 2 and B = p b 1 1 p b 2 2 p b are positive integers with their factorizations into prime numbers. Then A divides B if and only if a i b i for all i = 1, 2,...,. We also have that where c i = min(a i, b i ) for all i. gcd(a, B) = p c 1 1 pc 2 2 pc Theorem 17. (Euclid) There are infinitely many prime numbers. Proof. Suppose that there are finitely many distinct prime numbers, say p 1, p 2,...,p. Let N = p 1 p 2 p + 1. Now N is a product of prime numbers. In particular there exists a prime numper q such that q divides N. Now q = p i for some i with 1 i. Since p i divides N, we have that p i divides which leads to a contradiction. Example 18. The number 2 is irrational. N p 1 p 2 p = 1 6

7 Proof. Suppose taht 2 is rational, say 2 = p/q where p, q are positive integers. Squaring gives p 2 = 2q 2. The prime number 2 appears an even number of time in the prime factorization of p 2. On the other hand, 2 appears an odd number of times in the prime factorization of 2q 2. Wet get a contradiction, so 2 has to be irrational. The distribution of prime numbers is quite mysterious. One of the most famous/notorious open problems in mathematics is the Riemann Hypothesis. This conjecture is closely related to the distribution of prime numbers. The following result is well-nown but not so elementary: Theorem 19 (Dirichlet). Suppose that a and b are positive integers that are relatively prime. Then there are infinitely prime numbers of the form a + nb where n is a positive integer. 3. Exercises Exercise 1. ** Let F 0, F 1, F 2,... be the Fibonacci numbers: F 0 = F 1 = 1 and F n+1 = F n +F n 1 for all n 1. Prove that the greatest common divisor of two consecutive Fibonnaci numbers is always equal to 1. Exercise 2. *** Define T 0, T 1, T 2,... by T 1 = 2 and T n+1 = T 2 n T n + 1 for n 0. Prove that gcd(t i, T j ) = 1 for all i j. Exercise 3. **** Let m 2 be an integer and suppose that a and b are positive integers. Prove that gcd(m a 1, m b 1) = m gcd(a,b) 1. Exercise 4. ** We have two drining glasses. One glass can contain exactly 21oz. The other glass can contain exactly 13oz. Is it possible to measure exactly 1oz. of water using the two glasses? Exercise 5. ** Suppose that A = p a 1 1 p a 2 is an integer, p 1 < p 2 < < p are distinct primes and a 1,..., a are nonnegative integers. Give a formula for the number of divisors of A. Exercise 6. *** We start with a dec of 52 cards. We put all the cards in one row, face down. In the first round we turn all the cards around. In the second round we turn every second card around. In the third round we turn every third card around. We eep doing this until we complete round 52. Which cards will be faced up in the end? Exercise 7. *** Suppose that P(x) = a n x n +a n 1 x n 1 + +a 0 is a nonconstant polynomial with integer coefficients. Prove that there exists a positive integer m such that P(m) is not a prime number. Exercise 8. ** Show that there are infinitely many prime numbers of the form 4 1 where is a positive integer (without using Dirichlet s Theorem). Exercise 9. * Find all prime numbers p for which p + 2 and p + 4 are also prime numbers. Exercise 10. * Use Euclid s Algorithm to find gcd(1029, 791). 7

8 Exercise 11. **** Suppose that p, q, r are positive integers which gcd(p, q) = gcd(p, r) = gcd(q, r) = 1. Show that if N 3pqr, then any N N floor can be tiled with tiles of sizes p p, q q and r r. Exercise 12. ** Suppose that m and n are positive integers with gcd(m, n) = 1. Show that mn m n is the largest integer that is not of the form mx + ny with x, y 0. Exercise 13. ** Show that if 2 n 1 is a prime number, then n is a prime number. Exercise 14. ** Show that if 2 n + 1 is a prime number, then n = 0 or n is a power of 2. 8

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

### Chapter 6. Number Theory. 6.1 The Division Algorithm

Chapter 6 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,

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

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

### Topics in Number Theory

Chapter 8 Topics in Number Theory 8.1 The Greatest Common Divisor Preview Activity 1 (The Greatest Common Divisor) 1. Explain what it means to say that a nonzero integer m divides an integer n. Recall

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

### 2. Integers and Algorithms Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers

2. INTEGERS AND ALGORITHMS 155 2. Integers and Algorithms 2.1. Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers with a b > 0. (1) Apply the division algorithm: a = bq + r, 0 r < b.

### Prime Numbers. Chapter Primes and Composites

Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are

### Further linear algebra. Chapter I. Integers.

Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides

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

### Elementary Number Theory

Elementary Number Theory Ahto Buldas December 3, 2016 Ahto Buldas Elementary Number Theory December 3, 2016 1 / 1 Division For any m > 0, we define Z m = {0, 1,... m 1} For any n, m Z (m > 0), there are

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

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

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

### Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,

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

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

### b) Find smallest a > 0 such that 2 a 1 (mod 341). Solution: a) Use succesive squarings. We have 85 =

Problem 1. Prove that a b (mod c) if and only if a and b give the same remainders upon division by c. Solution: Let r a, r b be the remainders of a, b upon division by c respectively. Thus a r a (mod c)

### Solutions to Practice Problems

Solutions to Practice Problems March 205. Given n = pq and φ(n = (p (q, we find p and q as the roots of the quadratic equation (x p(x q = x 2 (n φ(n + x + n = 0. The roots are p, q = 2[ n φ(n+ ± (n φ(n+2

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

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

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### 2 The Euclidean algorithm

2 The Euclidean algorithm Do you understand the number 5? 6? 7? At some point our level of comfort with individual numbers goes down as the numbers get large For some it may be at 43, for others, 4 In

### NUMBER THEORY AMIN WITNO

NUMBER THEORY AMIN WITNO ii Number Theory Amin Witno Department of Basic Sciences Philadelphia University JORDAN 19392 Originally written for Math 313 students at Philadelphia University in Jordan, this

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

### Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com

Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).

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

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 5 Modular Arithmetic One way to think of modular arithmetic is that it limits numbers to a predefined range {0,1,...,N

### Practice Problems for First Test

Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers, and we have reason to believe that it is a mystery into which the human mind will never penetrate.-

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

### Continued fractions and good approximations.

Continued fractions and good approximations We will study how to find good approximations for important real life constants A good approximation must be both accurate and easy to use For instance, our

### CS103X: Discrete Structures Homework Assignment 2: Solutions

CS103X: Discrete Structures Homework Assignment 2: Solutions Due February 1, 2008 Exercise 1 (10 Points). Prove or give a counterexample for the following: Use the Fundamental Theorem of Arithmetic to

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

### 1 Die hard, once and for all

ENGG 2440A: Discrete Mathematics for Engineers Lecture 4 The Chinese University of Hong Kong, Fall 2014 6 and 7 October 2014 Number theory is the branch of mathematics that studies properties of the integers.

### Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive

Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime

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

### Algebra for Digital Communication

EPFL - Section de Mathématiques Algebra for Digital Communication Fall semester 2008 Solutions for exercise sheet 1 Exercise 1. i) We will do a proof by contradiction. Suppose 2 a 2 but 2 a. We will obtain

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

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

### Solutions for Practice problems on proofs

Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

### Stanford University Educational Program for Gifted Youth (EPGY) Number Theory. Dana Paquin, Ph.D.

Stanford University Educational Program for Gifted Youth (EPGY) Dana Paquin, Ph.D. paquin@math.stanford.edu Summer 2010 Note: These lecture notes are adapted from the following sources: 1. Ivan Niven,

### 2.2 Inverses and GCDs

2.2. INVERSES AND GCDS 49 2.2 Inverses and GCDs Solutions to Equations and Inverses mod n In the last section we explored multiplication in Z n.wesaw in the special case with n =12and a =4that if we used

### Reading 7 : Program Correctness

CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 7 : Program Correctness 7.1 Program Correctness Showing that a program is correct means that

### Theorem 2. If x Q and y R \ Q, then. (a) x + y R \ Q, and. (b) xy Q.

Math 305 Fall 011 The Density of Q in R The following two theorems tell us what happens when we add and multiply by rational numbers. For the first one, we see that if we add or multiply two rational numbers

### Problem Set 5. AABB = 11k = (10 + 1)k = (10 + 1)XY Z = XY Z0 + XY Z XYZ0 + XYZ AABB

Problem Set 5 1. (a) Four-digit number S = aabb is a square. Find it; (hint: 11 is a factor of S) (b) If n is a sum of two square, so is 2n. (Frank) Solution: (a) Since (A + B) (A + B) = 0, and 11 0, 11

### Proof of Euler s φ (Phi) Function Formula

Rose- Hulman Undergraduate Mathematics Journal Proof of Euler s φ (Phi Function Formula Shashank Chorge a Juan Vargas b Volume 14, no. 2, Fall 2013 Sponsored by Rose-Hulman Institute of Technology Department

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

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

### Mathematical Induction

Mathematical S 0 S 1 S 2 S 3 S 4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! Mathematical S 0 S 1 S 2 S 3 S4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! S 4 Mathematical S 0 S 1 S 2 S 3 S5 S 6 S 7 S 8 S 9 S 10

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

### Chapter Two. Number Theory

Chapter Two Number Theory 2.1 INTRODUCTION Number theory is that area of mathematics dealing with the properties of the integers under the ordinary operations of addition, subtraction, multiplication and

### Instructor: Bobby Kleinberg Lecture Notes, 5 May The Miller-Rabin Randomized Primality Test

Introduction to Algorithms (CS 482) Cornell University Instructor: Bobby Kleinberg Lecture Notes, 5 May 2010 The Miller-Rabin Randomized Primality Test 1 Introduction Primality testing is an important

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

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

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

SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid

### The Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic 1 Introduction: Why this theorem? Why this proof? One of the purposes of this course 1 is to train you in the methods mathematicians use to prove mathematical statements,

### Homework until Test #2

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

### More Mathematical Induction. October 27, 2016

More Mathematical Induction October 7, 016 In these slides... Review of ordinary induction. Remark about exponential and polynomial growth. Example a second proof that P(A) = A. Strong induction. Least

### Integers and Rational Numbers

Chapter 6 Integers and Rational Numbers In this chapter, we will see constructions of the integers and the rational numbers; and we will see that our number system still has gaps (equations we can t solve)

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

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

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

### Solutions to Homework Set 3 (Solutions to Homework Problems from Chapter 2)

Solutions to Homework Set 3 (Solutions to Homework Problems from Chapter 2) Problems from 21 211 Prove that a b (mod n) if and only if a and b leave the same remainder when divided by n Proof Suppose a

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

### Chapter 1 Basic Number Concepts

Draft of September 2014 Chapter 1 Basic Number Concepts 1.1. Introduction No problems in this section. 1.2. Factors and Multiples 1. Determine whether the following numbers are divisible by 3, 9, and 11:

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

### Primality Testing. 1 Brute Force Primality Test. Darren Glass. December 3, 2004

Primality Testing Darren Glass December 3, 2004 Last time we discussed the Fundamental Theorem of Arithmetic, which said that every integer can be factored uniquely into the product of prime numbers. However,

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

### Mathematical induction & Recursion

CS 441 Discrete Mathematics for CS Lecture 15 Mathematical induction & Recursion Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Proofs Basic proof methods: Direct, Indirect, Contradiction, By Cases,

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

### 6.2 Permutations continued

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

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

### Proof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### 10 k + pm pm. 10 n p q = 2n 5 n p 2 a 5 b q = p

Week 7 Summary Lecture 13 Suppose that p and q are integers with gcd(p, q) = 1 (so that the fraction p/q is in its lowest terms) and 0 < p < q (so that 0 < p/q < 1), and suppose that q is not divisible

### ON THE FIBONACCI NUMBERS

ON THE FIBONACCI NUMBERS Prepared by Kei Nakamura The Fibonacci numbers are terms of the sequence defined in a quite simple recursive fashion. However, despite its simplicity, they have some curious properties

### Topics in Number Theory

Chapter 1 Topics in Number Theory We assume familiarity with the number systems. The notion of a number line, which extends from to +, represents the ordering of the real numbers. Among these, the counting

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

New Zealand Mathematical Olympiad Committee Divisibility and Primes Arkadii Slinko 1 Introduction The theory of numbers is devoted to studying the set N = {1, 2, 3, 4, 5, 6,...} of positive integers, also

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

### Course notes on Number Theory

Course notes on Number Theory In Number Theory, we make the decision to work entirely with whole numbers. There are many reasons for this besides just mathematical interest, not the least of which is that

### Lecture 1: Elementary Number Theory

Lecture 1: Elementary Number Theory The integers are the simplest and most fundamental objects in discrete mathematics. All calculations by computers are based on the arithmetical operations with integers

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

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

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

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

MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

### Even Number: An integer n is said to be even if it has the form n = 2k for some integer k. That is, n is even if and only if n divisible by 2.

MATH 337 Proofs Dr. Neal, WKU This entire course requires you to write proper mathematical proofs. All proofs should be written elegantly in a formal mathematical style. Complete sentences of explanation

### PERIMETERS OF PRIMITIVE PYTHAGOREAN TRIANGLES. 1. Introduction

PERIMETERS OF PRIMITIVE PYTHAGOREAN TRIANGLES LINDSEY WITCOSKY ADVISOR: DR. RUSS GORDON Abstract. This paper examines two methods of determining whether a positive integer can correspond to the semiperimeter

### 4. Number Theory (Part 2)

4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.

### 5.1 Text HW Number Theory Math 210 pbf8 1. Illustrate = 34 as in theorem 1.5 [i.e. showing that EVEN + EVEN = EVEN!].

.1 Text HW Number Theory Math 10 pbf8 1. Illustrate 1+18 = 4 as in theorem 1. [i.e. showing that EVEN + EVEN = EVEN!]. 1 18 4 11 48. Illustrate + 449 = 781 as in theorem 1.: EVEN + ODD = ODD 449 781 4a.

### MAT Mathematical Concepts and Applications

MAT.1180 - Mathematical Concepts and Applications Chapter (Aug, 7) Number Theory: Prime and Composite Numbers. The set of Natural numbers, aka, Counting numbers, denoted by N, is N = {1,,, 4,, 6,...} If

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

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

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

### Construction of Composite Numbers by Recursively Exponential Numbers

Construction of Composite Numbers by Recursively Exponential Numbers SZE, Tsz Wo November 23, 2005 1 Introduction In this paper, we give some constructions of composite numbers N, such that every number

### It is time to prove some theorems. There are various strategies for doing

CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it

### Zeros of a Polynomial Function

Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we

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

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

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