Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 are given to divisibility tests and to block ciphers in cryptography. Modular arithmetic lets us carry out algebraic calculations on integers with a systematic disregard for terms divisible by a certain number (called the modulus). This kind of reduced algebra is essential background for the mathematics of computer science, coding theory, primality testing, and much more. 2. Integer congruences The following definition was introduced by Gauss in his Disquisitiones Arithmeticae (Arithmetic Investigations) in 80. Definition 2. (Gauss). Let m be an integer. For a, b Z, we write a b mod m and say a is congruent to b modulo m if m (a b). Example 2.2. Check 8 4 mod 7, 20 3 mod, and 9 3 mod 2. Remark 2.3. The parameter m is called the modulus, not the modulo. We always have m 0 mod m, and more generally mk 0 mod m for any k Z. In fact, a 0 mod m m a, so the congruence relation includes the divisibility relation as a special case: the multiples of m are exactly the numbers that look like 0 modulo m. Because multiples of m are congruent to 0 modulo m, we will see that working with integers modulo m is tantamount to systematically ignoring additions and subtractions by multiples of m in algebraic calculations. Since a b mod m if and only if b = a + mk for some k Z, adjusting an integer modulo m is the same as adding (or subtracting) multiples of m to it. Thus, if we want to find a positive integer congruent to 8 mod 5, we can add a multiple of 5 to 8 until we go positive. Adding 20 does the trick: = 2, so 8 2 mod 5 (check!). There is a useful analogy between integers modulo m and angle measurements (in radians, say). In both cases, the objects involved admit different representations, e.g., the angles 0, 2π, and 4π are the same, just as mod 5.

2 2 KEITH CONRAD Every angle can be put in standard form as a real number in the interval [0, 2π). There is a similar convention for the standard representation of an integer modulo m using remainders, as follows. Theorem 2.4. Let m Z be a nonzero integer. For each a Z, there is a unique r with a r mod m and 0 r < m. Proof. Using division with remainder in Z, there are q and r in Z such that a = mq + r, 0 r < m. Then m (a r), so a r mod m. To show r is the unique number in the range {0,,..., m } that is congruent to a mod m, suppose two numbers in this range work: where 0 r, r < m. Then we have a r mod m, a r mod m, a = r + mk, a = r + ml for some k and l in Z, so the remainders r and r have difference r r = m(l k). This is a multiple of m, and the bounds on r and r tell us r r < m. A multiple of m has absolute value less than m only if it is 0, so r r = 0, which means r = r. Example 2.5. Taking m = 2, every integer is congruent modulo 2 to exactly one of 0 and. Saying n 0 mod 2 means n = 2k for some integer k, so n is even, and saying n mod 2 means n = 2k + for some integer k, so n is odd. We have a b mod 2 precisely when a and b have the same parity: both are even or both are odd. Example 2.6. Every integer is congruent mod 4 to exactly one of 0,, 2, or 3. Congruence mod 4 is a refinement of congruence mod 2: even numbers are congruent to 0 or 2 mod 4 and odd numbers are congruent to or 3 mod 4. For instance, 0 2 mod 4 and 9 3 mod 4. Congruence mod 4 is related to Master Locks. Every combination on a Master Lock is a triple of numbers (a, b, c) where a, b, and c vary from 0 to 39. Each number has 40 choices, with b a and c b (perhaps c = a). This means the number of combinations could be up to = 60840, but in fact the true number of combinations is a lot smaller: every combination has c a mod 4 and b a + 2 mod 4, so once some number in a combination is known the other two numbers are each limited to 0 choices (among the 40 numbers in {0,,..., 39} exactly 0 will be congruent to a particular value mod 4). Thus the real number of Master Lock combinations is = Example 2.7. Every integer is congruent modulo 7 to exactly one of 0,, 2,..., 6. The choice is the remainder when the integer is divided by 7. For instance, 20 6 mod 7 and 32 3 mod 7. Definition 2.8. We call {0,, 2,..., m } the standard representatives for integers modulo m. In practice m > 0, so the standard representatives modulo m are {0,, 2,..., m }. In fact, congruence modulo m and modulo m are the same relation (just look back at the definition), so usually we never talk about negative moduli. Nevertheless, Theorem 2.4 is stated for any modulus m 0 for completeness.

3 MODULAR ARITHMETIC 3 By Theorem 2.4, there are m incongruent integers modulo m. We can represent each integer modulo m by one of the standard representatives, just like we can write any fraction in a reduced form. There are many other representatives which could be used, however, and this will be important in the next section. 3. Modular Arithmetic When we add and multiply fractions, we can change the representation (that is, use a different numerator and denominator) and the results are the same. We will meet a similar idea with addition and multiplication modulo m. Theorem 3.. If a b mod m and b c mod m then a c mod m. Proof. By hypothesis, a b = mk and b c = ml for some integers k and l. Adding the equations, a c = m(k + l) and k + l Z, so a c mod m. This result is called transitivity of congruences. We will usually use it without comment in our calculations below. The following theorem is the key algebraic feature of congruences in Z: they behave well under addition and multiplication. Theorem 3.2. If a b mod m and c d mod m, then a + c b + d mod m and ac bd mod m. Proof. We want to show (a + c) (b + d) and ac bd are multiples of m. Write a = b + mk and c = d + ml for k and l in Z. Then so a + c b + d mod m. For multiplication, (a + c) (b + d) = a b + c d = m(k + l), so ac bd mod m. ac bd = (b + mk)(d + ml) bd = m(kd + bl + mkl), Example 3.3. Check 5 mod 6, 2 4 mod 6, and ( 2) 5 4 mod 6. Example 3.4. What is the standard representative for 7 2 mod 9? You could compute 7 2 = 289 and then divide 289 by 9 to find a remainder of 4, so mod 9. Another way is to notice 7 2 mod 9, so 7 2 ( 2) 2 4 mod 9. That was quicker, and it illustrates the meaning of multiplication being independent of the choice of representative. Sometimes one representative can be more convenient than another. Example 3.5. If we want to compute 0 4 mod 9, compute successive powers of 0 but reduce modulo 9 each time the answer exceeds 9: using the formula 0 k = 0 0 k and writing for congruence modulo 9, 0 = 0, 0 2 = 00 5, = 50 2, = Thus mod 9. Theorem 3.2 says this kind of procedure leads to the right answer, since multiplication modulo 9 is independent of the choice of representatives, so we can always replace a larger integer with a smaller representative of it modulo 9 without affecting the results of (further) algebraic operations modulo 9.

4 4 KEITH CONRAD When we add and multiply modulo m, we are carrying out modular arithmetic. That addition and multiplication can be carried out on integers modulo m without having the answer change (modulo m) if we replace an integer by a congruent integer is similar to other computations in mathematics. In elementary school, you learned that addition and multiplication of fractions is independent of the particular choice of numerator and denominator for the fractions, e.g., /2 + 3/5 = /0 and 2/4 + 9/5 = 66/60 = /0. In calculus, the formula b a f(x) dx = F (b) F (a) for definite integrals is independent of the choice of antiderivative F (x) for f(x): any two antiderivatives for f(x) on [a, b] differ by a constant, so the difference F (b) F (a) doesn t change if we change F (x) to another antiderivative of f(x): (F (b) + C) (F (a) + C) = F (b) F (a). Definition 3.6. The set of integers modulo m under addition and multiplication is denoted Z/(m). Other notations you may meet for Z/(m) are Z m and Z/mZ. Example 3.7. Here are the elements of Z/(5): {..., 5, 0, 5, 0, 5, 0, 5,... }, {..., 4, 9, 4,, 6,, 6,... }, {..., 3, 8, 3, 2, 7, 2, 7,... }, {..., 2, 7, 2, 3, 8, 3, 8,... }, {...,, 6,, 4, 9, 4, 9,... }. These five sets each consist of all the integers congruent to each other modulo 5, so each set is called a congruence class (modulo 5). In practice we often use one representative from each congruence class to stand for the whole congruence class. In bold type is one set of representatives for the congruence classes modulo 5 the choice 0,, 2, 3, and 4 which is the standard one. Another set of representatives is 5, 6, 3, 8, and 6 (since 5 0 mod 5, 6 mod 5, 3 2 mod 5, and so on). Different integers in the same congruence class are analogous to different real numbers (like π and 3π) representing the same angle. They re different ways of representing the same thing, except you ve known about angles long enough that you are comfortable thinking of π and 3π as the same in the setting of angles even though they are not the same as real numbers. We need to think this way about congruence classes: as integers and 6 are not the same but they become the same when we think modulo First application: Divisibility tests A basic application of modular arithmetic is the explanation of divisibility tests in terms of digits. We will look at three such tests. They describe when a positive integer n is divisible by certain numbers in terms of its base 0 expansion (4.) n = c k 0 k + c k 0 k + + c 0 + c 0, where 0 c i 9. For example, n = 7405 has c 3 = 7, c 2 = 4, c = 0, and c 0 = 5. Theorem 4.. The number n is divisible by 3 if and only if the sum of its digits k i=0 c i is divisible by 3.

5 MODULAR ARITHMETIC 5 Proof. To say n is divisible by 3 is the same as saying n 0 mod 3. Thus, we will show n 0 mod 3 if and only if k i=0 c i 0 mod 3. The key point is this: 0 mod 3. Multiplying both sides of this congruence by themselves, mod 3, so 0 2 mod 3. In the same way, 0 i mod 3 for all i 0 by induction. Then c k 0 k + c k 0 k + + c 0 + c 0 c k + c k + + c + c 0 mod 3 since each 0 i can be replaced with when we work mod 3. Since 3 n if and only if n 0 mod 3, which is equivalent to k i=0 c i 0 mod 3, n being divisible by 3 is equivalent to the sum of the digits of n being divisible by 3. Example 4.2. Let n = The sum of the digits is = 24, which is divisible by 3, so is divisible by 3. Indeed, = Theorem 4.3. The number n is divisible by 9 if and only if the sum of its digits k i=0 c i is divisible by 9. Proof. The only important property of 3 in the proof of Theorem 4. was the condition 0 mod 3. Since 0 mod 9 too, we get the same test for divisibility by 9 as we did for divisibility by 3, with the same proof. Example 4.4. Again taking n = 84435, the sum of the digits is 24, which is not divisible by 9, so n is not divisible by 9 either. In fact, leaves a remainder of 6 when divided by 9: = Theorem 4.5. The number n is divisible by if and only if the alternating sum of its digits k i=0 ( )i c i is divisible by. Proof. We know n is divisible by if and only if n 0 mod. Write n as in (4.). Since 0 mod, we can rewrite the base 0 expansion of n, viewed modulo, as n c k ( ) k + c k ( ) k + + c ( ) + c 0 mod. This is the alternating sum of the digits, so n 0 mod if and only if the alternating sum of the digits is 0 mod, which means the alternating sum is divisible by. Example 4.6. If n = 84d35, which digit d permits n? We need d mod, or equivalently 6 + d 0 mod. Then d 5 mod, so we need d = 5 since d is a decimal digit. Thus is a multiple of. As an explicit check, = Solving equations in Z/(m) In school you learned how to solve polynomial equations like 2x+3 = 8 or x 2 3x+ = 0 by the rules of algebra : cancellation (if a 0 and ax = ay then x = y), equals plus equals are equal, and so on. When an equation has no simple formula for its solutions, you might graph the equation and estimate the solution numerically. This is all in the setting of equations over the real numbers. We can also try to solve polynomial equations in modular arithmetic, counting solutions as different if they are incongruent to each other. We will focus on the simplest case of a linear congruence ax b mod m. Already in this case we will meet some phenomena with no parallel in the case of a real linear equation (Examples 5.2 and 5.3 below).

6 6 KEITH CONRAD Example 5.. Let s try to solve a linear congruence: find a solution to 8x mod. If there is an answer, it can be represented by one of 0,, 2,..., 0, so we can just run through the possibilities: x mod x mod The only solution is 7 mod : 8 7 = 56 mod. This means 7 and 8 are multiplicative inverses in Z/(). This problem concerns finding an inverse for 8 modulo. We can find multiplicative inverses for every nonzero element of Z/(): x x Check in each case that the product of the numbers in each column is in Z/(). Example 5.2. Find a solution to 8x mod 0. We run through the standard representatives for Z/(0), and find no answer: x x In retrospect, we can see a priori why there shouldn t be an answer. If 8x mod 0 for some integer x, then we can lift the congruence up to Z in the form 8x + 0y = for some y Z. But this is absurd: 8x and 0y are even, so the left side is a multiple of 2 but the right side is not. Example 5.3. The linear congruence 6x + 4 mod 5 has three solutions! following table we can see the solutions are 3, 8, and 3: x x In the These examples show us that a linear congruence ax b mod m doesn t have to behave like real linear equations: there may be no solutions or more than one solution. In particular, taking b =, we can t always find a multiplicative inverse for each nonzero element of Z/(m). The obstruction to inverting 8 in Z/(0) can be extended to other cases in the following way. Theorem 5.4. For integers a and m, the following are equivalent: there is a solution x in Z to ax mod m, there are solutions x and y in Z to ax + my =, a and m are relatively prime. Proof. Suppose ax mod m for some x Z. Then m ( ax), so there is some y Z such that my = ax, so ax + my =. This equation implies a and m are relatively prime since any common factor of a and m divides ax + my. Finally, if a and m are relatively prime then by Bezout s identity (a consequence of back-substituting in Euclid s algorithm) we can write ax + my = for some x and y in Z and reducing both sides mod m implies ax mod m.

7 MODULAR ARITHMETIC 7 This explains Example 5.2, since 8 and 0 have a common factor of 2. Similarly, we see at a glance that there is no solution to 3x mod 5 (common factor of 3) or 35x mod 77 (common factor of 7). Example 5.5. Since (8, ) =, 8 has a multiplicative inverse in Z/(). We found it by an exhaustive search in Example 5., but now we can do it by a more systematic approach: = 8 + 3, 8 = , 3 = 2 +, so = 3 2 = 3 (8 3 2) = = 3 ( 8) 8 = Reducing the equation = modulo, 8( 4) mod. The inverse of 8 in Z/() is 4, or equivalently 7. To summarize: solving for x in the congruence ax mod m is equivalent to solving for integers x and y in the equation ax + my = (be sure you see why!), and the latter equation can be solved without any guesswork by reversing Euclid s algorithm on a and m when (a, m) =. If Euclid s algorithm shows (a, m), then there is no solution. In the real numbers, every nonzero number has a multiplicative inverse. This is not generally true in modular arithmetic: if a 0 mod m it need not follow that we can solve ax mod m. (For instance, 4 0 mod 6 and 4 mod 6 has no multiplicative inverse.) The correct test for invertibility in Z/(m) is (a, m) =, which is generally stronger than a 0 mod m. Although invertibility in Z/(m) is usually not the same as being nonzero in Z/(m), there is an important case when these two ideas agree: m is prime. Corollary 5.6. For a prime number p, an integer a is invertible in Z/(p) if and only if a 0 mod p. Proof. If a mod p is invertible, then (a, p) =, so p does not divide a. For the converse direction, suppose a 0 mod p. We show (a, p) =. Since (a, p) is a (positive) factor of p, and p is prime, (a, p) is either or p. (The proof would break down here if p were not prime.) Since p does not divide a, (a, p) p, so (a, p) =. Therefore the congruence ax mod p has a solution. The upshot of Corollary 5.6 is that our intuition from algebra over R carries over quite well to algebra over Z/(p): every nonzero number has a multiplicative inverse in the system. This is not true of Z/(m) for composite m, and that is why modular arithmetic in a composite modulus requires more care. Why should we care about inverting integers in Z/(m)? (By inverting we always mean inverting multiplicatively. ) One reason is its connection to inverting matrices with

8 8 KEITH CONRAD entries in Z/(m). Given a square n n matrix A with entries in Z/(m), your experience with linear algebra in R may suggest a matrix with entries in Z/(m) is invertible whenever its determinant is nonzero in Z/(m). But this is false. Example 5.7. We work with matrices having entries in Z/(0). Let A = ( 3 ). The determinant of A is 2 8 mod 0, so det A 0 mod 0. However, there is no inverse for A as a mod 0 matrix. We can see why by contradiction. Suppose there is an inverse matrix, and call it B. Then AB ( 0 0 ) mod 0. (Congruence of matrices means congruence of corresponding matrix entries on both sides.) Writing B = ( x y z t ), we compute AB to get x+3z y+3t ( x+z y+t ) ( 0 0 ) mod 0. Then x + 3z mod 0 and x + z 0 mod 0. The second congruence says x z mod 0, and replacing x with z in the first congruence yields 2z mod 0. But that s absurd: 2z is even and is odd, so 2z mod 0. (Said differently, if 2z mod 0 then 2z = + 0y for some integer y, so 2z 0y =, but the left side is even and is not even.) As a real matrix, A is invertible and A /2 3/2 = ( ). This inverse makes no sense if /2 /2 we try to reduce it modulo 0 (what is /2 mod 0?!?), and that suggests there should be a problem if we try to invert A as a mod 0 matrix. Let s look at determinants behave in modular arithmetic. Suppose n n matrices A and B satisfy AB I n mod m. Taking determinants of both sides tells us (by Theorem 3.2) that (det A)(det B) mod m, so det A is invertible in Z/(m). Invertibility of det A in Z/(m) is usually a stronger condition than det A 0 mod m. For instance, the 2 2 matrix A in Example 5.7 has determinant 8 mod 0, which is not invertible. Thus the matrix A is not invertible mod 0. That sure is an easier way to see A is not invertible than the tedious matrix calculations in Example 5.7! Example 5.8. Let m = 4 and A = ( ) as a matrix with entries in Z/(4). The determinant of A is 2 2 = 0 4 mod 4, which is not invertible. Even though A has a nonzero determinant, there is no matrix inverse for A over Z/(4). We now see that we have to be able to recognize invertible elements of Z/(m) before we can recognize invertible matrices over Z/(m), because an invertible matrix will have an invertible determinant. If we want to do linear algebra over Z/(m) then we need Euclid s algorithm (and Bezout s identity) to invert determinants. 6. Block ciphers This last section gives a cryptographic application of linear algebra over Z/(m). In cryptography, we are interested in various methods of encoding and decoding text. The simplest idea, going back to Julius Caesar, is called a shift cipher. Simply pick an integer c and encode a letter by replacing it with the letter c places further along in the alphabet (wrap around to the start of the alphabet from the end if necessary). For instance, if we shift by 3, then we have The message A D, B E, C F,..., Z C. DOODLE

9 is encoded as The encoded message is decoded by shifting back by 3 letters to MODULAR ARITHMETIC 9 GRRGOH. XKFJXI ANIMAL. The Caesar cipher has two critical flaws. First of all, since there are only 26 shifts, an adversary (who knows or suspects that the message was encoded with the Caesar cipher) can simply decode the message with each of the 26 possible shifts until a meaningful decryption is found. The second problem, which is illustrated in the examples above, is that a letter gets encoded to the same letter every time. A cipher with this feature (called a simple substitution cipher, whether or not the substitutions come from a cyclic shift of the alphabet) is easily cracked by taking into account the frequency of letters in ordinary English text. For instance, the most common letter in ordinary English text is E, so the most common letter in a text (of reasonable length) encoded by a simple substitution cipher is probably the encrypted form of the letter E. Before moving on to other cryptographic methods, we describe the Casesar cipher using modular arithmetic. Identify the letters of the alphabet with two-digit strings: (6.) A = 0, B = 02,..., Z = 26. View the letters as elements of Z/(26). The shift by 3, say, is the encryption function E(x) x + 3 mod 26. It is decrypted with D(y) y 3 mod 26. We can get something a bit more mathematically interesting than a shift cipher by allowing scaling before translating: E(x) = ax + b, where (a, 26) =. A plain shift has a =. Suppose a = 5 and b = 3. Then E(x) 5x+3 mod 26, so letting x =, 2, 3,..., 25, 0 gives the encoding A H, B M,..., Z C. The decryption is based on inverting a linear function: If y = 5x + 3, then x = (/5)(y 3). In Z/(26), the inverse of 5 is 2 (check!), so the decryption function is D(y) = 2(y 3) = 2y + 5 (because 2( 3) = 36 5 mod 26). Using E(x) = 5x + 3 on Z/(26), check the encrypted version of DOODLE is now WZZWKB. While the introduction of the scaling before we shift enlarges the number of possible ciphers, we are still encoding one letter at a time, and each letter gets encoded in the same way no matter where it appears in the text, so a frequency analysis on a moderate amount of text would let us determine the scaling and shift parameters. We now use linear algebra over Z/(26) to encode blocks of text. This is called a block cipher. We will describe the idea using two-letter blocks. For instance, becomes DOODLE DO OD LE. Each block can be viewed as a column vector over Z/(26): ( ) ( ) ( ) ( ) ( ) ( ) D 4 O 5 L 2 =, =, =. O 5 D 4 E 5

10 0 KEITH CONRAD Pick a 2 2 matrix over Z/(26). For concreteness, take ( ) 3 2 A =. Our encoding algorithm will be the product of A with each vector, calculations being made modulo 26: ( ) ( ) ( ) ( ) ( ) ( ) A =, A =, A = Turning each coordinate back into a letter, the encoded form of DOODLE is PMAGTO. Notice that the two D s in DOODLE, as well as the two O s, have been encoded by different letters. (Why did this happen?) Clearly this is a desirable feature from a security standpoint. Suppose we received the message UPFOOU and we know it was encoded by multiplication by the above matrix A = ( 3 2 ). Since encoding is E(v) = Av, decoding is achieved by multiplication by the inverse of A: D(v) = A v. When is a 2 2 matrix invertible? In a first linear algebra course you learn that a (square) matrix with real entries is invertible precisely when its determinant is nonzero, and in the 2 2 case ( a b c d ) has inverse ad bc ( d b c a For matrices with entries in Z/(m), the rule for invertibility of a matrix is not that the determinant is nonzero. For example, taking m = 26, the matrix ( ) has determinant 2 24 mod 26, which is not 0 mod 26, but this matrix is not invertible mod 26: for no 2 2 matrix M is ( )M ( 0 0 ) mod 26. Theorem 6.. A 2 2 matrix with entries in Z/(m) has an inverse precisely when its determinant is invertible in Z/(m), in which case its inverse is given by the same formula as in the real case. Proof. Let A be the matrix. If A has an inverse matrix B, so AB ( 0 0 ) mod m, then taking determinants of both sides implies (det A)(det B) mod m. Therefore det A is invertible in Z/(m). Conversely, if det A is invertible in Z/(m) then the familiar inverse matrix formula from (real) linear algebra actually makes sense if we apply it to the mod m matrix A and a direct calculation shows the formula works as an inverse. The matrix A = ( 3 2 ) over Z/(26) has determinant 3 5 mod 26. The inverse of this determinant (in Z/(26)) is 2. Therefore ( ) ( ) A = Call this matrix B. (Check AB = I 2 and BA = I 2.) The endoded message UPFOOU has blocks ( ) ( ) ( ) ( ) ( ) ( ) U 2 F 6 O 5 =, =, =, P 6 O 5 U 2 ).

11 MODULAR ARITHMETIC so we decode by multiplying each vector by B on the left: ( ) ( ) ( ) ( ) ( ) B =, B =, B = ( ) Putting the output blocks back together and converting them into letters gives the decoded message: SUBMIT. Of course, 2-block ciphers can be cracked using a frequency analysis on pairs of letters rather than on individual letters. (As an example, Q is almost always followed by U in English.) The idea of a 2-block cipher easily extends to blocks of greater length, using larger matrices. One difficulty with a block cipher is that knowledge of the encryption and decryption matrices are essentially equivalent: anyone who discovers the encryption matrix can compute its inverse (the decryption matrix) using row reduction or other methods of computing matrix inverses. This means the encryption matrix must be kept secret from your enemies. Until the 970s, everyone (outside US and British intelligence) thought that encryption and decryption using any cipher would be more or less symmetric processes. But this is false: there are cryptographic algorithms where the encryption process can be made public to the whole world and decryption is still secure. Number theory is a source of such algorithms which are used in e-commerce, ATM transactions, cell phone communications, etc. We end with some exercises.. Explain why the matrix ( 5 ) 3 7 can t be used in a 2-block cipher. (Hint: Try to invert the matrix over Z/(26).) 2. Messages are encoded in blocks of length 2 using ( ) 4. 3 You receive the encrypted message AAOGIXZC. What is the original message, in plain English?

### NUMBER THEORY AND CRYPTOGRAPHY

NUMBER THEORY AND CRYPTOGRAPHY KEITH CONRAD 1. Introduction Cryptography is the study of secret messages. For most of human history, cryptography was important primarily for military or diplomatic purposes

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

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

### ORDERS OF ELEMENTS IN A GROUP

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

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

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

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

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

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

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

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

### CHAPTER 5: MODULAR ARITHMETIC

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

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

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

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

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

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

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

### THE GAUSSIAN INTEGERS

THE GAUSSIAN INTEGERS KEITH CONRAD Since the work of Gauss, number theorists have been interested in analogues of Z where concepts from arithmetic can also be developed. The example we will look at in

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

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

### The Euclidean algorithm for integers leads to the notion of congruence of two integers modulo a given integer.

Integers Modulo m The Euclidean algorithm for integers leads to the notion of congruence of two integers modulo a given integer. Congruence Modulo m Two integers a and b are congruent modulo m if and only

### 9 abcd = dcba. 9 ( b + 10c) = c + 10b b + 90c = c + 10b b = 10c.

In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should

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

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

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

### 3 Congruence arithmetic

3 Congruence arithmetic 3.1 Congruence mod n As we said before, one of the most basic tasks in number theory is to factor a number a. How do we do this? We start with smaller numbers and see if they divide

### Equivalence relations

Equivalence relations A motivating example for equivalence relations is the problem of constructing the rational numbers. A rational number is the same thing as a fraction a/b, a, b Z and b 0, and hence

### V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography

V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography 3 Congruence Congruences are an important and useful tool for the study of divisibility. As we shall see, they are also critical

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

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

3. QUADRATIC CONGRUENCES 3.1. Quadratics Over a Finite Field We re all familiar with the quadratic equation in the context of real or complex numbers. The formula for the solutions to ax + bx + c = 0 (where

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### MATH 321 EQUIVALENCE RELATIONS, WELL-DEFINEDNESS, MODULAR ARITHMETIC, AND THE RATIONAL NUMBERS

MATH 321 EQUIVALENCE RELATIONS, WELL-DEFINEDNESS, MODULAR ARITHMETIC, AND THE RATIONAL NUMBERS ALLAN YASHINSKI Abstract. We explore the notion of well-definedness when defining functions whose domain is

### Section 2.1: Shift Ciphers and Modular Arithmetic

1 Section 2.1: Shift Ciphers and Modular Arithmetic Practice HW from Barr Textbook (not to hand in) p.66 # 1, 2, 3-6, 9-12, 13, 15 The purpose of this section is to learn about modular arithmetic, which

### Practice Problems for First Test

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

### Topics in Number Theory

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

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

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

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

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

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

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

### DIVISIBILITY AND GREATEST COMMON DIVISORS

DIVISIBILITY AND GREATEST COMMON DIVISORS KEITH CONRAD 1 Introduction We will begin with a review of divisibility among integers, mostly to set some notation and to indicate its properties Then we will

### UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

### ARITHMETIC PROGRESSIONS OF FOUR SQUARES

ARITHMETIC PROGRESSIONS OF FOUR SQUARES KEITH CONRAD 1. Introduction Suppose a, b, c, and d are rational numbers such that a 2, b 2, c 2, and d 2 form an arithmetic progression: the differences b 2 a 2,

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

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

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

### Hill s Cipher: Linear Algebra in Cryptography

Ryan Doyle Hill s Cipher: Linear Algebra in Cryptography Introduction: Since the beginning of written language, humans have wanted to share information secretly. The information could be orders from a

### Fibonacci Numbers Modulo p

Fibonacci Numbers Modulo p Brian Lawrence April 14, 2014 Abstract The Fibonacci numbers are ubiquitous in nature and a basic object of study in number theory. A fundamental question about the Fibonacci

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### COSETS AND LAGRANGE S THEOREM

COSETS AND LAGRANGE S THEOREM KEITH CONRAD 1. Introduction Pick an integer m 0. For a Z, the congruence class a mod m is the set of integers a + mk as k runs over Z. We can write this set as a + mz. This

### Math 139 Problem Set #6 Solution 15 April 2003

Math 139 Problem Set #6 Solution 15 April 2003 A1 (Based on Barr, 41, exercise 3) (a) Let n be an integer greater than 2 Consider the list of numbers n! + 2, n! + 3, n! + 4,, n! + n Explain why all the

### Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

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

### An Introduction to Hill Ciphers Using Linear Algebra

An Introduction to Hill Ciphers Using inear Algebra Brian Worthington October 26, 2010 University of North Texas MATH 2700.002 1 Contents 1 Introduction 3 1.1 Substitution Ciphers.........................

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

### 1111: Linear Algebra I

1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 3 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 3 1 / 12 Vector product and volumes Theorem. For three 3D vectors u, v, and w,

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

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

### Math 2331 Linear Algebra

2.2 The Inverse of a Matrix Math 2331 Linear Algebra 2.2 The Inverse of a Matrix Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math2331 Jiwen He, University

### MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted

### Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M 1 such that

0. Inverse Matrix Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M such that M M = I = M M. Inverse of a 2 2 Matrix Let M and N be the matrices: a b d b M =, N = c

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

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

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

### A farmer raises rabbits. Each rabbit gives birth when 2 months old and then each month there after.

Fibonacci Problem: A farmer raises rabbits. Each rabbit gives birth when 2 months old and then each month there after. Question: How many rabbits will the farmer have after n months? Try it on small numbers.

### Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

### Fractions and Decimals

Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first

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

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

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

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

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

### Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur

Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Module No. # 01 Lecture No. # 05 Classic Cryptosystems (Refer Slide Time: 00:42)

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

### 1) A very simple example of RSA encryption

Solved Examples 1) A very simple example of RSA encryption This is an extremely simple example using numbers you can work out on a pocket calculator (those of you over the age of 35 45 can probably even

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### Solving Linear Diophantine Matrix Equations Using the Smith Normal Form (More or Less)

Solving Linear Diophantine Matrix Equations Using the Smith Normal Form (More or Less) Raymond N. Greenwell 1 and Stanley Kertzner 2 1 Department of Mathematics, Hofstra University, Hempstead, NY 11549

### Course notes on Number Theory

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

### POLYTECHNIC UNIVERSITY Department of Computer and Information Science. The Hill Cipher. K. Ming Leung

POLYTECHNIC UNIVERSITY Department of Computer and Information Science The Hill Cipher K. Ming Leung Abstract: The Hill cipher in cryptography is used to illustrate the application of matrices defined over

### 2 The Euclidean algorithm

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

### An Introduction to Galois Fields and Reed-Solomon Coding

An Introduction to Galois Fields and Reed-Solomon Coding James Westall James Martin School of Computing Clemson University Clemson, SC 29634-1906 October 4, 2010 1 Fields A field is a set of elements on

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

### Complex Numbers and the Complex Exponential

Complex Numbers and the Complex Exponential Frank R. Kschischang The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto September 5, 2005 Numbers and Equations

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

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

### Lecture 6. Inverse of Matrix

Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that

### Geometry and Arithmetic

Geometry and Arithmetic Alex Tao 10 June 2008 1 Rational Points on Conics We begin by stating a few definitions: A rational number is a quotient of two integers and the whole set of rational numbers is

### Shared Secret = Trust

Trust The fabric of life! Holds civilizations together Develops by a natural process Advancement of technology results in faster evolution of societies Weakening the natural bonds of trust From time to

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

### Tangent and normal lines to conics

4.B. Tangent and normal lines to conics Apollonius work on conics includes a study of tangent and normal lines to these curves. The purpose of this document is to relate his approaches to the modern viewpoints

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

Chapter 6 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,

### Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that

### The Inverse of a Matrix

The Inverse of a Matrix 7.4 Introduction In number arithmetic every number a ( 0) has a reciprocal b written as a or such that a ba = ab =. Some, but not all, square matrices have inverses. If a square

### CHAPTER 2. Inequalities

CHAPTER 2 Inequalities In this section we add the axioms describe the behavior of inequalities (the order axioms) to the list of axioms begun in Chapter 1. A thorough mastery of this section is essential

### ARITHMETIC PROGRESSIONS OF THREE SQUARES

ARITHMETIC PROGRESSIONS OF THREE SQUARES KEITH CONRAD 1 Introduction Here are the first 10 perfect squares (ignoring 0): 1, 4, 9, 16, 25, 36, 49, 64, 81, 100 In this list is the arithmetic progression

### PROBLEM SET # 2 SOLUTIONS

PROBLEM SET # 2 SOLUTIONS CHAPTER 2: GROUPS AND ARITHMETIC 2. Groups.. Let G be a group and e and e two identity elements. Show that e = e. (Hint: Consider e e and calculate it two ways.) Solution. Since

### Advanced Higher Mathematics Course Assessment Specification (C747 77)

Advanced Higher Mathematics Course Assessment Specification (C747 77) Valid from August 2015 This edition: April 2016, version 2.4 This specification may be reproduced in whole or in part for educational

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

### Chapter 4: Systems of Equations and Ineq. Lecture notes Math 1010

Section 4.1: Systems of Equations Systems of equations A system of equations consists of two or more equations involving two or more variables { ax + by = c dx + ey = f A solution of such a system is an