# Doug Ravenel. October 15, 2008

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Doug Ravenel University of Rochester October 15, 2008 s about Euclid s

2 Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we will give it shortly. In 1737 Euler found a completely different proof that requires calculus. His method is harder to use but more powerful. We will outline it later if time permits. s about Euclid s

3 Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we will give it shortly. In 1737 Euler found a completely different proof that requires calculus. His method is harder to use but more powerful. We will outline it later if time permits. s about Euclid s

4 Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we will give it shortly. In 1737 Euler found a completely different proof that requires calculus. His method is harder to use but more powerful. We will outline it later if time permits. s about Euclid s

5 Theorem 2 (Dirichlet, 1837, Primes in arithmetic progressions) Let a and b be relatively prime positive integers. Then there are infinitely primes of the form am + b. Example. For a = 10, b could be 1, 3, 7 or 9. The says there are infinitely s of the form 10m + 1, 10m + 3, 10m + 7 and 10m + 9. For other values of b not prime to 10, there is at most one such prime. Dirichlet s proof uses functions of a complex variable. We will see how some cases of it can be proved with more elementary methods. s about Euclid s

6 Theorem 2 (Dirichlet, 1837, Primes in arithmetic progressions) Let a and b be relatively prime positive integers. Then there are infinitely primes of the form am + b. Example. For a = 10, b could be 1, 3, 7 or 9. The says there are infinitely s of the form 10m + 1, 10m + 3, 10m + 7 and 10m + 9. For other values of b not prime to 10, there is at most one such prime. Dirichlet s proof uses functions of a complex variable. We will see how some cases of it can be proved with more elementary methods. s about Euclid s

7 Theorem 2 (Dirichlet, 1837, Primes in arithmetic progressions) Let a and b be relatively prime positive integers. Then there are infinitely primes of the form am + b. Example. For a = 10, b could be 1, 3, 7 or 9. The says there are infinitely s of the form 10m + 1, 10m + 3, 10m + 7 and 10m + 9. For other values of b not prime to 10, there is at most one such prime. Dirichlet s proof uses functions of a complex variable. We will see how some cases of it can be proved with more elementary methods. s about Euclid s

8 Theorem 2 (Dirichlet, 1837, Primes in arithmetic progressions) Let a and b be relatively prime positive integers. Then there are infinitely primes of the form am + b. Example. For a = 10, b could be 1, 3, 7 or 9. The says there are infinitely s of the form 10m + 1, 10m + 3, 10m + 7 and 10m + 9. For other values of b not prime to 10, there is at most one such prime. Dirichlet s proof uses functions of a complex variable. We will see how some cases of it can be proved with more elementary methods. s about Euclid s

9 Theorem 3 (Hadamard and de la Valle Poussin, 1896, Assymptotic distribution of primes) Let π(x) denote the number of primes less than x. Then lim x π(x) x/ ln x = 1. In other words, the number of primes less than x is roughly x/ ln x. A better approximation is to π(x) is the logarithmic integral li(x) = x 0 dt ln(t). s about Euclid s

10 Theorem 3 (Hadamard and de la Valle Poussin, 1896, Assymptotic distribution of primes) Let π(x) denote the number of primes less than x. Then lim x π(x) x/ ln x = 1. In other words, the number of primes less than x is roughly x/ ln x. A better approximation is to π(x) is the logarithmic integral li(x) = x 0 dt ln(t). s about Euclid s

11 Theorem 3 (Hadamard and de la Valle Poussin, 1896, Assymptotic distribution of primes) Let π(x) denote the number of primes less than x. Then lim x π(x) x/ ln x = 1. In other words, the number of primes less than x is roughly x/ ln x. A better approximation is to π(x) is the logarithmic integral li(x) = x 0 dt ln(t). s about Euclid s

12 The omniscient being proof of Here is that there are infinitely s: Look at the positive integers 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,... See which of them are primes 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,... Notice that there are infinitely many of them. QED s about Euclid s

13 The omniscient being proof of Here is that there are infinitely s: Look at the positive integers 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,... See which of them are primes 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,... Notice that there are infinitely many of them. QED s about Euclid s

14 The omniscient being proof of Here is that there are infinitely s: Look at the positive integers 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,... See which of them are primes 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,... Notice that there are infinitely many of them. QED s about Euclid s

15 The omniscient being proof of Here is that there are infinitely s: Look at the positive integers 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,... See which of them are primes 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,... Notice that there are infinitely many of them. QED s about Euclid s

16 The omniscient being proof of Here is that there are infinitely s: Look at the positive integers 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,... See which of them are primes 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,... Notice that there are infinitely many of them. QED s about Euclid s

17 Without God s omniscience, we have to work harder. relies on the Fundamental Theorem of Arithmetic (FTA for short), which says that every positive integer can be written as a product of primes in a unique way. For example, 2008 = (251 is a prime) s about Euclid s

18 Without God s omniscience, we have to work harder. relies on the Fundamental Theorem of Arithmetic (FTA for short), which says that every positive integer can be written as a product of primes in a unique way. For example, 2008 = (251 is a prime) s about Euclid s

19 Without God s omniscience, we have to work harder. relies on the Fundamental Theorem of Arithmetic (FTA for short), which says that every positive integer can be written as a product of primes in a unique way. For example, 2008 = (251 is a prime) s about Euclid s

20 that there are infinitely many primes Here is Euclid s wonderfully elegant argument: Let S = {p 1, p 2,..., p n } be a finite set of primes. Let N = p 1 p 2... p n, the product of all the primes in S. The number N is divisible by every prime in S. The number N + 1 is not divisible by any prime in S. By the FTA, N + 1 is a product of one or more primes not in the set S. Therefore S is not the set of all the. This means there are infinitely s. s about Euclid s

21 that there are infinitely many primes Here is Euclid s wonderfully elegant argument: Let S = {p 1, p 2,..., p n } be a finite set of primes. Let N = p 1 p 2... p n, the product of all the primes in S. The number N is divisible by every prime in S. The number N + 1 is not divisible by any prime in S. By the FTA, N + 1 is a product of one or more primes not in the set S. Therefore S is not the set of all the. This means there are infinitely s. s about Euclid s

22 that there are infinitely many primes Here is Euclid s wonderfully elegant argument: Let S = {p 1, p 2,..., p n } be a finite set of primes. Let N = p 1 p 2... p n, the product of all the primes in S. The number N is divisible by every prime in S. The number N + 1 is not divisible by any prime in S. By the FTA, N + 1 is a product of one or more primes not in the set S. Therefore S is not the set of all the. This means there are infinitely s. s about Euclid s

23 that there are infinitely many primes Here is Euclid s wonderfully elegant argument: Let S = {p 1, p 2,..., p n } be a finite set of primes. Let N = p 1 p 2... p n, the product of all the primes in S. The number N is divisible by every prime in S. The number N + 1 is not divisible by any prime in S. By the FTA, N + 1 is a product of one or more primes not in the set S. Therefore S is not the set of all the. This means there are infinitely s. s about Euclid s

24 that there are infinitely many primes Here is Euclid s wonderfully elegant argument: Let S = {p 1, p 2,..., p n } be a finite set of primes. Let N = p 1 p 2... p n, the product of all the primes in S. The number N is divisible by every prime in S. The number N + 1 is not divisible by any prime in S. By the FTA, N + 1 is a product of one or more primes not in the set S. Therefore S is not the set of all the. This means there are infinitely s. s about Euclid s

25 that there are infinitely many primes Here is Euclid s wonderfully elegant argument: Let S = {p 1, p 2,..., p n } be a finite set of primes. Let N = p 1 p 2... p n, the product of all the primes in S. The number N is divisible by every prime in S. The number N + 1 is not divisible by any prime in S. By the FTA, N + 1 is a product of one or more primes not in the set S. Therefore S is not the set of all the. This means there are infinitely s. s about Euclid s

26 that there are infinitely many primes Here is Euclid s wonderfully elegant argument: Let S = {p 1, p 2,..., p n } be a finite set of primes. Let N = p 1 p 2... p n, the product of all the primes in S. The number N is divisible by every prime in S. The number N + 1 is not divisible by any prime in S. By the FTA, N + 1 is a product of one or more primes not in the set S. Therefore S is not the set of all the. This means there are infinitely s. s about Euclid s

27 that there are infinitely many primes Here is Euclid s wonderfully elegant argument: Let S = {p 1, p 2,..., p n } be a finite set of primes. Let N = p 1 p 2... p n, the product of all the primes in S. The number N is divisible by every prime in S. The number N + 1 is not divisible by any prime in S. By the FTA, N + 1 is a product of one or more primes not in the set S. Therefore S is not the set of all the. This means there are infinitely s. s about Euclid s

28 We can use Euclid s method to show there are infinitely of the form. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N 1 is not divisible by any of the primes in S. Therefore 4N 1 is the product of some primes not in S, all of which are odd and not all of which have the form. Therefore S is not the set of all primes of the form. s about Euclid s

29 We can use Euclid s method to show there are infinitely of the form. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N 1 is not divisible by any of the primes in S. Therefore 4N 1 is the product of some primes not in S, all of which are odd and not all of which have the form. Therefore S is not the set of all primes of the form. s about Euclid s

30 We can use Euclid s method to show there are infinitely of the form. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N 1 is not divisible by any of the primes in S. Therefore 4N 1 is the product of some primes not in S, all of which are odd and not all of which have the form. Therefore S is not the set of all primes of the form. s about Euclid s

31 We can use Euclid s method to show there are infinitely of the form. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N 1 is not divisible by any of the primes in S. Therefore 4N 1 is the product of some primes not in S, all of which are odd and not all of which have the form. Therefore S is not the set of all primes of the form. s about Euclid s

32 We can use Euclid s method to show there are infinitely of the form. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N 1 is not divisible by any of the primes in S. Therefore 4N 1 is the product of some primes not in S, all of which are odd and not all of which have the form. Therefore S is not the set of all primes of the form. s about Euclid s

33 We can try a similar approach to primes of the form. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N + 1 is not divisible by any of the primes in S. Therefore 4N + 1 is the product of some primes not in S, all of which are odd. However it could be the product of an even number of primes of the form, eg 21 = 3 7. OOPS. s about Euclid s

34 We can try a similar approach to primes of the form. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N + 1 is not divisible by any of the primes in S. Therefore 4N + 1 is the product of some primes not in S, all of which are odd. However it could be the product of an even number of primes of the form, eg 21 = 3 7. OOPS. s about Euclid s

35 We can try a similar approach to primes of the form. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N + 1 is not divisible by any of the primes in S. Therefore 4N + 1 is the product of some primes not in S, all of which are odd. However it could be the product of an even number of primes of the form, eg 21 = 3 7. OOPS. s about Euclid s

36 We can try a similar approach to primes of the form. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N + 1 is not divisible by any of the primes in S. Therefore 4N + 1 is the product of some primes not in S, all of which are odd. However it could be the product of an even number of primes of the form, eg 21 = 3 7. OOPS. s about Euclid s

37 We can try a similar approach to primes of the form. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N + 1 is not divisible by any of the primes in S. Therefore 4N + 1 is the product of some primes not in S, all of which are odd. However it could be the product of an even number of primes of the form, eg 21 = 3 7. OOPS. s about Euclid s

38 We can try a similar approach to primes of the form. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N + 1 is not divisible by any of the primes in S. Therefore 4N + 1 is the product of some primes not in S, all of which are odd. However it could be the product of an even number of primes of the form, eg 21 = 3 7. OOPS. s about Euclid s

39 How to fix this problem It turns out that the number 4N (instead of 4N + 1) has to be the product of primes of the form. Here are some examples. N 4N N 4N = = = = = = = s about Euclid s

40 How to fix this problem It turns out that the number 4N (instead of 4N + 1) has to be the product of primes of the form. Here are some examples. N 4N N 4N = = = = = = = s about Euclid s

41 How to fix this problem (continued) It turns out that the number 4N (instead of 4N + 1) has to be the product of primes of the form. To prove this we need some help from Pierre de Fermat, who is best known for his Last Theorem. Theorem (Fermat s Little Theorem, 1640) If p is a prime, then x p x is divisible by p for any integer x. Since x p x = x(x p 1 1), if x is not divisible by p, then x p 1 1 is divisible by p. In other words, x p 1 1 modulo p. s about Euclid s

42 How to fix this problem (continued) It turns out that the number 4N (instead of 4N + 1) has to be the product of primes of the form. To prove this we need some help from Pierre de Fermat, who is best known for his Last Theorem. Theorem (Fermat s Little Theorem, 1640) If p is a prime, then x p x is divisible by p for any integer x. Since x p x = x(x p 1 1), if x is not divisible by p, then x p 1 1 is divisible by p. In other words, x p 1 1 modulo p. s about Euclid s

43 How to fix this problem (continued) It turns out that the number 4N (instead of 4N + 1) has to be the product of primes of the form. To prove this we need some help from Pierre de Fermat, who is best known for his Last Theorem. Theorem (Fermat s Little Theorem, 1640) If p is a prime, then x p x is divisible by p for any integer x. Since x p x = x(x p 1 1), if x is not divisible by p, then x p 1 1 is divisible by p. In other words, x p 1 1 modulo p. s about Euclid s

44 How to fix this problem (continued) It turns out that the number 4N (instead of 4N + 1) has to be the product of primes of the form. To prove this we need some help from Pierre de Fermat, who is best known for his Last Theorem. Theorem (Fermat s Little Theorem, 1640) If p is a prime, then x p x is divisible by p for any integer x. Since x p x = x(x p 1 1), if x is not divisible by p, then x p 1 1 is divisible by p. In other words, x p 1 1 modulo p. s about Euclid s

45 How to fix this problem (continued) It turns out that the number 4N (instead of 4N + 1) has to be the product of primes of the form. To prove this we need some help from Pierre de Fermat, who is best known for his Last Theorem. Theorem (Fermat s Little Theorem, 1640) If p is a prime, then x p x is divisible by p for any integer x. Since x p x = x(x p 1 1), if x is not divisible by p, then x p 1 1 is divisible by p. In other words, x p 1 1 modulo p. s about Euclid s

46 Lemma Any number of the form 4N is a product of primes of the form. Proof: Let x = 2N, so our number is x Suppose it is divisible by a prime of the form p = 4m + 3. This means x 2 1 modulo p. Then x 4m = (x 2 ) 2m ( 1) 2m = 1. Fermat s Little Theorem tell us that x p 1 = x 4m+2 1, but x 4m+2 = x 4m x = 1, so we have a contradiction. Hence 4N is not divisible by any prime of the form 4m + 3. QED s about Euclid s

47 Lemma Any number of the form 4N is a product of primes of the form. Proof: Let x = 2N, so our number is x Suppose it is divisible by a prime of the form p = 4m + 3. This means x 2 1 modulo p. Then x 4m = (x 2 ) 2m ( 1) 2m = 1. Fermat s Little Theorem tell us that x p 1 = x 4m+2 1, but x 4m+2 = x 4m x = 1, so we have a contradiction. Hence 4N is not divisible by any prime of the form 4m + 3. QED s about Euclid s

48 Lemma Any number of the form 4N is a product of primes of the form. Proof: Let x = 2N, so our number is x Suppose it is divisible by a prime of the form p = 4m + 3. This means x 2 1 modulo p. Then x 4m = (x 2 ) 2m ( 1) 2m = 1. Fermat s Little Theorem tell us that x p 1 = x 4m+2 1, but x 4m+2 = x 4m x = 1, so we have a contradiction. Hence 4N is not divisible by any prime of the form 4m + 3. QED s about Euclid s

49 Lemma Any number of the form 4N is a product of primes of the form. Proof: Let x = 2N, so our number is x Suppose it is divisible by a prime of the form p = 4m + 3. This means x 2 1 modulo p. Then x 4m = (x 2 ) 2m ( 1) 2m = 1. Fermat s Little Theorem tell us that x p 1 = x 4m+2 1, but x 4m+2 = x 4m x = 1, so we have a contradiction. Hence 4N is not divisible by any prime of the form 4m + 3. QED s about Euclid s

50 Lemma Any number of the form 4N is a product of primes of the form. Proof: Let x = 2N, so our number is x Suppose it is divisible by a prime of the form p = 4m + 3. This means x 2 1 modulo p. Then x 4m = (x 2 ) 2m ( 1) 2m = 1. Fermat s Little Theorem tell us that x p 1 = x 4m+2 1, but x 4m+2 = x 4m x = 1, so we have a contradiction. Hence 4N is not divisible by any prime of the form 4m + 3. QED s about Euclid s

51 Lemma Any number of the form 4N is a product of primes of the form. Proof: Let x = 2N, so our number is x Suppose it is divisible by a prime of the form p = 4m + 3. This means x 2 1 modulo p. Then x 4m = (x 2 ) 2m ( 1) 2m = 1. Fermat s Little Theorem tell us that x p 1 = x 4m+2 1, but x 4m+2 = x 4m x = 1, so we have a contradiction. Hence 4N is not divisible by any prime of the form 4m + 3. QED s about Euclid s

52 Lemma Any number of the form 4N is a product of primes of the form. Proof: Let x = 2N, so our number is x Suppose it is divisible by a prime of the form p = 4m + 3. This means x 2 1 modulo p. Then x 4m = (x 2 ) 2m ( 1) 2m = 1. Fermat s Little Theorem tell us that x p 1 = x 4m+2 1, but x 4m+2 = x 4m x = 1, so we have a contradiction. Hence 4N is not divisible by any prime of the form 4m + 3. QED s about Euclid s

53 Lemma Any number of the form 4N is a product of primes of the form. Proof: Let x = 2N, so our number is x Suppose it is divisible by a prime of the form p = 4m + 3. This means x 2 1 modulo p. Then x 4m = (x 2 ) 2m ( 1) 2m = 1. Fermat s Little Theorem tell us that x p 1 = x 4m+2 1, but x 4m+2 = x 4m x = 1, so we have a contradiction. Hence 4N is not divisible by any prime of the form 4m + 3. QED s about Euclid s

54 again Here is our second attempt to use Euclid s method, this time with some help from Fermat. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N is not divisible by any of the primes in S. Therefore 4N is the product of some primes not in S, all of which must have the form. Therefore S is not the set of all primes of the form. s about Euclid s

55 again Here is our second attempt to use Euclid s method, this time with some help from Fermat. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N is not divisible by any of the primes in S. Therefore 4N is the product of some primes not in S, all of which must have the form. Therefore S is not the set of all primes of the form. s about Euclid s

56 again Here is our second attempt to use Euclid s method, this time with some help from Fermat. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N is not divisible by any of the primes in S. Therefore 4N is the product of some primes not in S, all of which must have the form. Therefore S is not the set of all primes of the form. s about Euclid s

57 again Here is our second attempt to use Euclid s method, this time with some help from Fermat. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N is not divisible by any of the primes in S. Therefore 4N is the product of some primes not in S, all of which must have the form. Therefore S is not the set of all primes of the form. s about Euclid s

58 again Here is our second attempt to use Euclid s method, this time with some help from Fermat. Let S = {p 1,..., p n } be a set of such primes, and let N be the product of all of them. The number 4N is not divisible by any of the primes in S. Therefore 4N is the product of some primes not in S, all of which must have the form. Therefore S is not the set of all primes of the form. s about Euclid s

59 Some other cases of Similar methods (involving algebra but no analysis) can be used to prove some but not all cases of. For example, We can show there are infinitely s of the forms 3m + 1 and 3m 1. We can show there are infinitely s of the forms 5m + 1 and 5m 1. We can show there are infinitely s of the forms 5m + 2 or 5m + 3, but not that there are infinitely many of either type alone. s about Euclid s

60 Some other cases of Similar methods (involving algebra but no analysis) can be used to prove some but not all cases of. For example, We can show there are infinitely s of the forms 3m + 1 and 3m 1. We can show there are infinitely s of the forms 5m + 1 and 5m 1. We can show there are infinitely s of the forms 5m + 2 or 5m + 3, but not that there are infinitely many of either type alone. s about Euclid s

61 Some other cases of Similar methods (involving algebra but no analysis) can be used to prove some but not all cases of. For example, We can show there are infinitely s of the forms 3m + 1 and 3m 1. We can show there are infinitely s of the forms 5m + 1 and 5m 1. We can show there are infinitely s of the forms 5m + 2 or 5m + 3, but not that there are infinitely many of either type alone. s about Euclid s

62 Some other cases of Similar methods (involving algebra but no analysis) can be used to prove some but not all cases of. For example, We can show there are infinitely s of the forms 3m + 1 and 3m 1. We can show there are infinitely s of the forms 5m + 1 and 5m 1. We can show there are infinitely s of the forms 5m + 2 or 5m + 3, but not that there are infinitely many of either type alone. s about Euclid s

63 Some other cases of Similar methods (involving algebra but no analysis) can be used to prove some but not all cases of. For example, We can show there are infinitely s of the forms 3m + 1 and 3m 1. We can show there are infinitely s of the forms 5m + 1 and 5m 1. We can show there are infinitely s of the forms 5m + 2 or 5m + 3, but not that there are infinitely many of either type alone. s about Euclid s

64 Euler s proof that there are infinitely s Euler considered the infinite series n 1 1 n s = 1 1 s s s +... From calculus we know that it converges for s > 1 (by the integral test) and diverges for s = 1 (by the comparison test), when it is the harmonic series. Using FTA, Euler rewrote the series as a product 1 n s = 1 p n 1 p prime ks k 0 = ( s + 14 ) (1 s s + 19 ) s s about Euclid s

65 Euler s proof that there are infinitely s Euler considered the infinite series n 1 1 n s = 1 1 s s s +... From calculus we know that it converges for s > 1 (by the integral test) and diverges for s = 1 (by the comparison test), when it is the harmonic series. Using FTA, Euler rewrote the series as a product 1 n s = 1 p n 1 p prime ks k 0 = ( s + 14 ) (1 s s + 19 ) s s about Euclid s

66 Euler s proof that there are infinitely s Euler considered the infinite series n 1 1 n s = 1 1 s s s +... From calculus we know that it converges for s > 1 (by the integral test) and diverges for s = 1 (by the comparison test), when it is the harmonic series. Using FTA, Euler rewrote the series as a product 1 n s = 1 p n 1 p prime ks k 0 = ( s + 14 ) (1 s s + 19 ) s s about Euclid s

67 Euler s proof that there are infinitely s Euler considered the infinite series n 1 1 n s = 1 1 s s s +... From calculus we know that it converges for s > 1 (by the integral test) and diverges for s = 1 (by the comparison test), when it is the harmonic series. Using FTA, Euler rewrote the series as a product 1 n s = 1 p n 1 p prime ks k 0 = ( s + 14 ) (1 s s + 19 ) s s about Euclid s

68 Euler s proof (continued) Each factor in this product is a geometric series. The pth factor converges to 1/(1 p s ), whenever s > 0. Hence n 1 1 n s = p prime 1 1 p s. If there were only finitely s, this would give a finite answer for s = 1, contradicting the divergence of the harmonic series. Dirichlet used some clever variations of this method to prove his 100 years later. s about Euclid s

69 Euler s proof (continued) Each factor in this product is a geometric series. The pth factor converges to 1/(1 p s ), whenever s > 0. Hence n 1 1 n s = p prime 1 1 p s. If there were only finitely s, this would give a finite answer for s = 1, contradicting the divergence of the harmonic series. Dirichlet used some clever variations of this method to prove his 100 years later. s about Euclid s

70 Euler s proof (continued) Each factor in this product is a geometric series. The pth factor converges to 1/(1 p s ), whenever s > 0. Hence n 1 1 n s = p prime 1 1 p s. If there were only finitely s, this would give a finite answer for s = 1, contradicting the divergence of the harmonic series. Dirichlet used some clever variations of this method to prove his 100 years later. s about Euclid s

71 Euler s proof (continued) Each factor in this product is a geometric series. The pth factor converges to 1/(1 p s ), whenever s > 0. Hence n 1 1 n s = p prime 1 1 p s. If there were only finitely s, this would give a finite answer for s = 1, contradicting the divergence of the harmonic series. Dirichlet used some clever variations of this method to prove his 100 years later. s about Euclid s

72 Epilogue: zeta function. In his famous 1859 paper On the Number of Primes Less Than a Given Magnitude, Riemmann studied Euler s series n 0 1 n s = p prime 1 1 p s as a function of a complex variable s, which he called ζ(s). He showed that the series converges whenever s has real part greater than 1, and that it can be extended as a complex analytic function to all values of s other than 1, where the function has a pole. He showed that the behavior of this function is intimately connected with the distribution of. To learn more about this connection, ask Steve Gonek to give a talk. s about Euclid s

73 Epilogue: zeta function. In his famous 1859 paper On the Number of Primes Less Than a Given Magnitude, Riemmann studied Euler s series n 0 1 n s = p prime 1 1 p s as a function of a complex variable s, which he called ζ(s). He showed that the series converges whenever s has real part greater than 1, and that it can be extended as a complex analytic function to all values of s other than 1, where the function has a pole. He showed that the behavior of this function is intimately connected with the distribution of. To learn more about this connection, ask Steve Gonek to give a talk. s about Euclid s

74 Epilogue: zeta function. In his famous 1859 paper On the Number of Primes Less Than a Given Magnitude, Riemmann studied Euler s series n 0 1 n s = p prime 1 1 p s as a function of a complex variable s, which he called ζ(s). He showed that the series converges whenever s has real part greater than 1, and that it can be extended as a complex analytic function to all values of s other than 1, where the function has a pole. He showed that the behavior of this function is intimately connected with the distribution of. To learn more about this connection, ask Steve Gonek to give a talk. s about Euclid s

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

### ANALYTICAL MATHEMATICS FOR APPLICATIONS 2016 LECTURE NOTES Series

ANALYTICAL MATHEMATICS FOR APPLICATIONS 206 LECTURE NOTES 8 ISSUED 24 APRIL 206 A series is a formal sum. Series a + a 2 + a 3 + + + where { } is a sequence of real numbers. Here formal means that we don

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

### The positive integers other than 1 may be divided into two classes, prime numbers (such as 2, 3, 5, 7) which do not admit of resolution into smaller

The positive integers other than may be divided into two classes, prime numbers (such as, 3, 5, 7) which do not admit of resolution into smaller factors, and composite numbers (such as 4, 6, 8, 9) which

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

### PRIME NUMBERS AND THE RIEMANN HYPOTHESIS

PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and exlain how it is connected with the rime numbers.

### THE PRIME NUMBER THEOREM AND THE RIEMANN HYPOTHESIS. A marriage of calculus and arithmetic. BERNARD RUSSO University of California, Irvine

THE PRIME NUMBER THEOREM AND THE RIEMANN HYPOTHESIS A marriage of calculus and arithmetic BERNARD RUSSO University of California, Irvine MARINA HIGH SCHOOL JUNE 7, 2011 Biographical Sketch Bernard Russo

### STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS. 1. Introduction. The prime numbers 2, 3, 5, 7,... are one of the oldest topics studied in mathematics.

STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS TERENCE TAO Abstract. A quick tour through some topics in analytic prime number theory.. Introduction The prime numbers 2, 3, 5, 7,... are one of the oldest

### Series. Chapter Convergence of series

Chapter 4 Series Divergent series are the devil, and it is a shame to base on them any demonstration whatsoever. Niels Henrik Abel, 826 This series is divergent, therefore we may be able to do something

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

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

### Congruent Numbers, the Rank of Elliptic Curves and the Birch and Swinnerton-Dyer Conjecture. Brad Groff

Congruent Numbers, the Rank of Elliptic Curves and the Birch and Swinnerton-Dyer Conjecture Brad Groff Contents 1 Congruent Numbers... 1.1 Basic Facts............................... and Elliptic Curves.1

### CHAPTER 2 FOURIER SERIES

CHAPTER 2 FOURIER SERIES PERIODIC FUNCTIONS A function is said to have a period T if for all x,, where T is a positive constant. The least value of T>0 is called the period of. EXAMPLES We know that =

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

### An Introductory Course in Elementary Number Theory. Wissam Raji

An Introductory Course in Elementary Number Theory Wissam Raji 2 Preface These notes serve as course notes for an undergraduate course in number theory. Most if not all universities worldwide offer introductory

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

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

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

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

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

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

### Recent Breakthrough in Primality Testing

Nonlinear Analysis: Modelling and Control, 2004, Vol. 9, No. 2, 171 184 Recent Breakthrough in Primality Testing R. Šleževičienė, J. Steuding, S. Turskienė Department of Computer Science, Faculty of Physics

### Sequences and Series

Contents 6 Sequences and Series 6. Sequences and Series 6. Infinite Series 3 6.3 The Binomial Series 6 6.4 Power Series 3 6.5 Maclaurin and Taylor Series 40 Learning outcomes In this Workbook you will

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

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

### 9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

### A REVIEW OF PRIME PATTERNS

A REVIEW OF PRIME PATTERNS JAIME SORENSON UNIVERSITY OF ROCHESTER MTH 391W PROFESSOR HAESSIG FALL 008 1 Introduction The first records of studies of prime numbers come from the Ancient Greeks. Euclid proved

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

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

### The Alternating Series Test

The Alternating Series Test So far we have considered mostly series all of whose terms are positive. If the signs of the terms alternate, then testing convergence is a much simpler matter. On the other

### S = k=1 k. ( 1) k+1 N S N S N

Alternating Series Last time we talked about convergence of series. Our two most important tests, the integral test and the (limit) comparison test, both required that the terms of the series were (eventually)

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

### Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

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

### ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION

ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION Aldrin W. Wanambisi 1* School of Pure and Applied Science, Mount Kenya University, P.O box 553-50100, Kakamega, Kenya. Shem Aywa 2 Department of Mathematics,

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

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

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

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

### Primality - Factorization

Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.

### If n is odd, then 3n + 7 is even.

Proof: Proof: We suppose... that 3n + 7 is even. that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. that 3n + 7 is even. Since n is odd, there exists an integer k so that

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

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

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

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

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

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

### 10.2 Series and Convergence

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

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

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

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

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

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

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

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

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

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

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

### 16.1. Sequences and Series. Introduction. Prerequisites. Learning Outcomes. Learning Style

Sequences and Series 16.1 Introduction In this block we develop the ground work for later blocks on infinite series and on power series. We begin with simple sequences of numbers and with finite series

### Alex, I will take congruent numbers for one million dollars please

Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory

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

### Engineering Mathematics II

PSUT Engineering Mathematics II Fourier Series and Transforms Dr. Mohammad Sababheh 4/14/2009 11.1 Fourier Series 2 Fourier Series and Transforms Contents 11.1 Fourier Series... 3 Periodic Functions...

### Applications of Fermat s Little Theorem and Congruences

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

### Preliminary Version: December 1998

On the Number of Prime Numbers less than a Given Quantity. (Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse.) Bernhard Riemann [Monatsberichte der Berliner Akademie, November 859.] Translated

### Full and Complete Binary Trees

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

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

### 2 n = n=1 a n is convergent and we let. i=1

Lecture 4 : Series So far our definition of a sum of numbers applies only to adding a finite set of numbers. We can extend this to a definition of a sum of an infinite set of numbers in much the same way

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

### Die ganzen zahlen hat Gott gemacht

Die ganzen zahlen hat Gott gemacht Polynomials with integer values B.Sury A quote attributed to the famous mathematician L.Kronecker is Die Ganzen Zahlen hat Gott gemacht, alles andere ist Menschenwerk.

### Computational Number Theory

Computational Number Theory C. Pomerance 1 Introduction Historically, computation has been a driving force in the development of mathematics. To help measure the sizes of their fields, the Egyptians invented

### Convergence and Divergence Lecture Notes

Convergence and Divergence Lecture Notes It is not always possible to determine the sum of a series exactly. For one thing, it is common for the sum to be a relatively arbitrary irrational number: œ â

### Remembering Ray s Lecture: e is Transcendental

Remembering Ray s Lecture: e is Transcendental Mike Raugh Michael.Raugh@gmail.com http://mikeraugh.org Companion to a presentation at The High School Math Contest Los Angeles City College March 28, 2009

### MTH 382 Number Theory Spring 2003 Practice Problems for the Final

MTH 382 Number Theory Spring 2003 Practice Problems for the Final (1) Find the quotient and remainder in the Division Algorithm, (a) with divisor 16 and dividend 95, (b) with divisor 16 and dividend -95,

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

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

### 61. REARRANGEMENTS 119

61. REARRANGEMENTS 119 61. Rearrangements Here the difference between conditionally and absolutely convergent series is further refined through the concept of rearrangement. Definition 15. (Rearrangement)

### THE PRIME NUMBER THEOREM

THE PRIME NUMBER THEOREM NIKOLAOS PATTAKOS. introduction In number theory, this Theorem describes the asymptotic distribution of the prime numbers. The Prime Number Theorem gives a general description

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

### 3.1. Sequences and Their Limits Definition (3.1.1). A sequence of real numbers (or a sequence in R) is a function from N into R.

CHAPTER 3 Sequences and Series 3.. Sequences and Their Limits Definition (3..). A sequence of real numbers (or a sequence in R) is a function from N into R. Notation. () The values of X : N! R are denoted

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

### Fourier Series. Chapter Some Properties of Functions Goal Preliminary Remarks

Chapter 3 Fourier Series 3.1 Some Properties of Functions 3.1.1 Goal We review some results about functions which play an important role in the development of the theory of Fourier series. These results

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

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

### ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM

Acta Math. Univ. Comenianae Vol. LXXXI, (01), pp. 03 09 03 ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible

### Visualising the distribution of primes

University of Luxembourg BASI Mathematics Experimental Mathematics Lab Project Visualising the distribution of primes Authors: Jim Barthel Pietro Sgobba Fa Zhu Supervisors: Prof. Gabor Wiese Dr. Panagiotis

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

### INTRODUCTION TO THE CONVERGENCE OF SEQUENCES

INTRODUCTION TO THE CONVERGENCE OF SEQUENCES BECKY LYTLE Abstract. In this paper, we discuss the basic ideas involved in sequences and convergence. We start by defining sequences and follow by explaining

### PYTHAGOREAN NUMBERS. Bowling Green State University, Bowling Green, OH (Submitted February 1988)

S u p r i y a Mohanty a n d S. P. Mohanty Bowling Green State University, Bowling Green, OH 43403-0221 (Submitted February 1988) Let M be a right angled triangle with legs x and y and hypotenuse z. Then

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

### Arithmetic and Geometric Sequences

Arithmetic and Geometric Sequences Felix Lazebnik This collection of problems is for those who wish to learn about arithmetic and geometric sequences, or to those who wish to improve their understanding

### p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other

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

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

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

### Prime numbers and prime polynomials. Paul Pollack Dartmouth College

Prime numbers and prime polynomials Paul Pollack Dartmouth College May 1, 2008 Analogies everywhere! Analogies in elementary number theory (continued fractions, quadratic reciprocity, Fermat s last theorem)

### Pr ime Tuples in Function Fields

Snapshots of modern mathematics from Oberwolfach 10/2016 Pr ime Tuples in Function Fields Lior Bar y- Soroker How many prime numbers are there? How are they distributed among other numbers? These are questions

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

### Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights