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

Save this PDF as:

Size: px
Start display at page:

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

## Transcription

1 Chapter 3 Number Theory 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 if its only positive integer multiplicative factors are 1 and n. Furthermore, every integer can be expressed as a product of primes, and this expression is unique up to the order of the primes in the product. This important insight into the multiplicative structure of the integers has become nown as the fundamental theorem of arithmetic. Beneath the simplicity of the prime numbers lies a sophisticated world of insights and results that has intrigued mathematicians for centuries. By the third century b.c.e., Gree mathematicians had defined prime numbers, as one might expect from their familiarity with the division algorithm. In Boo IX of Elements [73], Euclid gives a proof of the infinitude of primes one of the most elegant proofs in all of mathematics. Just as important as this understanding of prime numbers are the many unsolved questions about primes. For example, the Riemann hypothesis is one of the most famous open questions in all of mathematics. This claim provides an analytic formula for the number of primes less than or equal to any given natural number. A proof of the Riemann hypothesis also has financial rewards. The Clay Mathematics Institute has chosen six open questions (including the Riemann hypothesis) a complete solution of any one would earn a \$1 million prize. Woring toward defining a prime number, we recall an important theorem and definition from section 2.2. Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive integer, then there exist unique integers q Z and r {0, 1,..., n 1} such that m = n q+r.we refer to n as the divisor, q as the quotient, and r as the remainder when m is divided by n. Definition3.1.1 For m, n Z, we say that n divides m when there exists q Z such that m = n q; that is, when the remainder r is 0 as the division algorithm is applied to m and n. In this context, n is called a divisor of m or a factor of m. The consideration of remainders from the division algorithm may bring to mind an important fact from the study of modular equivalence in chapter 2. Recall that n divides m exactly when m mod n = 0. Example3.1.1 We now that 3 divides 36 (or 3 is a factor of 36) because 36 = On the other hand, 3 does not divide 37 (or 3 is not a factor of 37) because 37 = , and so the remainder from the division algorithm is 1 rather than 0. Question Determine if the following statements are true; if not, state the nonzero remainder. (a) 5 divides 15 (c) 8 is a factor of 23 (b) 5 divides 24 (d) 8 is a factor of 32 In addition to determining if one particular integer divides another, mathematicians are often interested in identifying the complete set of all divisors of a given integer. For example, one important aspect of factoring polynomials is an ability to determine

2 160 A Transition to Advanced Mathematics all possible divisors of the constant term. Similarly, divisors play a ey role when determining the elements of a group U(n). Example The positive integer divisors of 90 are 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, and 90. When compiling such lists, we typically consider only positive integer divisors (although certainly the negative of a divisor is also a divisor). It also helpful to notice that most divisors match up in pairs; for example, both 3 and 30 are divisors of 90 = Question3.1.2 List every positive divisor of the integers 98 and 120. We now state the definition of a prime number. Definition3.1.2 An integer p Z is prime when p 2 and the only positive divisors of p are 1 and p itself. When an integer n is not prime, we say that n is nonprime. Recall that nonprimes are also nown as composite numbers. The following examples and questions highlight important examples and properties of these numbers. Example Using the definition of a prime, we observe that 3 is prime because its only divisors are 1 and 3. On the other hand, 4 is not prime because 2 divides 4, and so 1 and 4 are not the only positive divisors of 4. Question Determine if each integer is prime; if not, state the positive integer divisors of the given number. (a) 11 (d) 1 (b) 34 (e) 83 (c) 3 (f) 6 Question3.1.4 How many prime numbers are even? Justify your answer. We often use prime numbers and their properties when woring with integers. One approach to identifying if a given integer is prime is to try to factor it. A significant downside to this approach is its slowness factoring arbitrary integers on the order of 100 digits can require up to 74 years of supercomputer time! As we discuss in the next section, this difficulty in quicly factoring large integers does have a positive side, enabling the security of certain encryption schemes. As an illustration of the relative slowness of this process, the next question ass you to distinguish among the first twenty primes and nonprimes. Question3.1.5 (a) List the first 10 prime numbers. (b) List the first 10 positive integers that are nonprimes.

3 Chapter 3 Number Theory 161 The relationship between primes and nonprimes is expressed by the prime power factorization of integers as described in the fundamental theorem of arithmetic. A statement and proof of this result appear as Proposition 14 in Boo IX of Euclid s Elements [73]. In this text, we state and use the fundamental theorem of arithmetic, leaving its proof for your later studies. Theorem Fundamental theorem of arithmetic Every integer greater than 1 is either a prime or a product of primes; that is, every integer m can be written as m = p n 1 1 pn 2 2 pn where p 1, p 2,..., p Z are prime numbers raised to positive integer powers n 1, n 2,..., n. Furthermore, for a given integer, such a product of powers of primes is unique up to the order of the primes. We refer to such a product as the prime power factorization of the integer m. Similar to the division algorithm, the fundamental theorem of arithmetic maes two distinct claims about every integer greater than one. First, the fundamental theorem of arithmetic is an existence result, guaranteeing that every integer greater than one can be expressed as a product of primes raised to powers. Second, the fundamental theorem of arithmetic is a uniqueness result, ensuring that every integer has exactly one such prime factorization up to order. As we will see, an integer s unique prime factors play a pivotal role in understanding and proving many insights into the properties of integers. Example3.1.4 We give the prime power factorizations of a few integers. 6 = = = = = = Question3.1.6 Find the prime power factorization of each integer. (a) 30 (c) 12 (b) 5 (d) 27 Determining the prime power factorization of a relatively small integer is often straightforward. Number patterns help. For example, even numbers have a factor of two, and multiples of 10 have factors of two and five. Another simple pattern was introduced in section 2.6: if the sum of an integer s digits is divisible by nine, then the integer is divisible by nine (and so has a factor of 3 2 ). If no such pattern is apparent, then a factorization can be obtained by checing each integer up to n to find a divisor (if one exists); actually it is enough to chec for divisibility by every prime number less than or equal to n. On the other hand, for sufficiently large integers, the prime power factorization can be extremely difficult to find. An exhaustive search for factors based on testing every integer (or prime) less than or equal to n can be extraordinarily time consuming and resource intensive. Computer scientists express this complexity by asserting that

4 162 A Transition to Advanced Mathematics factoring integers requires nonpolynomial time computations; although Peter Shor has recently proven that a theoretical quantum computer is capable of polynomial time factorization of integers. The next example illustrates this complexity in producing prime power factorizations. Example3.1.5 We find the prime factorization of the integer 5,473,381,693. Without sophisticated mathematical software, most people would have difficulty finding this integer s prime factorization. The square root of 5,473,381,693 is 73,983 (when rounded up), and so an exhaustive search may have to chec for divisibility by every prime less than or equal to 73,983 which is a lot of dividing! Even the fastest of supercomputers can require a serious investment of time and space resources to factor this (and larger) integers. As it turns out, 5,473,381,693 can be factored by standard computer algebra systems as Interestingly enough, just a single change in the tens digit from 9 to 4 produces 5,473,381,643, which requires much more computer time to verify as prime. When determining a prime power factorization by hand, it is often helpful to use intermediate steps and identify nonprime factors, which can in turn be factored. The following questions highlight the use of such intermediate steps. Question (a) Given that 6 divides 15,444,752,706, identify two primes that divide 15,444,752,706. (b) Given that 6 divides an integer n, identify two primes that divide n. Question Determine the prime power factorization of 28,171,962,000 using direct computations. Hint: No prime greater than 13 divides this integer. Computer algebra systems can be quite helpful when exploring divisibility and woring with prime numbers. The following are useful commands from two widely used computer algebra systems (or CAS). The Maple function isprime(n) determines if n is a prime. The Mathematica function PrimepowerQ[n] determines if n is a power of a single prime. CAS Command Example Maple [> m / n ; [> 54 / 3 [> ifactor(n) ; [> ifactor(54) ; [> isprime(n) ; [> isprime(54) ; Mathematica ]: m / n ]: 54 / 3 ]: PrimeFactorList[n] ]: PrimeFactorList[54] ]: PrimepowerQ[n] ]: PrimepowerQ[54] We now shift attention from detailed computations with specific integers to more abstract, general questions about prime numbers. We now there exist infinitely many positive integers 1, 2, 3,.... But how many of these integers have the property of being

6 164 A Transition to Advanced Mathematics However, the only positive divisor of 1 is 1, while every prime is greater than 1. Thus, none of p 1,..., p n can divide 1. We have obtained the desired contradiction and conclude there exist infinitely many primes. Since Euclid gave his proof of the infinitude of primes, many different and interesting proofs of this result have been given by various mathematicians, including one by the twentieth century Hungarian Paul Erdös. Most of Erdös s wor was in discrete mathematics, particularly number theory and graph theory. In his lifetime, Erdös published more than 1,500 papers with at least 500 different coauthors. He lied to tal, in a jovial way, about The Boo in which God had written a perfect proof for every mathematical theorem. Proofs from THE BOOK [3] is a recently published collection of theorems and proofs based on his suggestions and begins with six different proofs of the infinitude of primes, including Euclid s proof as well as proofs by Goldbach, Euler, and Erdös himself. As you have perhaps surmised from our discussion in this section, there are many questions about prime numbers that remain open. We highlight three examples. The Goldbach conjecture: In a 1742 letter to Leonhard Euler, the Russian mathematician Christian Goldbach conjectured that every even integer greater than two can be written as the sum of two primes. This claim is readily verified for small integers; for example, 4 = 2 + 2, 6 = 3 + 3, 8 = 3 + 5, 10 = 5 + 5, and so on. Despite the best efforts of many professional and amateur mathematicians, so far no proof of this conjecture has been pieced together. With the development of increasingly powerful and sophisticated supercomputers, the Goldbach conjecture has been verified for all even integers up to as of July 14, In addition, a number of partial Goldbach results have been proven, including independent proofs by Niolai Chudaov, Theodor Estermann, and Johannes van der Corput in the 1930s that almost all even numbers are the sum of two primes, as well as Chen Jing-Run s proof in the 1960s that every even number must be the sum of a prime and either a prime or a product of two primes (such a product of two primes is nown as a semiprime). While the Goldbach conjecture is widely believed to be true by mathematicians, evidence and intuition do not carry the same weight as a thorough, logical argument. And so mathematicians continue to see a proof of the Goldbach conjecture in their quest for mathematical truth. The twin primes conjecture: Pairs of prime numbers that differ by two are nown as twin primes. For example, the first four pairs of twin primes are the primes 3 and 5, the primes 5 and 7, the primes 11 and 13, and the primes 17 and 19. The twin primes conjecture asserts that there are infinitely many pairs of twin primes. As with the Goldbach conjecture, the twin primes conjecture is generally believed to be true, but a complete proof continues to elude mathematicians. The squares conjecture: The following examples help motivate this conjecture. n = 1: Consider n 2 = 1 and (n + 1) 2 = 2 2 = 4 and observe that 2 is a prime between 1 and 4.

7 Chapter 3 Number Theory 165 n = 2: Consider n 2 = 4 and (n + 1) 2 = 9 and observe that 5 is a prime between 4 and 9. n = 3: Consider n 2 = 9 and (n + 1) 2 = 16 and observe that 11 is a prime between 9 and 16. The squares conjecture asserts that for every positive integer n N, there exists a prime between n 2 and (n + 1) 2. The squares conjecture is believed to be true, but mathematicians have not been able to prove the general result. These three questions represent just a few of the many questions about primes that remain open. We hope your interests are piqued, and perhaps you will want to study such questions further. We end this section with a theorem stated in section 2.4. With the fundamental theorem of arithmetic in hand, we can now provide the proof. Theorem3.1.4 Theorem2.4.2insection2.4 For a, b Z, if p is a prime factor of a b, then either p is a factor of a or p is a factor of b. Proof In proving a disjunction (an or statement), a standard strategy is to assume the hypothesis and the negation of one of the disjuncts, and then to argue for the truth of the other disjunct. The validity of this strategy is based on the logical equivalence of p (q r) and (p q) r. We assume a, b Z, p is prime factor of a b, and p is not a factor of a. We show that p is a factor of b. Using the existence portion of the fundamental theorem of arithmetic, express a b, a, and b as the unique products of powers of primes (up to order) a b = p n 1 1 pn i i, a = q m 1 1 qm j j, and b = r l 1 1 r l, where p 1,..., p i, q 1,..., q j, r 1,..., r are prime numbers and n 1,..., n i, m 1,..., m j, l 1,..., l are positive integers. Since p is a prime factor of a b, we now that p is one of p 1,..., p i by the uniqueness of prime power factorizations. Without loss of generality, assume p = p 1, so that a b = p n 1 p n 2 2 pn i i. Multiplying the prime power factorizations of a and b together, we also have a b = q m 1 1 qm j j r l 1 1 r l. Equating these two expressions for a b produces p n1 p n 2 2 pn i i = q m 1 1 qm j j r l 1 1 r l. The uniqueness portion of the fundamental theorem of arithmetic implies that these primes and their powers are unique up to the order in which they appear. Since p is not a factor of a (by the assumption), p is not equal to any of q 1,..., q j. Therefore, p must be one of r 1,..., r, and so p is a factor of b = r l 1 1 r l Reading Questions for Section Define what is meant by the phrase n divides m and give an example. 2. What is the relationship between divides and modular equivalence? 3. Define and give an example of a prime number. 4. How many primes are there? 5. How many even primes are there?

8 166 A Transition to Advanced Mathematics 6. State the fundamental theorem of arithmetic. 7. Discuss the nature of the two distinct claims made by the fundamental theorem of arithmetic. 8. What is the prime power factorization of an integer n? Determine the prime power factorization of 1, State and give an example for the Goldbach conjecture. 10. Define and give an example of a semiprime. 11. State and give an example for the twin primes conjecture. 12. State and give an example for the squares conjecture Exercises for Section 3.1 In exercises 1 4, verify each statement by finding the corresponding quotient q from the division algorithm divides divides 7, is a factor of 2, is a factor of 161 In exercises 5 20, prove each mathematical statement for integers m, n,, p, a, b Z. 5. The negative of a divisor of n is also a divisor of n. 6. The divides relation is reflexive; that is, m divides m. 7. The divides relation is transitive; that is, if m divides n and n divides, then m divides. 8. The divides relation is linear; that is, if m divides n and m divides, then for every a, b, we have m divides a n + b. 9. If m divides a and n divides b, then m n divides a b. 10. If m n divides, then both m divides and n divides. 11. An integer m divides n if and only if n mod m = For every prime p and nonzero n, we have n 2 n mod p if and only if either n 1 mod p or n 0 mod p. 13. If 2 divides n, then 4 divides n If a prime p divides n, then p 2 divides n If a prime p divides n 2, then p divides n. Note: This result is used in section If a prime p divides n, then p divides n. 17. If a prime p divides both m and n, then p 4 divides m 4 n If no prime less than n divides n, then n is prime. 19. For any positive integer n, 3 divides n 3 n. 20. The product of three consecutive integers is divisible by 6. In exercises 21 25, disprove each false mathematical statement for m, n,, a, b Z. 21. If m divides a and n divides b, then m + n divides a + b. 22. If positive integers m and n both divide, then m n divides. Hint: Consider n = m 2.

9 Chapter 3 Number Theory The divides relation is symmetric; that is, if m divides n, then n divides m. 24. The divides relation is asymmetric; that is, if m divides n, then n does not divide m. 25. The divides relation satisfies comparability; that is, for every m and n, m divides n, or m is equal to n, or n divides m. In exercises 26 33, find the prime power factorization of each integer , , , , , Every integer between 2 and 10 inclusive. 33. Every integer between 11 and 20 inclusive. 34. For a fixed, nonprime integer n Z with prime power factorization n = p n 1 1 pn 2 2 pn, what is the largest possible integer that can appear in this factorization? Explain your answer. Exercises consider properties of greatest common divisors. A pair of integers has a greatest common divisor (gcd) (or factor) when is the greatest divisor of both. For example, 25 and 40 have a greatest common divisor 5 because 5 is a (common) divisor of both 25 and 40, and there is no common divisor of 25 and 40 greater than 5. In this case, we write gcd(25, 40) = 5. In general, the primes shared by the prime power factorizations of two integers generate their greatest common divisor. 35. Find the prime power factorization of the integers 18 and Find all positive common divisors of 18 and 60. What is gcd(18, 60)? 37. Determine gcd(12, 50). 38. Determine gcd(75, 100). 39. Determine gcd(31, 32). 40. Determine gcd(31, 62). 41. If p is prime and n is a positive integer, what are the two possible values of gcd( p, n)? 42. Prove that if m and n are positive integers, then [gcd(m, n)] 2 is a divisor of m n. Exercises consider greatest common divisors and linear combinations. The greatest common divisor gcd(m, n) is defined before Exercises One consequence of the division algorithm is that for all positive integers m and n, there exist integers a, b such that a m + b n = gcd(m, n). We say that gcd(m, n) can be expressed as a linear combination of m and n. In Exercises find the greatest common divisor of each pair of integers and express this greatest common divisor as a linear combination of the two integers and and and and 22

10 168 A Transition to Advanced Mathematics Exercises consider relatively prime integers. Every pair of integers m and n have a common divisor of 1. When 1 is the greatest common divisor of m and n (that is, when gcd(m, n) = 1), we say that m and n are relatively prime. In Exercises determine if each pair of integers is relatively prime by finding their greatest common divisor and and and 26, and 25, and 31, and 51,183 In Exercise 53 58, prove each mathematical statement for m, n,, p Z. Relatively prime is defined before exercises A prime p is relatively prime to every integer n < p. 54. Positive integers n and n 2 are never relatively prime. 55. Positive integers n and n + 1 are always relatively prime. 56. If m is relatively prime to n, then m is relatively prime to both n and. 57. If m and n are relatively prime, then m 2 and n 2 are relatively prime. 58. Give a counterexample disproving the false assertion that If m is relatively prime to n p, then m n is relatively prime to p. Exercises consider a numerical approximation for the number of primes less than or equal to a given integer n, where π(n) denotes this number. For example, π(2) = 1, π(3) = 2, π(4) = 2, and π(5) = 3. Mathematicians have long sought patterns and relations for primes including the question of what percentage or ratio of integers are prime. The prime number theorem provides one answer, asserting the following limit. lim n π(n) n ln(n) = 1 Exercises consider numerical evidence supporting the prime number theorem. 59. Determine the value of π(n) for every integer between 2 and 10 inclusive. 60. Determine the value of π(n) for every integer between 11 and 20 inclusive. 61. Woring with a table of primes (perhaps on the web), determine the value of π(100) and π(200). 62. Complete the following table. Does the resulting data support the assertion of the prime number theorem that lim n π(n) n/ ln(n) = 1 n π(n) , ,000 9,592 10,000, ,579 1,000,000,000 50,847,534 n ln (n) π(n) n ln (n)

11 Chapter 3 Number Theory Complete the following table. Based on this data, what proportion of the integers less than or equal to n is also prime? n π(n) , ,000 9,592 10,000, ,579 1,000,000,000 50,847,534 π(n) n 1 ln (n) Exercises consider questions related to Euclid s proof of the infinitude of the primes and the number-theoretic conjectures discussed at the end of this section. 64. What is the smallest composite positive integer of the form p 1 p 2 p n + 1 with n greater than 1 and p 1, p 2,..., p n distinct primes? Consider products of nonconsecutive primes such as = Express every even number between 4 and 32 inclusive as a sum of two primes. For example, 12 = These sums verify the Goldbach conjecture up to Goldbach also made a conjecture about odd numbers and sums of primes: every odd positive integer greater than five is the sum of three primes. Verify this conjecture for every odd number between 7 and 31 inclusive. 67. State the first eight pairs of twin primes; this list begins with the pair (3, 5). 68. Prove that an odd integer cannot be written as the sum of twin primes. 69. For every positive integer n between 2 and 20 inclusive, determine a prime between n 2 and (n + 1) 2. These primes verify the squares conjecture up to Mathematicians from Diophantus to Fermat thought that every positive integer can be expressed as the sum of four squares of integers. In the late 1700s, Lagrange gave the first rigorous proof of this result, based on wor of Euler. Computationally verify this statement for every positive integer between 1 and 20 inclusive. 3.2 Application: Introduction to Coding Theory and Cryptography This application of number theory involves prime numbers, modular arithmetic, and a bit of group theory in the context of sharing information. When two parties are communicating with one another, they (usually) see an accurate exchange of information. In addition, the parties involved often have a strong interest in preserving the privacy of the shared information. Fortunately, mathematicians woring in the fields of cryptography and coding theory have developed a variety of mathematical schemes that ensure both private and accurate communication.

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

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

### SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

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

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

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

### Section 6-2 Mathematical Induction

6- Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that

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

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

### 31 is a prime number is a mathematical statement (which happens to be true).

Chapter 1 Mathematical Logic In its most basic form, Mathematics is the practice of assigning truth to welldefined statements. In this course, we will develop the skills to use known true statements to

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

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

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

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

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

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

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

### Students in their first advanced mathematics classes are often surprised

CHAPTER 8 Proofs Involving Sets Students in their first advanced mathematics classes are often surprised by the extensive role that sets play and by the fact that most of the proofs they encounter are

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

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

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

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

### Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

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

### Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

### DISCRETE MATHEMATICS W W L CHEN

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free

### Appendix F: Mathematical Induction

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

### ORDERS OF ELEMENTS IN A GROUP

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

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

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

### vertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 466 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

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

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

### Structure and randomness in the prime numbers. Science colloquium January 17, A small selection of results in number theory. Terence Tao (UCLA)

Structure and randomness in the prime numbers A small selection of results in number theory Science colloquium January 17, 2007 Terence Tao (UCLA) 1 Prime numbers A prime number is a natural number larger

### 2.1 The Algebra of Sets

Chapter 2 Abstract Algebra 83 part of abstract algebra, sets are fundamental to all areas of mathematics and we need to establish a precise language for sets. We also explore operations on sets and relations

### Congruences. Robert Friedman

Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition

### Is this number prime? Berkeley Math Circle Kiran Kedlaya

Is this number prime? Berkeley Math Circle 2002 2003 Kiran Kedlaya Given a positive integer, how do you check whether it is prime (has itself and 1 as its only two positive divisors) or composite (not

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

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

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

### 2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

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

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

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

### Handout #1: Mathematical Reasoning

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

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

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

### Discrete Mathematics

Slides for Part IA CST 2014/15 Discrete Mathematics Prof Marcelo Fiore Marcelo.Fiore@cl.cam.ac.uk What are we up to? Learn to read and write, and also work with, mathematical

### 8.7 Mathematical Induction

8.7. MATHEMATICAL INDUCTION 8-135 8.7 Mathematical Induction Objective Prove a statement by mathematical induction Many mathematical facts are established by first observing a pattern, then making a conjecture

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

### CHAPTER 5: MODULAR ARITHMETIC

CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called

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

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

### Mathematics of Cryptography

CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter

### TEXAS A&M UNIVERSITY. Prime Factorization. A History and Discussion. Jason R. Prince. April 4, 2011

TEXAS A&M UNIVERSITY Prime Factorization A History and Discussion Jason R. Prince April 4, 2011 Introduction In this paper we will discuss prime factorization, in particular we will look at some of the

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

### Summer High School 2009 Aaron Bertram. 1. Prime Numbers. Let s start with some notation:

Summer High School 2009 Aaron Bertram 1. Prime Numbers. Let s start with some notation: N = {1, 2, 3, 4, 5,...} is the (infinite) set of natural numbers. Z = {..., 3, 2, 1, 0, 1, 2, 3,...} is the set of

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

### Odd Perfect Numbers. way back to the ancient Greek era. A perfect number is both a positive integer that is the sum of

Stephanie Mijat Math 301 Odd Perfect Numbers Perfect numbers have been an interesting topic of study for mathematicians dating all the way back to the ancient Greek era. A perfect number is both a positive

### Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

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

### Note on some explicit formulae for twin prime counting function

Notes on Number Theory and Discrete Mathematics Vol. 9, 03, No., 43 48 Note on some explicit formulae for twin prime counting function Mladen Vassilev-Missana 5 V. Hugo Str., 4 Sofia, Bulgaria e-mail:

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

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

### This section demonstrates some different techniques of proving some general statements.

Section 4. Number Theory 4.. Introduction This section demonstrates some different techniques of proving some general statements. Examples: Prove that the sum of any two odd numbers is even. Firstly you

### WUCT121. Discrete Mathematics. Logic

WUCT121 Discrete Mathematics Logic 1. Logic 2. Predicate Logic 3. Proofs 4. Set Theory 5. Relations and Functions WUCT121 Logic 1 Section 1. Logic 1.1. Introduction. In developing a mathematical theory,

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

### MATH 361: NUMBER THEORY FIRST LECTURE

MATH 361: NUMBER THEORY FIRST LECTURE 1. Introduction As a provisional definition, view number theory as the study of the properties of the positive integers, Z + = {1, 2, 3, }. Of particular interest,

### Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

### Proof of Infinite Number of Fibonacci Primes. Stephen Marshall. 22 May Abstract

Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May 2014 Abstract This paper presents a complete and exhaustive proof of that an infinite number of Fibonacci Primes exist. The approach

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

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

### The Prime Numbers, Part 2

The Prime Numbers, Part 2 The fundamental theorem of arithmetic says that every integer greater than 1 can be written as a product of primes, and furthermore there is only one way to do it ecept for the

### The Equation x 2 + y 2 = z 2

The Equation x 2 + y 2 = z 2 The equation x 2 + y 2 = z 2 is associated with the Pythagorean theorem: In a right triangle the sum of the squares on the sides is equal to the square on the hypotenuse. We

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

### Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

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

### Definition: Group A group is a set G together with a binary operation on G, satisfying the following axioms: a (b c) = (a b) c.

Algebraic Structures Abstract algebra is the study of algebraic structures. Such a structure consists of a set together with one or more binary operations, which are required to satisfy certain axioms.

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

### Continued Fractions. Darren C. Collins

Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history

### Orders Modulo A Prime

Orders Modulo A Prime Evan Chen March 6, 2015 In this article I develop the notion of the order of an element modulo n, and use it to prove the famous n 2 + 1 lemma as well as a generalization to arbitrary

### Answer Key for California State Standards: Algebra I

Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.

### Five fundamental operations. mathematics: addition, subtraction, multiplication, division, and modular forms

The five fundamental operations of mathematics: addition, subtraction, multiplication, division, and modular forms UC Berkeley Trinity University March 31, 2008 This talk is about counting, and it s about

### 15 Prime and Composite Numbers

15 Prime and Composite Numbers Divides, Divisors, Factors, Multiples In section 13, we considered the division algorithm: If a and b are whole numbers with b 0 then there exist unique numbers q and r such

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

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

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

### 5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1

MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing

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

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

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

### 1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

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

### There are 8000 registered voters in Brownsville, and 3 8. of these voters live in

Politics and the political process affect everyone in some way. In local, state or national elections, registered voters make decisions about who will represent them and make choices about various ballot

What we still don t know about addition and multiplication Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA (University of Georgia, emeritus) Bay Area Mathematical Adventures Santa Clara University

### Recent progress in additive prime number theory

Recent progress in additive prime number theory University of California, Los Angeles Mahler Lecture Series Additive prime number theory Additive prime number theory is the study of additive patterns in