# SUM OF TWO SQUARES JAHNAVI BHASKAR

 To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video
Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 reader can follow. Results regarding the sum of four squares problem and Waring s problem are cited with references for further reading. Contents 1. Introduction 1. Preliminaries.1. Divisibility.. Congruence 3 3. Sum of Two Squares Problem 4 4. Counting Representations 9 5. Looking Ahead Sum of Multiple Squares Waring s Problem Acknowledgments 1 References 1 1. Introduction We say that a positive integer n has a representation as a sum of two squares if n = a + b for some nonnegative a, b Z. We deliberately include 0 as a possible value for a or b so that squares themselves will fall into this category, e.g., since 4 = + 0. In this paper, we are interested not only in characterizing the numbers that have a representation as the sum of two squares, but also recognizing which numbers have more than one such representation and counting how many representations these numbers have. For instance, notice that 5 = = Naturally, the exploration of this problem inspires curiosity in similar questions, for example: what numbers can be written as the sum of three squares? or four? Is there a number k so that all numbers can be written as the sum of k squares? What if we consider cubes, or fourth powers is there some k so that all numbers be written as the sum of k cubes? Supposing there is such a k, can we improve it by contenting ourselves with finitely many outliers? A few of these questions are examined at the end of the paper. Date: August,

2 JAHNAVI BHASKAR. Preliminaries We begin with a brief introduction to divisibility and congruence, the fundamentals of number theory. Readers with experience in number theory should feel free to skip to Section Divisibility. Theorem.1. (Division Algorithm) For all a, b Z, b 0, there are unique q, r Z, 0 r < b, such that a = bq + r. See reference [] for proof. Definitions.. For a, b Z, a is divisor of b if there exists an integer x such that ax = b. We say that b is divisible by a and refer to b as a multiple of a. We write a b (read as a divides b ), or if a is not a divisor of b, a b. Example.3. The divisors of 6 are 6, 3,, 1, 1,, 3, 6. We indicate this by writing, for instance, 6. Exercise.4. Let a, b, c, s, t Z. If a b and a c, then a sb + tc. Definitions.5. Notice that for any a Z, the following holds: (1) 1 a, 1 a; () a a, a a. With this in mind, we refer to 1, 1, a and a as the trivial divisors of a. We also call 1 and 1 units. Any other divisors of a are called proper divisors. Definitions.6. A positive integer a is prime if a has no proper divisors. A positive integer a is composite if a has proper divisors. If a is a positive integer, then for primes p 1,..., p k that satisfy p 1 p p k = a, the product p 1 p p k is called the prime factorization of a. Theorem.7. (Fundamental Theorem of Arithmetic) The prime factorization of a Z, a > 1, is unique up to the order of the factors. See reference [] for proof. Definition.8. We call a, b Z relatively prime if the only common divisors of a and b are units. Definition.9. Given a, b Z, we define the greatest common divisor (GCD) of a and b, denoted by gcd(a, b), as some positive integer d such that: (1) d a and d b; () for all e such that e a and e b, e d. Remark.10. Note that if a, b are relatively prime, gcd(a, b) = 1. Lemma.11. Let S Z be given where S is a subgroup of Z under addition. Then there exists d Z such that S = dz, where dz = {dz : z Z}. Proof. Since S is a subgroup of Z, we know that given a, b S, a + b S. By repeated addition of a to itself, we get that az S. The proof proceeds in two cases:

3 SUM OF TWO SQUARES 3 (1) S = {0}. Then choose d = 0, so that S = 0Z = {0}. () S {0}. Let d be the smallest positive integer in S. We know that dz S. To show that S dz, let s S. We will show that d s, so that s dz. By the Division Algorithm, we know that s = dq + r where 0 r d 1. Notice that d S, so dq S and s S. Since S is closed under addition, dq + ( s) = r S. But because 0 r d 1, S Z, and d is the smallest positive integer in S, we know that r = 0. Thus s = dq so that d s. Theorem.1. Given a, b Z, gcd(a, b) exists and satisifes the expression for some x, y Z. gcd(a, b) = ax + by Proof. Consider S = {ax + by : x, y Z}. Note that S Z, {0} S, and S is closed under subtraction. Therefore we can apply Lemma.11 to conclude that there exists a positive integer d such that S = dz. First, we must show that d is the GCD of a, b: (1) d a and d b Note that a S, since a = a 1 + b 0. So for some z Z, dz = a = d a. For the same reason, d b. () for all e such that e a and e b, e d We know that d S, since S = dz, so d = ax 0 + by 0. By Theorem.4, since e a and e b, e ax 0 + by 0 = e d. Since d S, for some x, y Z, d = ax + by. Theorem.13. If a, b, c Z are given such that a bc and a is relatively prime to b, then a c. Proof. Since a is relatively prime to b, we have that gcd(a, b) = 1 = ax + by for some x, y Z. Now, multiply by c: c = acx + bcy. Now, we know a ac and we are given that a bc, so by Theorem.4, a acx + bcy. Thus a c... Congruence. Definition.14. Let a, b Z. We say that a is congruent to b modulo m (which we abbreviate as mod m) if m a b. We write this as a b (mod m). Remark.15. Notice that we can express m a as a 0 (mod m). Exercise.16. For any a Z, we have: (1) a a (mod m); () if a b (mod m), then b a (mod m); (3) if a b (mod m) and b c (mod m), then a c (mod m). If a b (mod m), then the following hold: (1) a + c b + c (mod m); () ac bc (mod m).

4 4 JAHNAVI BHASKAR If additionally c d (mod m), then we have: (1) a + c b + d (mod m); () ac bd (mod m). Furthermore, if ac bc (mod m) and c, m are relatively prime, then a b (mod m). We can now categorize the integers into classes based on their congruence modulo m, for some m > 1, by putting integers congruent to each other in the same class. Each integer is assigned one and only one such class, and any pair x, y drawn from the class will satisfy x y (mod m). These classes are called residue classes modulo m, denoted by a m where a is an element of that class. A set that contains exactly one element from each residue class may be written as Z/mZ. For example, when m = 4, we may write that Z/4Z = {0, 1,, 3}. For certain operations, namely addition, subtraction, multiplication, and exponentiation, any element of the class is representative of the whole; that is, performing these operations on representatives of two classes gives a residue class result that applies to any element of those two classes. For other operations greatest common divisor, for instance this is not the case. Remark.17. Be aware that we will freely interchange between the congruence expression and the algebraic expression of a number. In other words, the statement that n is of the form 4k + 1 is equivalent to the statement that n 1 (mod 4). Theorem.18. If m, n are relatively prime integers, then m has a multiplicative inverse modulo n. Proof. Since m, n are relatively prime, gcd(m, n) = 1 = am + bn by Theorem.1. Consider this equation modulo n: 1 am + bn (mod n) 1 am + 0 am (mod n). Thus m has a multiplicative inverse modulo n. For p prime, F p =Z/pZ is a field, meaning that the nonzero integers modulo p form a multiplicative group F p. The crucial properties of these algebraic structures for the purposes of this paper are the following: Since F p = {1,,..., p 1} is a multiplicative group, for each a F p there is exactly one a 1 F p so that a a 1 1 (mod p). For a F p, a 1 (mod p) if and only if a 1 (mod p) or a p 1 (mod p). The proof of this fact follows: Assume first that a 1 (mod p). Then p a 1 = (a + 1)(a 1). Now, since p is prime, p a + 1 or p a 1. If p a + 1, then since a F p, a p 1 (mod p). If p a 1, then a 1 (mod p). Assume now that a 1 (mod p). Then a 1 (mod p). If a p 1 (mod p), then a p p (mod p). 3. Sum of Two Squares Problem We begin our efforts to characterize which positive integers can be written as the sum of two squares by examining some evidence.

5 SUM OF TWO SQUARES 5 Example 3.1. The following are the possible representations of the first 0 integers: 1 = is not the sum of two squares = is not the sum of two squares 3 is not the sum of two squares 13 = = is not the sum of two squares 5 = is not the sum of two squares 6 is not the sum of two squares 16 = is not the sum of two squares 17 = = + 18 = = is not the sum of two squares 10 = = + 4. The above example illustrates the difficulty of the problem. Can the reader see any pattern above in which numbers can or cannot be represented? To characterize which n can be written as the sum of two squares, we will first tackle the case when n is prime. In the example above, notice that the primes, 5, 13, and 17 can be written as the sum of two squares. Theorem 3.. (Wilson s Theorem) Let p be prime. Then (p 1)! 1 (mod p). Proof. As discussed above, since F p forms a field, each element a {1,,..., p 1} has a unique multiplicative inverse such that a = a 1 if and only if a = 1 or a = p 1. If p =, then notice that (p 1)! = 1! = 1 1 (mod ). If p >, then we can rearrange the product 1 (p 1) so that each a {, 3,..., p } is adjacent to its multiplicative inverse. We can then simplify to get (p 1)! = (p 1) = p 1 1 (mod p). Definition 3.3. We define the greatest integer function to be the function [ ] : R Z such that for x R, [x] = max{z : z Z, z x}. Example 3.4. For instance, [3.4] = [π] = [3] = 3. Notice also that [ 3.4] = 4. We leave it to the reader to show that the greatest integer function satisfies the inequality [x] x < [x] + 1. Remark 3.5. Thue s Theorem below relies on the pigeonhole principle, also called the Dirichlet box principle, which states that if more than n objects are distributed between n holes, then one of the holes must contain more than one object. Theorem 3.6. (Thue s Theorem) Let p be prime. For any integer a such that p a, there exist x, y {1,,..., [ p]} such that ax y (mod p) or ax y (mod p). Proof. We define S = {0, 1,,..., [ p]} {0, 1,,..., [ p]}, so that S consists of ([ p]+1) ordered pairs. Given that p < [ p]+1, by squaring both sides we get p < ([ p] + 1), so S has more than p elements. Suppose a Z is given so that p a. As (x, y) varies over S, there are more than p expressions of the form ax y. Notice that ax y is an integer, and every integer is congruent modulo p to exactly one of F p = {0, 1,..., p 1}. There are p elements in F p, and more than p expressions ax y, so by the pigeonhole principle there must be at least two expressions ax y that are congruent modulo p. Take these pairs (x 1, y 1 ) (x, y ) such that ax 1 y 1 ax y (mod p). We can simplify to get a(x 1 x ) y 1 y

6 6 JAHNAVI BHASKAR (mod p). Let x = x 1 x, y = y 1 y so that (x, y) S. We want to exclude the possibility that x = 0 or y = 0, so that x, y {1,,, [ p]}. Suppose first that x = x 1 x = 0 so that x 1 = x. Then a(x 1 x ) = 0 y 1 y (mod p). Since y 1, y {0, 1,..., [ p]}, we know that y 1 < p and y < p. Then we must have that y 1 = y, contradicting (x 1, y 1 ) (x, y ). Suppose now that y = y 1 y = 0 so that y 1 = y. Then a(x 1 x ) 0 (mod p). Since p a, by Exercise.16, x 1 x 0 (mod p). Using the same logic as above, we conclude that x 1 = x, contradicting (x 1, y 1 ) (x, y ). Thus we have ax ±y (mod p), as desired. Theorem 3.7. If the equation a (mod p) is solvable for some a, then p can be represented as a sum of two squares. Proof. Take a as a solution to the equation a (mod p). Then p a, because if p a, then a 0 (mod p), and a (mod p). Thus we can apply Thue s Theorem: there exist x, y {1,,..., [ p]} such that ax ±y (mod p). Now, multiplying a (mod p) by x results in a x + x y + x 0 (mod p), which means that x + y = kp for some k Z. Since x + y, we have k > 0. We will show that in fact, k = 1. Remember that x, y [ p], so x, y ([ p]) < ( p) = p, so x + y < p. We ve shown above that p x + y. Thus k = 1, so that x + y = p. Theorem 3.8. A prime number p > is a sum of two squares if and only if p 1 (mod 4). Proof. Suppose p = x + y for nonnegative integers x, y. The result follows from two key properties of the ring Z/4Z. Notice first that any odd integer is congruent to either 1 (mod 4) or 3 (mod 4). Furthermore, any square is congruent to 0 (mod 4) or 1 (mod 4) for the following reason: as described above, any element of a residue class is representative in that arithmetic performed on that element gives a result for the entire class. Thus, we can consider each element of Z/4Z = {0, 1,, 3} squared: 0 0 (mod 4), 1 1 (mod 4), 0 (mod 4), and 3 1 (mod 4). So (Z/4Z) = {0, 1}. Now, consider p = x + y (mod 4). Since x, y {0, 1} (mod 4), we know that p x + y {0, 1, } (mod 4). But p is prime greater than, so p is odd. Thus p 1 (mod 4). n.b. This proof actually shows that if n is any odd integer that can be represented as the sum of two squares, then n 1 (mod 4). Suppose p 1 (mod 4). We will show that a (mod p) is solvable for some a, so that applying Theorem 3.7 above, we get that p is a sum of squares. First, we will examine the factors in (p 1)!: ( ) p 1 (p 1)! = 1 ( p + 1 ) (p ) (p 1). The last (p 1)/ factors in the product can be paired with the negatives of the first (p 1)/ factors in the following way: (p 1) 1 (mod p);

7 SUM OF TWO SQUARES 7 (p ) (mod p);... ; p+1 p 1 (mod p). The factorial becomes: ( ) ( ) p 1 p 1 (p 1)! 1 1 (mod p) ( )) p 1 ( 1) (1 (p 1)/ (mod p) Wilson s Theorem tells us that (p 1)! 1 (mod p), so we can write: ( )) p 1 1 ( 1) (1 (p 1)/ (mod p) ( ( )) p 1 1 ( 1) (p+1)/ (mod p) Now, we know that p 1 (mod 4), so p = 4k + 1 for some k Z. Then p+1 = 4k+1+1 = k + 1, which is odd. Thus, we have that ( 1) (p+1)/ = ( 1) k+1 = 1 and ( ( )) p (mod p). Let a = 1 ( p 1 ), so that we have a (mod p). We can now apply Theorem 3.7 to conclude that p is a sum of squares. Having solved the sum of two squares problem when n is prime, we now consider the case when n is not prime. The following theorems are required to prove the Two Squares Theorem. Theorem 3.9. (Fermat s Little Theorem) If p is prime and a is a positive integer such that p a, then a p 1 1 (mod p). Proof. Consider the p 1 integers a, a,..., (p 1)a. Notice first that none of these integers are divisible by p: if p ja for 1 j p 1, then because p a, we would have p j, which contradicts 1 j p 1. Notice also that no two of these integers are congruent to each other modulo p: if ja ka (mod p) for 1 j < k p 1, then because p is prime and p a, gcd(p, a) = 1, so we can write j k (mod p). Again, this contradicts that 1 j < k p 1. Since these integers a, a,..., (p 1)a are a set of p 1 pairwise-incongruent integers such that none are congruent to 0 modulo p, we can say the following: a a (p 1)a 1 (p 1) (mod p) a p 1 (p 1)! (p 1)! (mod p) Since (p 1)! and p are relatively prime, by Exercise.16, a p 1 1 (mod p). Lemma Let a, b be positive integers such that both a and b can be written as a sum of squares. Then the product ab can be written as a sum of squares in two ways.

8 8 JAHNAVI BHASKAR Proof. Let a = x + y and b = z + t where x, y, z, t Z. Then we have the following: ab = (x + y )(z + t ) = x z + x t + y z + y t = (x z + xyzt + y t ) + (x t xyzt + y z ) ab = (xz + yt) + (xt yz) ab = (xz yt) + (xt + yz). Remark A composite number for which every factor can be written as a sum of squares can also be written as a sum of squares. Now, we know that any number that is composed of prime factors only of the form 4k + 1 can be written as the sum of squares. As we will see in the Two Squares Theorem, a number can be written as the sum of two squares while including prime factors of the form 4k + 3 as long as those prime factors are raised to an even power. Definition 3.1. We call a positive integer a square free if n a for any n > 1, n N. For instance, a = 1 is a square free integer. An arbitrary a is square free when a = p 1 p p k where p 1, p,..., p k are distinct primes. Theorem (Two Squares Theorem) A positive integer n is the sum of two squares if and only if each prime factor p of n such that p 3 (mod 4) occurs to an even power in the prime factorization of n. Proof. Let n = s m for some s, m Z, where m is square free. Suppose that each prime factor p 3 (mod 4) occurs to an even power in the prime factorization of n. Since for each prime factor p of n such that p 3 (mod 4), p occurs to an even power, p m. Thus each prime p 0 > that divides m satisfies p 0 1 (mod 4), so by Theorem 3.8, each p 0 > can be written as the sum of two squares. We know that can be written as the sum of two squares: = By Lemma 3.10, the product of integers that can be written as the sum of two squares, m, can also be written as the sum of two squares. Thus m = x + y for some x, y Z. We can now express as n = s (x + y ) = (sx) + (sy), so n is the sum of two squares. Suppose that n = x + y. If m = 1, then n = s, so each prime p in the factorization of n such that p 3 (mod 4) occurs to an even power. Now, assume m > 1. We will show that for every odd prime p such that p m, p 1 (mod 4). Observe that x, y can be written as follows: x = dx 1 and y = dx, where x 1, x are relatively prime and d = gcd(x, y). Then we have that: n = d (x 1 + x ) n d = x 1 + x s m d = x 1 + x.

9 SUM OF TWO SQUARES 9 Since m is square free, d s, with s = t d for some t Z, so tm = x 1 + x. Then, we know that p m, so p tm = x 1+x. Thus we have the congruence x 1 + x 0 (mod p), so x 1 x (mod p). We will show that p 1 (mod 4). Assume for contradiction that p = 4k + 3 for k Z. Then notice that p 1 = 4k + = (k + 1), so we have: x 1 x (mod p) (x 1) k+1 ( 1) k+1 ( x ) k+1 (mod p) x p 1 1 x p 1 (mod p). Now, notice first that since x 1, x are relatively prime, p cannot divide both x 1 and x. Suppose p x 1. Then p x 1. We know that p tm, so p tm x 1 = x by Theorem.4. Since p is prime, p x, contradicting gcd(x 1, x ) = 1. Thus p x 1 and p x. Applying Fermat s Little Theorem, we have x p 1 1 x p 1 1 (mod p), so we get that 1 1 (mod p), contradicting p >. Thus, p 1 (mod 4). 4. Counting Representations As we have seen in Section 3, certain numbers can be represented as the sum of two squares, some in more than one way. So far, we have considered only those representations produced by nonnegative integers, and have disregarded the order of the summands in the representation. In this section, for n = a + b, we will consider the representations n = (±a) + (±b) = (±b) + (±a) as eight trivial variations on a basic representation. The motivation for this lies in the geometric underpinning of Theorem 4.4, which gives a formula for the number of representations of any positive integer. The proof of this theorem, which is beyond the scope of this paper, uses the complex numbers, commonly represented as the plane R. If we regard n = a + b to be the integer solution (a, b) to the equation of the circle n = x + y in R, a circle of radius n centered at the origin, then n = ( a) + b, for instance, is a distinct integer solution to this equation: ( a, b). Thought of in terms of points, (a, b) and ( a, b) obviously differ. Notation 4.1. Define r (n) to be the number of representations of n as a sum of two squares of integers. In standard notation, r k (n) is the number of representations of n as the sum of k squares. Example 4.. Since 1 = = ( 1) + 0 = = 0 + ( 1), r (1) = 4. It is left to the reader to show that r (5) = 8 and r (5) = 1. Theorem 4.3. Let p be prime. Then r (p) 8. Proof. If p =, then notice that r () = 4. Now assume p >. Suppose for contradiction that p = x + y = z + t for positive integers x, y, z, t, so that r (p) > 8. We may assume that x > z > t. We may also assume that gcd(x, y) = gcd(z, t) = 1, for the following reason: let d = gcd(x, y). Then p = x +y = (da) +(db) = d (a +b ). Then p d = a +b

10 10 JAHNAVI BHASKAR Z, so either d = 1 or d = p. But d p, since then d d = p, contradicting p prime. Thus d = 1. The same argument holds for the pair z, t. Moreover, we know that each of x, y, z, and t is relatively prime to p, since p is prime. As shown in Lemma 3.10, we can write p as: Furthermore, p = (x + y )(z + t ) = (xz + yt) + (xt yz) = (xz yt) + (xt + yz). (xz + yt)(xt + yz) = x zt + xyz + xyt + y zt = (x + y )zt + xy(z + t ) = pzt + pxy = p(xy + zt), so that p (xz + yt) or p (xt + yz). Suppose p (xz + yt), so that xz + yt = kp for some k Z. Then since p p, by Theorem.4, p p (xz + yt) = (xt yz). Since p is prime, p (xt yz) so xt yz = jp for some j Z. Then, we have p = k p + j p 1 = k + j. Now, we know that xz + yt > 0 and p > 0, so k > 0. Since j 0, we must have k = 1 and j = 0, meaning that xt yz = 0 so that xt = yz. We know that x, y are relatively prime, so x z, contradicting x > z. A similar argument can be made for the case p (xt + yz). Thus r (p) 8. Theorem 4.4. Let n be a positive integer, written as n = c n 1 n 3, where n 1 = p s = p s1 1 ps ps k k and p 1 (mod 4) n 3 = q 3 (mod 4) where p and q range over the prime divisors of n, and s, t vary with p, q respectively. If one of the t is odd, then r (n) = 0. If all t are even, then r (n) = 4(s 1 + 1)(s + 1) (s k + 1). We omit the proof of Theorem 4.4, which is highly technical and relies on algebraic facts about Z[i], the ring of Gaussian integers. The full proof is given in reference [7]. Example 4.5. We know from previous exercises that that r (5) = 1. We will confirm this using Theorem 4.4: 5 = c n 1 n 3 = 0 (5 ) 1, so r (5) = 4(s 1 + 1) = 4( + 1) = 1. q t

11 SUM OF TWO SQUARES Looking Ahead 5.1. Sum of Multiple Squares. Having proved that only certain numbers are representable as the sum of two squares, one may wonder whether there is a number n for which all numbers are representable as the sum of n squares. We know that all numbers are not representable as the sum of three squares: 7, for instance, and 47, cannot be represented as such. All numbers are representable as the sum of four squares. Fermat is thought to be the first to prove this, using his favorite method of infinite descent, but he never published it. After significant contributions to the problem by Euler, Lagrange published the solution in The sum of four squares result relies on an algebraic identity similar to Lemma 3.10, namely that if x and y can be represented as the sum of four squares, then xy can be represented as the sum of four squares. The remaining work is to show that every prime is the sum of four squares. See reference [6] for the proof. 5.. Waring s Problem. Around 1770, Waring considered an interesting generalization of the sum of squares problem: given a positive integer k, can we determine g(k), where g(k) is the least value of s such that every positive integer can be represented as the sum of s k th powers of nonnegative integers? For example, g() = 4, since Lagrange has shown that every positive integer can be represented as the sum of 4 squares, and no smaller a number than 4 squares can be used to represent every positive integer. For instance, 7 is not representable by 3 squares. What would such a function g look like? In 1909, Hilbert showed that for every k, g(k) exists. However, his proof did not construct a formula for g(k). A few known results are: g() = 4; g(3) = 9; g(4) 19; g(5) = 37; and for 6 k , g(k) = 3 k + k. Consider k = 3, for which g(k) = 9. Research has shown that it is likely that only two numbers, 3 = and 39 = , require as many as 9 cubes to express, so that (almost) all numbers can be written as the sum of 8 cubes. In fact, perhaps only 15 numbers, the largest of which is 804, require a full 8 cubes. All sufficiently large numbers, by which we mean all numbers 8043 onwards, can be expressed in terms of a sum of 7 cubes. It is obvious, then, that 9 is not the crucial number in this problem. Rather, the numbers which need 9 cubes only do so because of insignificant properties of particular numbers as Hardy says, an arithmetical fluke. The more challenging problem is determining G(k), the least value of s for which all sufficiently large numbers, that is, all numbers with a finite number of exceptions, can be represented by a sum of s k th powers. Obviously, G(k) g(k)

12 1 JAHNAVI BHASKAR for all k N. We will prove that G() = 4. Theorem 5.1. Let n Z such that n 7 (mod 8). Then n cannot be represented by 3 squares. Proof. A few simple calculations similar to those in Theorem 3.8 show us that (Z/8Z) = {0, 1, 4}. If x, y, z Z/8Z, then x + y + z = {0, 1,, 3, 4, 5, 6}, but no sum of 3 squares yields n 7 (mod 8). Theorem 5.. (Dirichlet s Theorem) Let h, k be relatively prime integers. Then there are infinitely many primes congruent to h (mod k). Since 7 and 8 are relatively prime integers, Dirichlet s Theorem says there are infinitely many primes congruent to 7 (mod 8). By Theorem 5.1, none of these primes can be represented by 3 squares, so G() = 4. To read more about Waring s problem, see references [], [3], and [6]. 6. Acknowledgments I want to thank Mike Shulman and Asaf Hadari for their patience and guidance; Paul Sally for providing me with materials in abundance; and Peter May for his understanding and for organizing the research program. References [1] L. Babai. Lectures in Discrete Mathematics. University of Chicago REU Program [] Erdős, Surányi. Topics in the Theory of Numbers. Springer-Verlag [3] Hardy, Wright. An Introduction to the Theory of Numbers. Oxford [4] Niven, Zuckerman, Montgomery. An Introduction to the Theory of Numbers. John Wiley and Sons [5] O. Ore. Number Theory and Its History. Dover Publications, Inc [6] K. Rosen. Elementary Number Theory and Its Applications. Addison-Wesley Publishing Co [7] Sally, Sally. Roots to Research. American Mathematical Society. 007.

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

### Homework 5 Solutions

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

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

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

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

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

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

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

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

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

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

### 12 Greatest Common Divisors. The Euclidean Algorithm

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

### Homework until Test #2

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

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

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

### Congruences. Robert Friedman

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

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

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

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

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

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### CONTINUED FRACTIONS AND 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.

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

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

### Integers and division

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

### 3. Applications of Number Theory

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

### Settling a Question about Pythagorean Triples

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

### Mathematics of Cryptography

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

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

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

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

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

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

### 1 Die hard, once and for all

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

### Integer Factorization using the Quadratic Sieve

Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give

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

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

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

### Lectures on Number Theory. Lars-Åke Lindahl

Lectures on Number Theory Lars-Åke Lindahl 2002 Contents 1 Divisibility 1 2 Prime Numbers 7 3 The Linear Diophantine Equation ax+by=c 12 4 Congruences 15 5 Linear Congruences 19 6 The Chinese Remainder

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

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

### Consequently, for the remainder of this discussion we will assume that a is a quadratic residue mod p.

Computing square roots mod p We now have very effective ways to determine whether the quadratic congruence x a (mod p), p an odd prime, is solvable. What we need to complete this discussion is an effective

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

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

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

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

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

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

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

### Algebraic Systems, Fall 2013, September 1, 2013 Edition. Todd Cochrane

Algebraic Systems, Fall 2013, September 1, 2013 Edition Todd Cochrane Contents Notation 5 Chapter 0. Axioms for the set of Integers Z. 7 Chapter 1. Algebraic Properties of the Integers 9 1.1. Background

### ECE 842 Report Implementation of Elliptic Curve Cryptography

ECE 842 Report Implementation of Elliptic Curve Cryptography Wei-Yang Lin December 15, 2004 Abstract The aim of this report is to illustrate the issues in implementing a practical elliptic curve cryptographic

### EULER S THEOREM. 1. Introduction Fermat s little theorem is an important property of integers to a prime modulus. a p 1 1 mod p.

EULER S THEOREM KEITH CONRAD. Introduction Fermat s little theorem is an important property of integers to a prime modulus. Theorem. (Fermat). For prime p and any a Z such that a 0 mod p, a p mod p. If

### CONTENTS 1. Peter Kahn. Spring 2007

CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................

### 1. Determine all real numbers a, b, c, d that satisfy the following system of equations.

altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c

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

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

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

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

### Review for Final Exam

Review for Final Exam Note: Warning, this is probably not exhaustive and probably does contain typos (which I d like to hear about), but represents a review of most of the material covered in Chapters

### PROBLEM SET 7: PIGEON HOLE PRINCIPLE

PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.

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

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

### Introduction to Diophantine Equations

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

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

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

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

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

### CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS

CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get short-changed at PROMYS, but they are interesting in their own right and useful in other areas

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

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

### TRIANGLES ON THE LATTICE OF INTEGERS. Department of Mathematics Rowan University Glassboro, NJ Andrew Roibal and Abdulkadir Hassen

TRIANGLES ON THE LATTICE OF INTEGERS Andrew Roibal and Abdulkadir Hassen Department of Mathematics Rowan University Glassboro, NJ 08028 I. Introduction In this article we will be studying triangles whose

### 5.1 Commutative rings; Integral Domains

5.1 J.A.Beachy 1 5.1 Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following

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

### GREATEST COMMON DIVISOR

DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their

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

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

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

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

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

### MATH REVIEW KIT. Reproduced with permission of the Certified General Accountant Association of Canada.

MATH REVIEW KIT Reproduced with permission of the Certified General Accountant Association of Canada. Copyright 00 by the Certified General Accountant Association of Canada and the UBC Real Estate Division.

### arxiv:0909.4913v2 [math.ho] 4 Nov 2009

IRRATIONALITY FROM THE BOOK STEVEN J. MILLER AND DAVID MONTAGUE arxiv:0909.4913v2 [math.ho] 4 Nov 2009 A right of passage to theoretical mathematics is often a proof of the irrationality of 2, or at least

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

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

### MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins

MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins The RSA encryption scheme works as follows. In order to establish the necessary public

### 15 Prime and Composite Numbers

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

### Mathematics of Cryptography Part I

CHAPTER 2 Mathematics of Cryptography Part I (Solution to Odd-Numbered Problems) Review Questions 1. The set of integers is Z. It contains all integral numbers from negative infinity to positive infinity.

### Equivalence Relations

Equivalence Relations Definition An equivalence relation on a set S, is a relation on S which is reflexive, symmetric and transitive. Examples: Let S = Z and define R = {(x,y) x and y have the same parity}

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

MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic

### 9 Modular Exponentiation and Cryptography

9 Modular Exponentiation and Cryptography 9.1 Modular Exponentiation Modular arithmetic is used in cryptography. In particular, modular exponentiation is the cornerstone of what is called the RSA system.

### Concentration of points on two and three dimensional modular hyperbolas and applications

Concentration of points on two and three dimensional modular hyperbolas and applications J. Cilleruelo Instituto de Ciencias Matemáticas (CSIC-UAM-UC3M-UCM) and Departamento de Matemáticas Universidad

### Some practice problems for midterm 2

Some practice problems for midterm 2 Kiumars Kaveh November 15, 2011 Problem: What is the remainder of 6 2000 when divided by 11? Solution: This is a long-winded way of asking for the value of 6 2000 mod

### Handout NUMBER THEORY

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

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

### ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

### RSA and Primality Testing

and Primality Testing Joan Boyar, IMADA, University of Southern Denmark Studieretningsprojekter 2010 1 / 81 Correctness of cryptography cryptography Introduction to number theory Correctness of with 2