# Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers Amnon Yekutieli Department of Mathematics Ben Gurion University Notes available at written 7 June 2015 Amnon Yekutieli (BGU) Pythagorean Triples 1 / 28

2 1. Pythagorean Triples 1. Pythagorean Triples A Pythagorean triple is a triple (a, b, c) of positive integers, satisfying (1.1) a 2 + b 2 = c 2. The reason for the name is, of course, because these are the sides of a right angled triangle: Amnon Yekutieli (BGU) Pythagorean Triples 2 / 28

3 1. Pythagorean Triples 1. Pythagorean Triples A Pythagorean triple is a triple (a, b, c) of positive integers, satisfying (1.1) a 2 + b 2 = c 2. The reason for the name is, of course, because these are the sides of a right angled triangle: Amnon Yekutieli (BGU) Pythagorean Triples 2 / 28

4 1. Pythagorean Triples 1. Pythagorean Triples A Pythagorean triple is a triple (a, b, c) of positive integers, satisfying (1.1) a 2 + b 2 = c 2. The reason for the name is, of course, because these are the sides of a right angled triangle: Amnon Yekutieli (BGU) Pythagorean Triples 2 / 28

5 1. Pythagorean Triples 1. Pythagorean Triples A Pythagorean triple is a triple (a, b, c) of positive integers, satisfying (1.1) a 2 + b 2 = c 2. The reason for the name is, of course, because these are the sides of a right angled triangle: c b a Amnon Yekutieli (BGU) Pythagorean Triples 2 / 28

6 1. Pythagorean Triples We say that the triples (a, b, c) and (a, b, c ) are equivalent if the corresponding triangles are similar. This means that there is a positive number r, such that or Clearly r is rational. (a, b, c ) = (ra, rb, rc) (a, b, c ) = (rb, ra, rc). We say that the triple (a, b, c) is reduced if the greatest common divisor of these numbers is 1. The triple is called ordered if a b. It is easy to see that any triple (a, b, c) is equivalent to exactly one reduced ordered triple (a, b, c ). Exercise 1.2. Let (a, b, c) be a reduced ordered triple. Then c is odd, and a < b. Amnon Yekutieli (BGU) Pythagorean Triples 3 / 28

7 1. Pythagorean Triples We say that the triples (a, b, c) and (a, b, c ) are equivalent if the corresponding triangles are similar. This means that there is a positive number r, such that or Clearly r is rational. (a, b, c ) = (ra, rb, rc) (a, b, c ) = (rb, ra, rc). We say that the triple (a, b, c) is reduced if the greatest common divisor of these numbers is 1. The triple is called ordered if a b. It is easy to see that any triple (a, b, c) is equivalent to exactly one reduced ordered triple (a, b, c ). Exercise 1.2. Let (a, b, c) be a reduced ordered triple. Then c is odd, and a < b. Amnon Yekutieli (BGU) Pythagorean Triples 3 / 28

8 1. Pythagorean Triples We say that the triples (a, b, c) and (a, b, c ) are equivalent if the corresponding triangles are similar. This means that there is a positive number r, such that or Clearly r is rational. (a, b, c ) = (ra, rb, rc) (a, b, c ) = (rb, ra, rc). We say that the triple (a, b, c) is reduced if the greatest common divisor of these numbers is 1. The triple is called ordered if a b. It is easy to see that any triple (a, b, c) is equivalent to exactly one reduced ordered triple (a, b, c ). Exercise 1.2. Let (a, b, c) be a reduced ordered triple. Then c is odd, and a < b. Amnon Yekutieli (BGU) Pythagorean Triples 3 / 28

9 1. Pythagorean Triples We say that the triples (a, b, c) and (a, b, c ) are equivalent if the corresponding triangles are similar. This means that there is a positive number r, such that or Clearly r is rational. (a, b, c ) = (ra, rb, rc) (a, b, c ) = (rb, ra, rc). We say that the triple (a, b, c) is reduced if the greatest common divisor of these numbers is 1. The triple is called ordered if a b. It is easy to see that any triple (a, b, c) is equivalent to exactly one reduced ordered triple (a, b, c ). Exercise 1.2. Let (a, b, c) be a reduced ordered triple. Then c is odd, and a < b. Amnon Yekutieli (BGU) Pythagorean Triples 3 / 28

10 1. Pythagorean Triples We say that the triples (a, b, c) and (a, b, c ) are equivalent if the corresponding triangles are similar. This means that there is a positive number r, such that or Clearly r is rational. (a, b, c ) = (ra, rb, rc) (a, b, c ) = (rb, ra, rc). We say that the triple (a, b, c) is reduced if the greatest common divisor of these numbers is 1. The triple is called ordered if a b. It is easy to see that any triple (a, b, c) is equivalent to exactly one reduced ordered triple (a, b, c ). Exercise 1.2. Let (a, b, c) be a reduced ordered triple. Then c is odd, and a < b. Amnon Yekutieli (BGU) Pythagorean Triples 3 / 28

11 1. Pythagorean Triples Here is an interesting question: Question 1.3. triples? Are there infinitely many reduced ordered Pythagorean The answer is yes. This was already known to the ancient Greeks. There is a formula attributed to Euclid for presenting all Pythagorean triples, and it proves that there infinitely many reduced ordered triples. This formula is somewhat clumsy, and I will not display it. It can be found on the web, e.g. here: Later we will see a nice geometric argument, essentially based on the Euclid formula, to show there infinitely many reduced ordered triples. Amnon Yekutieli (BGU) Pythagorean Triples 4 / 28

12 1. Pythagorean Triples Here is an interesting question: Question 1.3. triples? Are there infinitely many reduced ordered Pythagorean The answer is yes. This was already known to the ancient Greeks. There is a formula attributed to Euclid for presenting all Pythagorean triples, and it proves that there infinitely many reduced ordered triples. This formula is somewhat clumsy, and I will not display it. It can be found on the web, e.g. here: Later we will see a nice geometric argument, essentially based on the Euclid formula, to show there infinitely many reduced ordered triples. Amnon Yekutieli (BGU) Pythagorean Triples 4 / 28

13 1. Pythagorean Triples Here is an interesting question: Question 1.3. triples? Are there infinitely many reduced ordered Pythagorean The answer is yes. This was already known to the ancient Greeks. There is a formula attributed to Euclid for presenting all Pythagorean triples, and it proves that there infinitely many reduced ordered triples. This formula is somewhat clumsy, and I will not display it. It can be found on the web, e.g. here: Later we will see a nice geometric argument, essentially based on the Euclid formula, to show there infinitely many reduced ordered triples. Amnon Yekutieli (BGU) Pythagorean Triples 4 / 28

14 1. Pythagorean Triples Here is an interesting question: Question 1.3. triples? Are there infinitely many reduced ordered Pythagorean The answer is yes. This was already known to the ancient Greeks. There is a formula attributed to Euclid for presenting all Pythagorean triples, and it proves that there infinitely many reduced ordered triples. This formula is somewhat clumsy, and I will not display it. It can be found on the web, e.g. here: Later we will see a nice geometric argument, essentially based on the Euclid formula, to show there infinitely many reduced ordered triples. Amnon Yekutieli (BGU) Pythagorean Triples 4 / 28

15 1. Pythagorean Triples Here is an interesting question: Question 1.3. triples? Are there infinitely many reduced ordered Pythagorean The answer is yes. This was already known to the ancient Greeks. There is a formula attributed to Euclid for presenting all Pythagorean triples, and it proves that there infinitely many reduced ordered triples. This formula is somewhat clumsy, and I will not display it. It can be found on the web, e.g. here: Later we will see a nice geometric argument, essentially based on the Euclid formula, to show there infinitely many reduced ordered triples. Amnon Yekutieli (BGU) Pythagorean Triples 4 / 28

16 1. Pythagorean Triples For a given integer c > 1, let us denote by PT(c) the set of all reduced ordered Pythagorean triples with hypotenuse c. A more interesting question is this: Question 1.4. What is the size of the set PT(c)? The answer to this was found in the 19th century. We will see it at the end of the lecture. An even more interesting question is this: Question 1.5. Given c, is there an effective way to find the reduced ordered Pythagorean triples with hypotenuse c? An effective method (possibly new!) will be presented at the end of the talk. Amnon Yekutieli (BGU) Pythagorean Triples 5 / 28

17 1. Pythagorean Triples For a given integer c > 1, let us denote by PT(c) the set of all reduced ordered Pythagorean triples with hypotenuse c. A more interesting question is this: Question 1.4. What is the size of the set PT(c)? The answer to this was found in the 19th century. We will see it at the end of the lecture. An even more interesting question is this: Question 1.5. Given c, is there an effective way to find the reduced ordered Pythagorean triples with hypotenuse c? An effective method (possibly new!) will be presented at the end of the talk. Amnon Yekutieli (BGU) Pythagorean Triples 5 / 28

18 1. Pythagorean Triples For a given integer c > 1, let us denote by PT(c) the set of all reduced ordered Pythagorean triples with hypotenuse c. A more interesting question is this: Question 1.4. What is the size of the set PT(c)? The answer to this was found in the 19th century. We will see it at the end of the lecture. An even more interesting question is this: Question 1.5. Given c, is there an effective way to find the reduced ordered Pythagorean triples with hypotenuse c? An effective method (possibly new!) will be presented at the end of the talk. Amnon Yekutieli (BGU) Pythagorean Triples 5 / 28

19 1. Pythagorean Triples For a given integer c > 1, let us denote by PT(c) the set of all reduced ordered Pythagorean triples with hypotenuse c. A more interesting question is this: Question 1.4. What is the size of the set PT(c)? The answer to this was found in the 19th century. We will see it at the end of the lecture. An even more interesting question is this: Question 1.5. Given c, is there an effective way to find the reduced ordered Pythagorean triples with hypotenuse c? An effective method (possibly new!) will be presented at the end of the talk. Amnon Yekutieli (BGU) Pythagorean Triples 5 / 28

20 1. Pythagorean Triples For a given integer c > 1, let us denote by PT(c) the set of all reduced ordered Pythagorean triples with hypotenuse c. A more interesting question is this: Question 1.4. What is the size of the set PT(c)? The answer to this was found in the 19th century. We will see it at the end of the lecture. An even more interesting question is this: Question 1.5. Given c, is there an effective way to find the reduced ordered Pythagorean triples with hypotenuse c? An effective method (possibly new!) will be presented at the end of the talk. Amnon Yekutieli (BGU) Pythagorean Triples 5 / 28

21 1. Pythagorean Triples For a given integer c > 1, let us denote by PT(c) the set of all reduced ordered Pythagorean triples with hypotenuse c. A more interesting question is this: Question 1.4. What is the size of the set PT(c)? The answer to this was found in the 19th century. We will see it at the end of the lecture. An even more interesting question is this: Question 1.5. Given c, is there an effective way to find the reduced ordered Pythagorean triples with hypotenuse c? An effective method (possibly new!) will be presented at the end of the talk. Amnon Yekutieli (BGU) Pythagorean Triples 5 / 28

22 1. Pythagorean Triples For a given integer c > 1, let us denote by PT(c) the set of all reduced ordered Pythagorean triples with hypotenuse c. A more interesting question is this: Question 1.4. What is the size of the set PT(c)? The answer to this was found in the 19th century. We will see it at the end of the lecture. An even more interesting question is this: Question 1.5. Given c, is there an effective way to find the reduced ordered Pythagorean triples with hypotenuse c? An effective method (possibly new!) will be presented at the end of the talk. Amnon Yekutieli (BGU) Pythagorean Triples 5 / 28

23 2. Complex Numbers on the Unit Circle 2. Complex Numbers on the Unit Circle It was observed a long time ago that Pythagorean triples can be encoded as complex numbers on the unit circle. Starting from a reduced ordered Pythagorean triple (a, b, c), we pass to the complex number z := a + b i, that has absolute value c. Consider the complex number (2.1) ζ = s + r i := z z = a c + b c i. Amnon Yekutieli (BGU) Pythagorean Triples 6 / 28

24 2. Complex Numbers on the Unit Circle 2. Complex Numbers on the Unit Circle It was observed a long time ago that Pythagorean triples can be encoded as complex numbers on the unit circle. Starting from a reduced ordered Pythagorean triple (a, b, c), we pass to the complex number z := a + b i, that has absolute value c. Consider the complex number (2.1) ζ = s + r i := z z = a c + b c i. Amnon Yekutieli (BGU) Pythagorean Triples 6 / 28

25 2. Complex Numbers on the Unit Circle 2. Complex Numbers on the Unit Circle It was observed a long time ago that Pythagorean triples can be encoded as complex numbers on the unit circle. Starting from a reduced ordered Pythagorean triple (a, b, c), we pass to the complex number z := a + b i, that has absolute value c. Consider the complex number (2.1) ζ = s + r i := z z = a c + b c i. Amnon Yekutieli (BGU) Pythagorean Triples 6 / 28

26 2. Complex Numbers on the Unit Circle 2. Complex Numbers on the Unit Circle It was observed a long time ago that Pythagorean triples can be encoded as complex numbers on the unit circle. Starting from a reduced ordered Pythagorean triple (a, b, c), we pass to the complex number z := a + b i, that has absolute value c. Consider the complex number (2.1) ζ = s + r i := z z = a c + b c i. Amnon Yekutieli (BGU) Pythagorean Triples 6 / 28

27 2. Complex Numbers on the Unit Circle The number ζ has rational coordinates, it is on the unit circle, in the second octant, and is different from i. We can recover the number z, and thus the reduced ordered Pythagorean triple (a, b, c), by clearing the denominators from the pair of rational numbers (r, s) = ( a b, a c ). Amnon Yekutieli (BGU) Pythagorean Triples 7 / 28

28 2. Complex Numbers on the Unit Circle The number ζ has rational coordinates, it is on the unit circle, in the second octant, and is different from i. c z b a We can recover the number z, and thus the reduced ordered Pythagorean triple (a, b, c), by clearing the denominators from the pair of rational numbers (r, s) = ( a b, a c ). Amnon Yekutieli (BGU) Pythagorean Triples 7 / 28

29 2. Complex Numbers on the Unit Circle The number ζ has rational coordinates, it is on the unit circle, in the second octant, and is different from i. c z b a We can recover the number z, and thus the reduced ordered Pythagorean triple (a, b, c), by clearing the denominators from the pair of rational numbers (r, s) = ( a b, a c ). Amnon Yekutieli (BGU) Pythagorean Triples 7 / 28

30 2. Complex Numbers on the Unit Circle Actually, there are 8 different numbers on the unit circle that encode the same Pythagorean triple: (2.2) ± ζ, ±i ζ, ± ζ, ±i ζ. Amnon Yekutieli (BGU) Pythagorean Triples 8 / 28

31 2. Complex Numbers on the Unit Circle Actually, there are 8 different numbers on the unit circle that encode the same Pythagorean triple: (2.2) ± ζ, ±i ζ, ± ζ, ±i ζ. Figure 2.3. Amnon Yekutieli (BGU) Pythagorean Triples 8 / 28

32 2. Complex Numbers on the Unit Circle Given a complex number ζ with rational coordinates on the unit circle, other than the four special points ±1, ±i, let us denote by pt(ζ) the unique reduced ordered Pythagorean triple (a, b, c) that ζ encodes. In this fashion we obtain a function pt from the set of complex numbers on the unit circle with rational coordinates (not including the four special points), to the set of reduced ordered Pythagorean triples. This function is surjective, and it is 8 to 1. Therefore, to show that there are infinitely many reduced ordered Pythagorean triples, it suffices to prove: Proposition 2.4. There are infinitely many complex numbers on the unit circle with rational coordinates. Amnon Yekutieli (BGU) Pythagorean Triples 9 / 28

33 2. Complex Numbers on the Unit Circle Given a complex number ζ with rational coordinates on the unit circle, other than the four special points ±1, ±i, let us denote by pt(ζ) the unique reduced ordered Pythagorean triple (a, b, c) that ζ encodes. In this fashion we obtain a function pt from the set of complex numbers on the unit circle with rational coordinates (not including the four special points), to the set of reduced ordered Pythagorean triples. This function is surjective, and it is 8 to 1. Therefore, to show that there are infinitely many reduced ordered Pythagorean triples, it suffices to prove: Proposition 2.4. There are infinitely many complex numbers on the unit circle with rational coordinates. Amnon Yekutieli (BGU) Pythagorean Triples 9 / 28

34 2. Complex Numbers on the Unit Circle Given a complex number ζ with rational coordinates on the unit circle, other than the four special points ±1, ±i, let us denote by pt(ζ) the unique reduced ordered Pythagorean triple (a, b, c) that ζ encodes. In this fashion we obtain a function pt from the set of complex numbers on the unit circle with rational coordinates (not including the four special points), to the set of reduced ordered Pythagorean triples. This function is surjective, and it is 8 to 1. Therefore, to show that there are infinitely many reduced ordered Pythagorean triples, it suffices to prove: Proposition 2.4. There are infinitely many complex numbers on the unit circle with rational coordinates. Amnon Yekutieli (BGU) Pythagorean Triples 9 / 28

35 2. Complex Numbers on the Unit Circle Given a complex number ζ with rational coordinates on the unit circle, other than the four special points ±1, ±i, let us denote by pt(ζ) the unique reduced ordered Pythagorean triple (a, b, c) that ζ encodes. In this fashion we obtain a function pt from the set of complex numbers on the unit circle with rational coordinates (not including the four special points), to the set of reduced ordered Pythagorean triples. This function is surjective, and it is 8 to 1. Therefore, to show that there are infinitely many reduced ordered Pythagorean triples, it suffices to prove: Proposition 2.4. There are infinitely many complex numbers on the unit circle with rational coordinates. Amnon Yekutieli (BGU) Pythagorean Triples 9 / 28

36 2. Complex Numbers on the Unit Circle Given a complex number ζ with rational coordinates on the unit circle, other than the four special points ±1, ±i, let us denote by pt(ζ) the unique reduced ordered Pythagorean triple (a, b, c) that ζ encodes. In this fashion we obtain a function pt from the set of complex numbers on the unit circle with rational coordinates (not including the four special points), to the set of reduced ordered Pythagorean triples. This function is surjective, and it is 8 to 1. Therefore, to show that there are infinitely many reduced ordered Pythagorean triples, it suffices to prove: Proposition 2.4. There are infinitely many complex numbers on the unit circle with rational coordinates. Amnon Yekutieli (BGU) Pythagorean Triples 9 / 28

37 2. Complex Numbers on the Unit Circle Here is a geometric proof of the proposition. Let us denote the unit circle by S 1. The stereographic projection with focus at i is the bijective function f : S 1 {i} R, that sends the complex number ζ to the unique real number f (ζ) that lies on the straight line connecting i and ζ. Amnon Yekutieli (BGU) Pythagorean Triples 10 / 28

38 2. Complex Numbers on the Unit Circle Here is a geometric proof of the proposition. Let us denote the unit circle by S 1. The stereographic projection with focus at i is the bijective function f : S 1 {i} R, that sends the complex number ζ to the unique real number f (ζ) that lies on the straight line connecting i and ζ. Amnon Yekutieli (BGU) Pythagorean Triples 10 / 28

39 2. Complex Numbers on the Unit Circle Here is a geometric proof of the proposition. Let us denote the unit circle by S 1. The stereographic projection with focus at i is the bijective function f : S 1 {i} R, that sends the complex number ζ to the unique real number f (ζ) that lies on the straight line connecting i and ζ. Amnon Yekutieli (BGU) Pythagorean Triples 10 / 28

40 2. Complex Numbers on the Unit Circle Here is a geometric proof of the proposition. Let us denote the unit circle by S 1. The stereographic projection with focus at i is the bijective function f : S 1 {i} R, that sends the complex number ζ to the unique real number f (ζ) that lies on the straight line connecting i and ζ. Amnon Yekutieli (BGU) Pythagorean Triples 10 / 28

41 2. Complex Numbers on the Unit Circle Exercise 2.5. Show that ζ has rational coordinates iff the number f (ζ) is rational. (Hint: use similar triangles.) Since there are infinitely many rational numbers, we are done. Amnon Yekutieli (BGU) Pythagorean Triples 11 / 28

42 2. Complex Numbers on the Unit Circle Exercise 2.5. Show that ζ has rational coordinates iff the number f (ζ) is rational. (Hint: use similar triangles.) Since there are infinitely many rational numbers, we are done. Amnon Yekutieli (BGU) Pythagorean Triples 11 / 28

43 2. Complex Numbers on the Unit Circle Exercise 2.5. Show that ζ has rational coordinates iff the number f (ζ) is rational. (Hint: use similar triangles.) Since there are infinitely many rational numbers, we are done. Amnon Yekutieli (BGU) Pythagorean Triples 11 / 28

44 3. The Circle as an Abelian Group 3. The Circle as an Abelian Group Previously we used the notation S 1 for the unit circle. I will now switch to another notation, that comes from algebraic geometry, and is better suited for our purposes. From now on we shall write G(R) := S 1 = {ζ C ζ = 1}. The set G(R) is a group under complex multiplication, because ζ 1 ζ 2 = ζ 1 ζ 2 and ζ 1 = ζ 1. Amnon Yekutieli (BGU) Pythagorean Triples 12 / 28

45 3. The Circle as an Abelian Group 3. The Circle as an Abelian Group Previously we used the notation S 1 for the unit circle. I will now switch to another notation, that comes from algebraic geometry, and is better suited for our purposes. From now on we shall write G(R) := S 1 = {ζ C ζ = 1}. The set G(R) is a group under complex multiplication, because ζ 1 ζ 2 = ζ 1 ζ 2 and ζ 1 = ζ 1. Amnon Yekutieli (BGU) Pythagorean Triples 12 / 28

46 3. The Circle as an Abelian Group 3. The Circle as an Abelian Group Previously we used the notation S 1 for the unit circle. I will now switch to another notation, that comes from algebraic geometry, and is better suited for our purposes. From now on we shall write G(R) := S 1 = {ζ C ζ = 1}. The set G(R) is a group under complex multiplication, because ζ 1 ζ 2 = ζ 1 ζ 2 and ζ 1 = ζ 1. Amnon Yekutieli (BGU) Pythagorean Triples 12 / 28

47 3. The Circle as an Abelian Group 3. The Circle as an Abelian Group Previously we used the notation S 1 for the unit circle. I will now switch to another notation, that comes from algebraic geometry, and is better suited for our purposes. From now on we shall write G(R) := S 1 = {ζ C ζ = 1}. The set G(R) is a group under complex multiplication, because ζ 1 ζ 2 = ζ 1 ζ 2 and ζ 1 = ζ 1. Amnon Yekutieli (BGU) Pythagorean Triples 12 / 28

48 3. The Circle as an Abelian Group 3. The Circle as an Abelian Group Previously we used the notation S 1 for the unit circle. I will now switch to another notation, that comes from algebraic geometry, and is better suited for our purposes. From now on we shall write G(R) := S 1 = {ζ C ζ = 1}. The set G(R) is a group under complex multiplication, because ζ 1 ζ 2 = ζ 1 ζ 2 and ζ 1 = ζ 1. Amnon Yekutieli (BGU) Pythagorean Triples 12 / 28

49 3. The Circle as an Abelian Group Let G(Q) be the subset of G(R) consisting of points with rational coordinates; namely (3.1) G(Q) = {ζ = s + r i s, r Q, s 2 + r 2 = 1}. Exercise 3.2. Prove that G(Q) is a subgroup of G(R). Recall that to answer Question 1, namely to show there are infinitely many reduced ordered Pythagorean triples, it suffices to prove that the abelian group G(Q) is infinite. Amnon Yekutieli (BGU) Pythagorean Triples 13 / 28

50 3. The Circle as an Abelian Group Let G(Q) be the subset of G(R) consisting of points with rational coordinates; namely (3.1) G(Q) = {ζ = s + r i s, r Q, s 2 + r 2 = 1}. Exercise 3.2. Prove that G(Q) is a subgroup of G(R). Recall that to answer Question 1, namely to show there are infinitely many reduced ordered Pythagorean triples, it suffices to prove that the abelian group G(Q) is infinite. Amnon Yekutieli (BGU) Pythagorean Triples 13 / 28

51 3. The Circle as an Abelian Group Let G(Q) be the subset of G(R) consisting of points with rational coordinates; namely (3.1) G(Q) = {ζ = s + r i s, r Q, s 2 + r 2 = 1}. Exercise 3.2. Prove that G(Q) is a subgroup of G(R). Recall that to answer Question 1, namely to show there are infinitely many reduced ordered Pythagorean triples, it suffices to prove that the abelian group G(Q) is infinite. Amnon Yekutieli (BGU) Pythagorean Triples 13 / 28

52 3. The Circle as an Abelian Group We first locate all the elements of finite order in the group G(Q). These are the roots of 1, namely the elements ζ satisfying ζ n = 1 for some positive integer n. Algebraic number theory tells us that there are just four of them: (3.3) 1, i, 1, i. Thus, if we take any element ζ G(Q) other than those four numbers, the cyclic subgroup that it generates will be infinite! {ζ n n Z} G(Q) Amnon Yekutieli (BGU) Pythagorean Triples 14 / 28

53 3. The Circle as an Abelian Group We first locate all the elements of finite order in the group G(Q). These are the roots of 1, namely the elements ζ satisfying ζ n = 1 for some positive integer n. Algebraic number theory tells us that there are just four of them: (3.3) 1, i, 1, i. Thus, if we take any element ζ G(Q) other than those four numbers, the cyclic subgroup that it generates will be infinite! {ζ n n Z} G(Q) Amnon Yekutieli (BGU) Pythagorean Triples 14 / 28

54 3. The Circle as an Abelian Group We first locate all the elements of finite order in the group G(Q). These are the roots of 1, namely the elements ζ satisfying ζ n = 1 for some positive integer n. Algebraic number theory tells us that there are just four of them: (3.3) 1, i, 1, i. Thus, if we take any element ζ G(Q) other than those four numbers, the cyclic subgroup that it generates will be infinite! {ζ n n Z} G(Q) Amnon Yekutieli (BGU) Pythagorean Triples 14 / 28

55 3. The Circle as an Abelian Group Let us consider the familiar reduced ordered Pythagorean triple (3, 4, 5). The corresponding number in G(Q) is ζ := i, and it is not one of the four special numbers in (3.3). So this element has infinite order in the group G(Q). Here are the first positive powers of ζ, and the corresponding triples. n ζ n pt(ζ n ) = (a n, b n, c n ) i (3, 4, 5) i (7, 24, 25) i (44, 117, 125) i (336, 527, 625) Amnon Yekutieli (BGU) Pythagorean Triples 15 / 28

56 3. The Circle as an Abelian Group Let us consider the familiar reduced ordered Pythagorean triple (3, 4, 5). The corresponding number in G(Q) is ζ := i, and it is not one of the four special numbers in (3.3). So this element has infinite order in the group G(Q). Here are the first positive powers of ζ, and the corresponding triples. n ζ n pt(ζ n ) = (a n, b n, c n ) i (3, 4, 5) i (7, 24, 25) i (44, 117, 125) i (336, 527, 625) Amnon Yekutieli (BGU) Pythagorean Triples 15 / 28

57 3. The Circle as an Abelian Group Let us consider the familiar reduced ordered Pythagorean triple (3, 4, 5). The corresponding number in G(Q) is ζ := i, and it is not one of the four special numbers in (3.3). So this element has infinite order in the group G(Q). Here are the first positive powers of ζ, and the corresponding triples. n ζ n pt(ζ n ) = (a n, b n, c n ) i (3, 4, 5) i (7, 24, 25) i (44, 117, 125) i (336, 527, 625) Amnon Yekutieli (BGU) Pythagorean Triples 15 / 28

58 3. The Circle as an Abelian Group Let us consider the familiar reduced ordered Pythagorean triple (3, 4, 5). The corresponding number in G(Q) is ζ := i, and it is not one of the four special numbers in (3.3). So this element has infinite order in the group G(Q). Here are the first positive powers of ζ, and the corresponding triples. n ζ n pt(ζ n ) = (a n, b n, c n ) i (3, 4, 5) i (7, 24, 25) i (44, 117, 125) i (336, 527, 625) Amnon Yekutieli (BGU) Pythagorean Triples 15 / 28

59 3. The Circle as an Abelian Group Exercise 3.4. Find a reduced Pythagorean triple with hypotenuse c = (Later we will see that there is only one!) Remark: the algebraic number theory used above, and all that is needed to complete the proofs in this lecture, can be found in the book Algebra, by M. Artin, Prentice-Hall. Amnon Yekutieli (BGU) Pythagorean Triples 16 / 28

60 3. The Circle as an Abelian Group Exercise 3.4. Find a reduced Pythagorean triple with hypotenuse c = (Later we will see that there is only one!) Remark: the algebraic number theory used above, and all that is needed to complete the proofs in this lecture, can be found in the book Algebra, by M. Artin, Prentice-Hall. Amnon Yekutieli (BGU) Pythagorean Triples 16 / 28

61 3. The Circle as an Abelian Group Exercise 3.4. Find a reduced Pythagorean triple with hypotenuse c = (Later we will see that there is only one!) Remark: the algebraic number theory used above, and all that is needed to complete the proofs in this lecture, can be found in the book Algebra, by M. Artin, Prentice-Hall. Amnon Yekutieli (BGU) Pythagorean Triples 16 / 28

62 4. The Ring of Gauss Integers 4. The Ring of Gauss Integers Consider the ring of Gauss integers A := Z[i] = {m + n i m, n Z}. Let us denote its field of fractions by K := Q[i] = {s + r i s, r Q}. The reason we want to look at K is this: equation (3.1) shows that (4.1) G(Q) = {ζ K ζ = 1}. It is known that the ring A is a unique factorization domain. There are countably many primes in A. Let us enumerate them as q 1, q 2, q 3,.... Amnon Yekutieli (BGU) Pythagorean Triples 17 / 28

63 4. The Ring of Gauss Integers 4. The Ring of Gauss Integers Consider the ring of Gauss integers A := Z[i] = {m + n i m, n Z}. Let us denote its field of fractions by K := Q[i] = {s + r i s, r Q}. The reason we want to look at K is this: equation (3.1) shows that (4.1) G(Q) = {ζ K ζ = 1}. It is known that the ring A is a unique factorization domain. There are countably many primes in A. Let us enumerate them as q 1, q 2, q 3,.... Amnon Yekutieli (BGU) Pythagorean Triples 17 / 28

64 4. The Ring of Gauss Integers 4. The Ring of Gauss Integers Consider the ring of Gauss integers A := Z[i] = {m + n i m, n Z}. Let us denote its field of fractions by K := Q[i] = {s + r i s, r Q}. The reason we want to look at K is this: equation (3.1) shows that (4.1) G(Q) = {ζ K ζ = 1}. It is known that the ring A is a unique factorization domain. There are countably many primes in A. Let us enumerate them as q 1, q 2, q 3,.... Amnon Yekutieli (BGU) Pythagorean Triples 17 / 28

65 4. The Ring of Gauss Integers 4. The Ring of Gauss Integers Consider the ring of Gauss integers A := Z[i] = {m + n i m, n Z}. Let us denote its field of fractions by K := Q[i] = {s + r i s, r Q}. The reason we want to look at K is this: equation (3.1) shows that (4.1) G(Q) = {ζ K ζ = 1}. It is known that the ring A is a unique factorization domain. There are countably many primes in A. Let us enumerate them as q 1, q 2, q 3,.... Amnon Yekutieli (BGU) Pythagorean Triples 17 / 28

66 4. The Ring of Gauss Integers 4. The Ring of Gauss Integers Consider the ring of Gauss integers A := Z[i] = {m + n i m, n Z}. Let us denote its field of fractions by K := Q[i] = {s + r i s, r Q}. The reason we want to look at K is this: equation (3.1) shows that (4.1) G(Q) = {ζ K ζ = 1}. It is known that the ring A is a unique factorization domain. There are countably many primes in A. Let us enumerate them as q 1, q 2, q 3,.... Amnon Yekutieli (BGU) Pythagorean Triples 17 / 28

67 4. The Ring of Gauss Integers 4. The Ring of Gauss Integers Consider the ring of Gauss integers A := Z[i] = {m + n i m, n Z}. Let us denote its field of fractions by K := Q[i] = {s + r i s, r Q}. The reason we want to look at K is this: equation (3.1) shows that (4.1) G(Q) = {ζ K ζ = 1}. It is known that the ring A is a unique factorization domain. There are countably many primes in A. Let us enumerate them as q 1, q 2, q 3,.... Amnon Yekutieli (BGU) Pythagorean Triples 17 / 28

68 4. The Ring of Gauss Integers The group A of invertible elements of A turns out to be the group of roots of unity (4.2) T := {±1, ±i}. Unique factorization tells us that any element a K can be written uniquely a product (4.3) a = u i=1 q ni i, with u T, n i Z, and all but finitely many n i are 0 (so the product is actually finite). We see that as an abelian group, (4.4) K = T F, where F is the free abelian group with basis {q i } i=1,2,.... Amnon Yekutieli (BGU) Pythagorean Triples 18 / 28

69 4. The Ring of Gauss Integers The group A of invertible elements of A turns out to be the group of roots of unity (4.2) T := {±1, ±i}. Unique factorization tells us that any element a K can be written uniquely a product (4.3) a = u i=1 q ni i, with u T, n i Z, and all but finitely many n i are 0 (so the product is actually finite). We see that as an abelian group, (4.4) K = T F, where F is the free abelian group with basis {q i } i=1,2,.... Amnon Yekutieli (BGU) Pythagorean Triples 18 / 28

70 4. The Ring of Gauss Integers The group A of invertible elements of A turns out to be the group of roots of unity (4.2) T := {±1, ±i}. Unique factorization tells us that any element a K can be written uniquely a product (4.3) a = u i=1 q ni i, with u T, n i Z, and all but finitely many n i are 0 (so the product is actually finite). We see that as an abelian group, (4.4) K = T F, where F is the free abelian group with basis {q i } i=1,2,.... Amnon Yekutieli (BGU) Pythagorean Triples 18 / 28

71 4. The Ring of Gauss Integers It is known that the primes of the ring A = Z[i] are of three kinds. The first kind is the prime q := 1 + i. It is the only prime divisor of 2 in A, with multiplicity 2 : q 2 = (1 + i) 2 = 1 + i i = i 2. Next let p be a prime in Z satisfying p 3 mod 4. For example p = 3 or p = 7. Then p is also prime in A. This is the second kind of primes. Amnon Yekutieli (BGU) Pythagorean Triples 19 / 28

72 4. The Ring of Gauss Integers It is known that the primes of the ring A = Z[i] are of three kinds. The first kind is the prime q := 1 + i. It is the only prime divisor of 2 in A, with multiplicity 2 : q 2 = (1 + i) 2 = 1 + i i = i 2. Next let p be a prime in Z satisfying p 3 mod 4. For example p = 3 or p = 7. Then p is also prime in A. This is the second kind of primes. Amnon Yekutieli (BGU) Pythagorean Triples 19 / 28

73 4. The Ring of Gauss Integers It is known that the primes of the ring A = Z[i] are of three kinds. The first kind is the prime q := 1 + i. It is the only prime divisor of 2 in A, with multiplicity 2 : q 2 = (1 + i) 2 = 1 + i i = i 2. Next let p be a prime in Z satisfying p 3 mod 4. For example p = 3 or p = 7. Then p is also prime in A. This is the second kind of primes. Amnon Yekutieli (BGU) Pythagorean Triples 19 / 28

74 4. The Ring of Gauss Integers It is known that the primes of the ring A = Z[i] are of three kinds. The first kind is the prime q := 1 + i. It is the only prime divisor of 2 in A, with multiplicity 2 : q 2 = (1 + i) 2 = 1 + i i = i 2. Next let p be a prime in Z satisfying p 3 mod 4. For example p = 3 or p = 7. Then p is also prime in A. This is the second kind of primes. Amnon Yekutieli (BGU) Pythagorean Triples 19 / 28

75 4. The Ring of Gauss Integers It is known that the primes of the ring A = Z[i] are of three kinds. The first kind is the prime q := 1 + i. It is the only prime divisor of 2 in A, with multiplicity 2 : q 2 = (1 + i) 2 = 1 + i i = i 2. Next let p be a prime in Z satisfying p 3 mod 4. For example p = 3 or p = 7. Then p is also prime in A. This is the second kind of primes. Amnon Yekutieli (BGU) Pythagorean Triples 19 / 28

76 4. The Ring of Gauss Integers It is known that the primes of the ring A = Z[i] are of three kinds. The first kind is the prime q := 1 + i. It is the only prime divisor of 2 in A, with multiplicity 2 : q 2 = (1 + i) 2 = 1 + i i = i 2. Next let p be a prime in Z satisfying p 3 mod 4. For example p = 3 or p = 7. Then p is also prime in A. This is the second kind of primes. Amnon Yekutieli (BGU) Pythagorean Triples 19 / 28

77 4. The Ring of Gauss Integers Finally, let p be a prime of Z satisfying (4.5) p 1 mod 4. For example p = 5 or p = 13. Then there are two primes q and q in A, conjugate to each other but not equivalent (i.e. q / T q), such that (4.6) p = u q q for some u T. The numbers q, q are the third kind of primes of A. These will be the interesting primes for us. Amnon Yekutieli (BGU) Pythagorean Triples 20 / 28

78 4. The Ring of Gauss Integers Finally, let p be a prime of Z satisfying (4.5) p 1 mod 4. For example p = 5 or p = 13. Then there are two primes q and q in A, conjugate to each other but not equivalent (i.e. q / T q), such that (4.6) p = u q q for some u T. The numbers q, q are the third kind of primes of A. These will be the interesting primes for us. Amnon Yekutieli (BGU) Pythagorean Triples 20 / 28

79 4. The Ring of Gauss Integers Finally, let p be a prime of Z satisfying (4.5) p 1 mod 4. For example p = 5 or p = 13. Then there are two primes q and q in A, conjugate to each other but not equivalent (i.e. q / T q), such that (4.6) p = u q q for some u T. The numbers q, q are the third kind of primes of A. These will be the interesting primes for us. Amnon Yekutieli (BGU) Pythagorean Triples 20 / 28

80 4. The Ring of Gauss Integers Finally, let p be a prime of Z satisfying (4.5) p 1 mod 4. For example p = 5 or p = 13. Then there are two primes q and q in A, conjugate to each other but not equivalent (i.e. q / T q), such that (4.6) p = u q q for some u T. The numbers q, q are the third kind of primes of A. These will be the interesting primes for us. Amnon Yekutieli (BGU) Pythagorean Triples 20 / 28

81 4. The Ring of Gauss Integers Finally, let p be a prime of Z satisfying (4.5) p 1 mod 4. For example p = 5 or p = 13. Then there are two primes q and q in A, conjugate to each other but not equivalent (i.e. q / T q), such that (4.6) p = u q q for some u T. The numbers q, q are the third kind of primes of A. These will be the interesting primes for us. Amnon Yekutieli (BGU) Pythagorean Triples 20 / 28

82 4. The Ring of Gauss Integers It is not hard to find the decomposition (4.6). The number p is a sum of two squares in Z : p = m 2 + n 2. We then take q := m + n i and q := m n i. Consider the number (4.7) ζ := q/ q K. It has absolute value 1, and hence, by (4.1), it belongs to the group G(Q). Amnon Yekutieli (BGU) Pythagorean Triples 21 / 28

83 4. The Ring of Gauss Integers It is not hard to find the decomposition (4.6). The number p is a sum of two squares in Z : p = m 2 + n 2. We then take q := m + n i and q := m n i. Consider the number (4.7) ζ := q/ q K. It has absolute value 1, and hence, by (4.1), it belongs to the group G(Q). Amnon Yekutieli (BGU) Pythagorean Triples 21 / 28

84 4. The Ring of Gauss Integers It is not hard to find the decomposition (4.6). The number p is a sum of two squares in Z : p = m 2 + n 2. We then take q := m + n i and q := m n i. Consider the number (4.7) ζ := q/ q K. It has absolute value 1, and hence, by (4.1), it belongs to the group G(Q). Amnon Yekutieli (BGU) Pythagorean Triples 21 / 28

85 4. The Ring of Gauss Integers It is not hard to find the decomposition (4.6). The number p is a sum of two squares in Z : p = m 2 + n 2. We then take q := m + n i and q := m n i. Consider the number (4.7) ζ := q/ q K. It has absolute value 1, and hence, by (4.1), it belongs to the group G(Q). Amnon Yekutieli (BGU) Pythagorean Triples 21 / 28

86 5. The Group Structure of the Rational Circle 5. The Group Structure of the Rational Circle There are countably many primes of Z that are 1 mod 4. Let us enumerate them in ascending order: p 1 := 5, p 2 := 13, p 3 := 17,.... Each such prime p j of Z has a prime decomposition in the ring A = Z[i] : p j = u j q j q j. We use it to define the element (5.1) ζ j := q j / q j G(Q). Thus we get a sequence of elements {ζ j } j=1,2,... in the group G(Q). Amnon Yekutieli (BGU) Pythagorean Triples 22 / 28

87 5. The Group Structure of the Rational Circle 5. The Group Structure of the Rational Circle There are countably many primes of Z that are 1 mod 4. Let us enumerate them in ascending order: p 1 := 5, p 2 := 13, p 3 := 17,.... Each such prime p j of Z has a prime decomposition in the ring A = Z[i] : p j = u j q j q j. We use it to define the element (5.1) ζ j := q j / q j G(Q). Thus we get a sequence of elements {ζ j } j=1,2,... in the group G(Q). Amnon Yekutieli (BGU) Pythagorean Triples 22 / 28

88 5. The Group Structure of the Rational Circle 5. The Group Structure of the Rational Circle There are countably many primes of Z that are 1 mod 4. Let us enumerate them in ascending order: p 1 := 5, p 2 := 13, p 3 := 17,.... Each such prime p j of Z has a prime decomposition in the ring A = Z[i] : p j = u j q j q j. We use it to define the element (5.1) ζ j := q j / q j G(Q). Thus we get a sequence of elements {ζ j } j=1,2,... in the group G(Q). Amnon Yekutieli (BGU) Pythagorean Triples 22 / 28

89 5. The Group Structure of the Rational Circle 5. The Group Structure of the Rational Circle There are countably many primes of Z that are 1 mod 4. Let us enumerate them in ascending order: p 1 := 5, p 2 := 13, p 3 := 17,.... Each such prime p j of Z has a prime decomposition in the ring A = Z[i] : p j = u j q j q j. We use it to define the element (5.1) ζ j := q j / q j G(Q). Thus we get a sequence of elements {ζ j } j=1,2,... in the group G(Q). Amnon Yekutieli (BGU) Pythagorean Triples 22 / 28

90 5. The Group Structure of the Rational Circle 5. The Group Structure of the Rational Circle There are countably many primes of Z that are 1 mod 4. Let us enumerate them in ascending order: p 1 := 5, p 2 := 13, p 3 := 17,.... Each such prime p j of Z has a prime decomposition in the ring A = Z[i] : p j = u j q j q j. We use it to define the element (5.1) ζ j := q j / q j G(Q). Thus we get a sequence of elements {ζ j } j=1,2,... in the group G(Q). Amnon Yekutieli (BGU) Pythagorean Triples 22 / 28

91 5. The Group Structure of the Rational Circle 5. The Group Structure of the Rational Circle There are countably many primes of Z that are 1 mod 4. Let us enumerate them in ascending order: p 1 := 5, p 2 := 13, p 3 := 17,.... Each such prime p j of Z has a prime decomposition in the ring A = Z[i] : p j = u j q j q j. We use it to define the element (5.1) ζ j := q j / q j G(Q). Thus we get a sequence of elements {ζ j } j=1,2,... in the group G(Q). Amnon Yekutieli (BGU) Pythagorean Triples 22 / 28

92 5. The Group Structure of the Rational Circle Here is our main result. Theorem 5.2. Any element ζ G(Q) is uniquely a product ζ = u ζ j nj, j=1 with u T, n j Z, and all but finitely many of the n j are 0. In other words, the abelian group G(Q) is a product G(Q) = T F, where F is the free abelian group with basis {ζ j } j=1,2,.... Amnon Yekutieli (BGU) Pythagorean Triples 23 / 28

93 5. The Group Structure of the Rational Circle Here is our main result. Theorem 5.2. Any element ζ G(Q) is uniquely a product ζ = u ζ j nj, j=1 with u T, n j Z, and all but finitely many of the n j are 0. In other words, the abelian group G(Q) is a product G(Q) = T F, where F is the free abelian group with basis {ζ j } j=1,2,.... Amnon Yekutieli (BGU) Pythagorean Triples 23 / 28

94 5. The Group Structure of the Rational Circle Here is our main result. Theorem 5.2. Any element ζ G(Q) is uniquely a product ζ = u ζ j nj, j=1 with u T, n j Z, and all but finitely many of the n j are 0. In other words, the abelian group G(Q) is a product G(Q) = T F, where F is the free abelian group with basis {ζ j } j=1,2,.... Amnon Yekutieli (BGU) Pythagorean Triples 23 / 28

95 5. The Group Structure of the Rational Circle Here is our main result. Theorem 5.2. Any element ζ G(Q) is uniquely a product ζ = u ζ j nj, j=1 with u T, n j Z, and all but finitely many of the n j are 0. In other words, the abelian group G(Q) is a product G(Q) = T F, where F is the free abelian group with basis {ζ j } j=1,2,.... Amnon Yekutieli (BGU) Pythagorean Triples 23 / 28

96 5. The Group Structure of the Rational Circle Sketch of Proof. Consider the prime decomposition of ζ as an element of K, as in (4.3). For each prime q i of A we calculate its absolute value q i R. The equality 1 = q i ni i=1 implies that the primes q i that do not come in pairs must have multiplicity n i = 0. The primes that do come in pairs, namely the primes of the third kind, must have opposite multiplicities. Thus they appears as powers of the corresponding number ζ. Amnon Yekutieli (BGU) Pythagorean Triples 24 / 28

97 5. The Group Structure of the Rational Circle Sketch of Proof. Consider the prime decomposition of ζ as an element of K, as in (4.3). For each prime q i of A we calculate its absolute value q i R. The equality 1 = q i ni i=1 implies that the primes q i that do not come in pairs must have multiplicity n i = 0. The primes that do come in pairs, namely the primes of the third kind, must have opposite multiplicities. Thus they appears as powers of the corresponding number ζ. Amnon Yekutieli (BGU) Pythagorean Triples 24 / 28

98 5. The Group Structure of the Rational Circle Sketch of Proof. Consider the prime decomposition of ζ as an element of K, as in (4.3). For each prime q i of A we calculate its absolute value q i R. The equality 1 = q i ni i=1 implies that the primes q i that do not come in pairs must have multiplicity n i = 0. The primes that do come in pairs, namely the primes of the third kind, must have opposite multiplicities. Thus they appears as powers of the corresponding number ζ. Amnon Yekutieli (BGU) Pythagorean Triples 24 / 28

99 5. The Group Structure of the Rational Circle Sketch of Proof. Consider the prime decomposition of ζ as an element of K, as in (4.3). For each prime q i of A we calculate its absolute value q i R. The equality 1 = q i ni i=1 implies that the primes q i that do not come in pairs must have multiplicity n i = 0. The primes that do come in pairs, namely the primes of the third kind, must have opposite multiplicities. Thus they appears as powers of the corresponding number ζ. Amnon Yekutieli (BGU) Pythagorean Triples 24 / 28

100 5. The Group Structure of the Rational Circle Sketch of Proof. Consider the prime decomposition of ζ as an element of K, as in (4.3). For each prime q i of A we calculate its absolute value q i R. The equality 1 = q i ni i=1 implies that the primes q i that do not come in pairs must have multiplicity n i = 0. The primes that do come in pairs, namely the primes of the third kind, must have opposite multiplicities. Thus they appears as powers of the corresponding number ζ. Amnon Yekutieli (BGU) Pythagorean Triples 24 / 28

101 6. Back to Pythagorean Triples 6. Back to Pythagorean Triples Recall that for a number ζ G(Q) T, we write pt(ζ) for the corresponding reduced ordered Pythagorean triple. Here is our explicit presentation of all reduced ordered Pythagorean triples. Amnon Yekutieli (BGU) Pythagorean Triples 25 / 28

102 6. Back to Pythagorean Triples 6. Back to Pythagorean Triples Recall that for a number ζ G(Q) T, we write pt(ζ) for the corresponding reduced ordered Pythagorean triple. Here is our explicit presentation of all reduced ordered Pythagorean triples. Amnon Yekutieli (BGU) Pythagorean Triples 25 / 28

103 6. Back to Pythagorean Triples 6. Back to Pythagorean Triples Recall that for a number ζ G(Q) T, we write pt(ζ) for the corresponding reduced ordered Pythagorean triple. Here is our explicit presentation of all reduced ordered Pythagorean triples. Amnon Yekutieli (BGU) Pythagorean Triples 25 / 28

104 6. Back to Pythagorean Triples Theorem 6.1. Let c be an integer greater than 1, with prime decomposition c = p n1 1 pn k k in Z. Here p 1 < < p k are positive primes; n 1,..., n k are positive integers; and k is a positive integer. 1. If p j 1 mod 4 for every index j, then the function {±1} k 1 PT(c), (ɛ 2,..., ɛ k ) pt(ζ n1 1 ζɛ2 n2 2 ζ ɛ k n k k ) is bijective. Here ζ j is the number defined in formula (4.7) for the prime p j. 2. Otherwise, the set PT(c) is empty. Amnon Yekutieli (BGU) Pythagorean Triples 26 / 28

105 6. Back to Pythagorean Triples Theorem 6.1. Let c be an integer greater than 1, with prime decomposition c = p n1 1 pn k k in Z. Here p 1 < < p k are positive primes; n 1,..., n k are positive integers; and k is a positive integer. 1. If p j 1 mod 4 for every index j, then the function {±1} k 1 PT(c), (ɛ 2,..., ɛ k ) pt(ζ n1 1 ζɛ2 n2 2 ζ ɛ k n k k ) is bijective. Here ζ j is the number defined in formula (4.7) for the prime p j. 2. Otherwise, the set PT(c) is empty. Amnon Yekutieli (BGU) Pythagorean Triples 26 / 28

106 6. Back to Pythagorean Triples Theorem 6.1. Let c be an integer greater than 1, with prime decomposition c = p n1 1 pn k k in Z. Here p 1 < < p k are positive primes; n 1,..., n k are positive integers; and k is a positive integer. 1. If p j 1 mod 4 for every index j, then the function {±1} k 1 PT(c), (ɛ 2,..., ɛ k ) pt(ζ n1 1 ζɛ2 n2 2 ζ ɛ k n k k ) is bijective. Here ζ j is the number defined in formula (4.7) for the prime p j. 2. Otherwise, the set PT(c) is empty. Amnon Yekutieli (BGU) Pythagorean Triples 26 / 28

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

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

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

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

### Pythagorean Triples Pythagorean triple similar primitive

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

### 1 Review of complex numbers

1 Review of complex numbers 1.1 Complex numbers: algebra The set C of complex numbers is formed by adding a square root i of 1 to the set of real numbers: i = 1. Every complex number can be written uniquely

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

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

### 2.1 Sets, power sets. Cartesian Products.

Lecture 8 2.1 Sets, power sets. Cartesian Products. Set is an unordered collection of objects. - used to group objects together, - often the objects with similar properties This description of a set (without

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

### Ideal Class Group and Units

Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

### DigitalCommons@University of Nebraska - Lincoln

University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-1-007 Pythagorean Triples Diane Swartzlander University

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

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

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

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

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

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### Congruent Number Problem

University of Waterloo October 28th, 2015 Number Theory Number theory, can be described as the mathematics of discovering and explaining patterns in numbers. There is nothing in the world which pleases

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

### 3 1. Note that all cubes solve it; therefore, there are no more

Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if

### Math Workshop October 2010 Fractions and Repeating Decimals

Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,

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

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### Lecture Notes on Polynomials

Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex

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

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

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

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

### RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean

### Square Roots and the Pythagorean Theorem

4.8 Square Roots and the Pythagorean Theorem 4.8 OBJECTIVES 1. Find the square root of a perfect square 2. Use the Pythagorean theorem to find the length of a missing side of a right triangle 3. Approximate

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

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

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

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

### A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25

### Pythagorean Triples and Rational Points on the Unit Circle

Pythagorean Triles and Rational Points on the Unit Circle Solutions Below are samle solutions to the roblems osed. You may find that your solutions are different in form and you may have found atterns

### ARITHMETICAL FUNCTIONS II: CONVOLUTION AND INVERSION

ARITHMETICAL FUNCTIONS II: CONVOLUTION AND INVERSION PETE L. CLARK 1. Sums over divisors, convolution and Möbius Inversion The proof of the multiplicativity of the functions σ k, easy though it was, actually

### Infinite Algebra 1 supports the teaching of the Common Core State Standards listed below.

Infinite Algebra 1 Kuta Software LLC Common Core Alignment Software version 2.05 Last revised July 2015 Infinite Algebra 1 supports the teaching of the Common Core State Standards listed below. High School

### Introduction to Modern Algebra

Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write

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

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

### Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks

Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### Geometric Transformations

Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted

### Sets and set operations

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used

### EXPONENTS. To the applicant: KEY WORDS AND CONVERTING WORDS TO EQUATIONS

To the applicant: The following information will help you review math that is included in the Paraprofessional written examination for the Conejo Valley Unified School District. The Education Code requires

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

### 1.4 Factors and Prime Factorization

1.4 Factors and Prime Factorization Recall from Section 1.2 that the word factor refers to a number which divides into another number. For example, 3 and 6 are factors of 18 since 3 6 = 18. Note also that

### Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

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

### POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

### Mathematics for Computer Science

Mathematics for Computer Science Lecture 2: Functions and equinumerous sets Areces, Blackburn and Figueira TALARIS team INRIA Nancy Grand Est Contact: patrick.blackburn@loria.fr Course website: http://www.loria.fr/~blackbur/courses/math

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

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

### 5.1 Radical Notation and Rational Exponents

Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots

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

### Math 115 Spring 2011 Written Homework 5 Solutions

. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence

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

### Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.

Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

### Math Placement Test Study Guide. 2. The test consists entirely of multiple choice questions, each with five choices.

Math Placement Test Study Guide General Characteristics of the Test 1. All items are to be completed by all students. The items are roughly ordered from elementary to advanced. The expectation is that

### Incenter Circumcenter

TRIANGLE: Centers: Incenter Incenter is the center of the inscribed circle (incircle) of the triangle, it is the point of intersection of the angle bisectors of the triangle. The radius of incircle is

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### Quick Reference ebook

This file is distributed FREE OF CHARGE by the publisher Quick Reference Handbooks and the author. Quick Reference ebook Click on Contents or Index in the left panel to locate a topic. The math facts listed

### Factoring of Prime Ideals in Extensions

Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree

### Elements of Plane Geometry by LK

Elements of Plane Geometry by LK These are notes indicating just some bare essentials of plane geometry and some problems to think about. We give a modified version of the axioms for Euclidean Geometry

### God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

### Math 0980 Chapter Objectives. Chapter 1: Introduction to Algebra: The Integers.

Math 0980 Chapter Objectives Chapter 1: Introduction to Algebra: The Integers. 1. Identify the place value of a digit. 2. Write a number in words or digits. 3. Write positive and negative numbers used

### MATH 0110 Developmental Math Skills Review, 1 Credit, 3 hours lab

MATH 0110 Developmental Math Skills Review, 1 Credit, 3 hours lab MATH 0110 is established to accommodate students desiring non-course based remediation in developmental mathematics. This structure will

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

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

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

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

### with functions, expressions and equations which follow in units 3 and 4.

Grade 8 Overview View unit yearlong overview here The unit design was created in line with the areas of focus for grade 8 Mathematics as identified by the Common Core State Standards and the PARCC Model

### 1 foot (ft) = 12 inches (in) 1 yard (yd) = 3 feet (ft) 1 mile (mi) = 5280 feet (ft) Replace 1 with 1 ft/12 in. 1ft

2 MODULE 6. GEOMETRY AND UNIT CONVERSION 6a Applications The most common units of length in the American system are inch, foot, yard, and mile. Converting from one unit of length to another is a requisite

### Cyclotomic Extensions

Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate

### Lecture 16 : Relations and Functions DRAFT

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

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

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

### On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a

### Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

### G E O M E T R Y CHAPTER 9 RIGHT TRIANGLES AND TRIGONOMETRY. Notes & Study Guide

G E O M E T R Y CHAPTER 9 RIGHT TRIANGLES AND TRIGONOMETRY Notes & Study Guide 2 TABLE OF CONTENTS SIMILAR RIGHT TRIANGLES... 3 THE PYTHAGOREAN THEOREM... 4 SPECIAL RIGHT TRIANGLES... 5 TRIGONOMETRIC RATIOS...

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

### Mathematical Induction. Mary Barnes Sue Gordon

Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by

### SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

### Group Theory (MA343): Lecture Notes Semester I Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway

Group Theory (MA343): Lecture Notes Semester I 2013-2014 Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway November 21, 2013 Contents 1 What is a group? 2 1.1 Examples...........................................

### The Ideal Class Group

Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

### Math 181 Handout 16. Rich Schwartz. March 9, 2010

Math 8 Handout 6 Rich Schwartz March 9, 200 The purpose of this handout is to describe continued fractions and their connection to hyperbolic geometry. The Gauss Map Given any x (0, ) we define γ(x) =

### Group Theory. Contents

Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

### PowerTeaching i3: Algebra I Mathematics

PowerTeaching i3: Algebra I Mathematics Alignment to the Common Core State Standards for Mathematics Standards for Mathematical Practice and Standards for Mathematical Content for Algebra I Key Ideas and

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

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

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

### Finite Fields and Error-Correcting Codes

Lecture Notes in Mathematics Finite Fields and Error-Correcting Codes Karl-Gustav Andersson (Lund University) (version 1.013-16 September 2015) Translated from Swedish by Sigmundur Gudmundsson Contents

### INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

### Cartesian Products and Relations

Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

### Instructions for SA Completion

Instructions for SA Completion 1- Take notes on these Pythagorean Theorem Course Materials then do and check the associated practice questions for an explanation on how to do the Pythagorean Theorem Substantive

### 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 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### Unique Factorization

Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon