# Algebra & Number Theory. A. Baker

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Algebra & Number Theory [0/0/2009] A. Baker Department of Mathematics, University of Glasgow. address: URL: ajb

2

3

4 Contents Chapter. Basic Number Theory. The natural numbers 2. The integers 3 3. The Euclidean Algorithm and the method of back-substitution 4 4. The tabular method 6 5. Congruences 8 6. Primes and factorization 7. Congruences modulo a prime 3 8. Finite continued fractions 6 9. Infinite continued fractions 7 0. Diophantine equations 22. Pell s equation 23 Problem Set 25 Chapter 2. Groups and group actions 29. Groups Permutation groups The sign of a permutation 3 4. The cycle type of a permutation Symmetry groups Subgroups and Lagrange s Theorem Group actions 38 Problem Set 2 43 Chapter 3. Arithmetic functions 47. Definition and examples of arithmetic functions Convolution and Möbius Inversion 48 Problem Set 3 52 Chapter 4. Finite and infinite sets, cardinality and countability 53. Finite sets and cardinality Infinite sets Countable sets Power sets and their cardinality The real numbers are uncountable 59 Problem Set 4 6 Index 63

5 CHAPTER Basic Number Theory. The natural numbers The natural numbers 0,, 2,... form the most basic type of number and arise when counting elements of finite sets. We denote the set of all natural numbers by N 0 = {0,, 2, 3, 4,...} and nowadays this is very standard notation. It is perhaps worth remarking that some people exclude 0 from the natural numbers but we will include it since the empty set has 0 elements! We will use the notation Z + for the set of all positive natural numbers Z + = {n N 0 : n 0} = {, 2, 3, 4,...}, which is also often denoted N, although some authors also use this to denote our N 0. We can add and multiply natural numbers to obtain new ones, i.e., if a, b N 0, then a + b N 0 and ab N 0. Of course we have the familiar properties of these operations such as a + b = b + a, ab = ba, a + 0 = a = 0 + a, a = a = a, a0 = 0 = 0a, etc. We can also compare natural numbers using inequalities. Given x, y N 0 exactly one of the following must be true: x = y, x < y, y < x. As usual, if one of x = y or x < y holds then we write x y or y x. Inequality is transitive in the sense that x < y and y < z = x < z. The most subtle aspect of the natural numbers to deal with is the fact that they form an infinite set. We can and usually do list the elements of N 0 in the sequence 0,, 2, 3, 4,... which never ends. One of the most important properties of N 0 is The Well Ordering Principle (WOP): Every non-empty subset S N 0 contains a least element. A least or minimal element of a subset S N 0 is an element s 0 S for which s 0 s for all s S. Similarly, a greatest or maximal element of S is one for which s s 0 for all s S. Notice that N 0 has a least element 0, but has no greatest element since for each n N 0, n + N 0 and n < n +. It is easy to see that least and greatest elements (if they exist) are always unique. In fact, WOP is logically equivalent to each of the two following statements. The Principle of Mathematical Induction (PMI): Suppose that for each n N 0 the statement P (n) is defined and also the following conditions hold: P (0) is true; whenever P (k) is true then P (k + ) is true.

6 2. BASIC NUMBER THEORY Then P (n) is true for all n N 0. The Maximal Principle (MP): Let T N 0 be a non-empty subset which is bounded above, i.e., there exists a b N 0 such that for all t T, t b. Then T contains a greatest element. It is easily seen that two greatest elements must agree and we therefore refer to the greatest element. Theorem.. The following chain of implications holds PMI = WOP = MP = PMI. Hence these three statements are logically equivalent. Proof. PMI = WOP: Let S N 0 and suppose that S has no least element. We will show that S =. Let P (n) be the statement P (n): k / S for all natural numbers k such that 0 k n. Notice that 0 / S since it would be a least element of S. Hence P (0) is true. Now suppose that P (n) is true. If n + S, then since k / S for 0 k n, n + would be the least element of S, contradicting our assumption. Hence, n + / S and so P (n + ) is true. By the PMI, P (n) is true for all n N 0. In particular, this means that n / S for all n and so S =. WOP = MP: Let T N 0 have upper bound b and set Then S is non-empty since for t T, S = {s N 0 : t < s for all t T }. t b < b +, so b + S. If s 0 is a least element of S, then there must be an element t 0 T such that s 0 t 0 ; but we also have t 0 < s 0. Combining these we see that s 0 = t 0 T. Notice also that for every t T, t < s 0, hence t s 0. Thus t 0 is the desired greatest element. MP = PMI: Let P (n) be a statement for each n N 0. Suppose that P (0) is true and for n N 0, P (n) = P (n + ). Suppose that there is an m N 0 for which P (m) is false. Consider the set T = {t N 0 : P (n) is true for all natural numbers n satisfying 0 n t}. Notice that T is bounded above by m, since if m k, k / T. Let t 0 be the greatest element of T, which exists thanks to the MP. Then P (t 0 ) is true by definition of T, hence by assumption P (t 0 + ) is also true. But then P (n) is true whenever 0 n t 0 +, hence t 0 + T, contradicting the fact that t 0 was the greatest element of T. Hence, P (n) must be true for all n N 0. An important application of these equivalent results is to proving the following property of the natural numbers. Theorem.2 (Long Division Property). Let n, d N 0 with 0 < d. Then there are unique natural numbers q, r N 0 satisfying the two conditions n = qd + r and 0 r < d. Proof. Consider the set T = {t N 0 : td n} N 0.

7 2. THE INTEGERS 3 Then T is non-empty since 0 T. Also, for t T, t td, hence t n. So T is bounded above by n and hence has a greatest element q. But then qd n < (q + )d. Notice that if r = n qd, then 0 r = n qd < (q + )d qd = d. To prove uniqueness, suppose that q, r is a second such pair. Suppose that r r. By interchanging the pairs if necessary, we can assume that r < r. Since n = qd + r = q d + r, 0 < r r = (q q )d. Notice that this means q q since d > 0. If q > q, this implies d (q q )d, hence d r r < d r d, and so d < d which is impossible. So q = q which implies that r r = 0, contradicting the fact that 0 < r r. So we must indeed have q = q and r = r. 2. The integers The set of integers is Z = Z + {0} Z = N 0 Z, where Z + = {n N 0 : 0 < n}, Z = {n : n Z + }. We can add and multiply integers, indeed, they form a basic example of a commutative ring. We can generalize the Long Division Property to the integers. Theorem.3. Let n, d Z with 0 d. Then there are unique integers q, r Z for which 0 r < d and n = qd + r. Proof. If 0 < d, then we need to show this for n < 0. By Theorem.2, we have unique natural numbers q, r with 0 r < d and n = q d + r. If r = 0 then we take q = q and r = 0. If r 0 then take q = q and r = d r. Finally, if d < 0 we can use the above with d in place of d and get n = q ( d) + r and then take q = q. Once again, it is straightforward to verify uniqueness. Given two integers m, n Z we say that m divides n and write m n if there is an integer k Z such that n = km; we also say that m is a divisor of n. If m does not divide n, we write m n. Given two integers a, b not both 0, an integer c is a common divisor or common factor of a and b if c a and c b. A common divisor h is a greatest common divisor or highest common factor if for every common divisor c, c h. If h, h are two greatest common divisors of a, b, then h h and h h, hence we must have h = ±h. For this reason it is standard to refer to the greatest common divisor as the positive one. We can then unambiguously write gcd(a, b) for this number. Later we will use Long Division to determine gcd(a, b). Then a and b are coprime if gcd(a, b) =, or equivalently that the only common divisors are ±. There are many useful algebraic properties of greatest common divisors. Here is one while others can be found in Problem Set. Proposition.4. Let h be a common divisor of the integers a, b. Then for any integers x, y we have h (xa + yb). In particular this holds for h = gcd(a, b). Proof. If we write a = uh and b = vh for suitable integers u, v, then xa + yb = xuh + yvh = (xu + yv)h, and so h (xa + yb) since (xu + yv) Z.

8 4. BASIC NUMBER THEORY Theorem.5. Let a, b be integers, not both 0. Then there are integers u, v such that gcd(a, b) = ua + vb. Proof. We might as well assume that a 0 and set h = gcd(a, b). Let S = {xa + yb : x, y Z, 0 < xa + yb} N 0. Then S is non-empty since one of (±)a is positive and hence is in S. By the Well Ordering Principle, there is a least element d of S, which can be expressed as d = u 0 a + v 0 b for some u 0, v 0 Z. By Proposition.4, we have h d; hence all common divisors of a, b divide d. Using Long Division we can find q, r Z with 0 r < d satisfying a = qd + r. But then r = a qd = ( qu 0 )a + ( qv 0 )b, hence r S or r = 0. Since r < d with d minimal, this means that r = 0 and so d a. A similar argument also gives d b. So d is a common divisor of a, b which is divisible by all other common divisors, so it must be the greatest common divisor of a, b. This result is theoretically useful but does not provide a practical method to determine gcd(a, b). Long Division can be used to set up the Euclidean Algorithm which actually determines the greatest common divisor of two non-zero integers. 3. The Euclidean Algorithm and the method of back-substitution Let a, b Z be non-zero. Set n 0 = a, d 0 = b. Using Long Division, choose integers q 0 and r 0 such that 0 r 0 < d 0 and n 0 = q 0 d 0 + r 0. Now set n = d 0, d = r 0 0 and choose integers q, r such that 0 r < d and n = q d + r. We can repeat this process, at the k-th stage setting n k = d k, d k = r k and choosing integers q k, r k for which 0 r k < d k and n k = q k d k + r k. This is always possible provided r k = d k 0. Notice that 0 r k < r k < r < r 0 = b, hence we must eventually reach a value k = k 0 for which d k0 0 but r k0 = 0. The sequence of equations n 0 = q 0 d 0 + r 0, n = q d + r,. n k0 2 = q k0 2d k0 2 + r k0 2, n k0 = q k0 d k0 + r k0, n k0 = q k0 d k0, allows us to express each r k = d k+ in terms of n k, r k. For example, we have Using this repeatedly, we can write r k0 = n k0 q k0 d k0 = n k0 q k0 r k0 2. d k0 = un 0 + vr 0 = ua + vb. Thus we can express d k0 as an integer linear combination of a, b. By Proposition.4 all common divisors of the pair a, b divide d k0. It is also easy to see that d k0 n k0, d k0 n k0,..., r 0 n 0,

9 3. THE EUCLIDEAN ALGORITHM AND THE METHOD OF BACK-SUBSTITUTION 5 from which it follows that d k0 also divides a and b. Hence the number d k0 is the greatest common divisor of a and b. So the last non-zero remainder term r k0 = d k0 produced by the Euclidean Algorithm is gcd(a, b). This allows us to express the greatest common divisor of two integers as a linear combination of them by the method of back-substitution. Example.6. Find the greatest common divisor of 60 and 84 and express it as an integral linear combination of these numbers. Solution. Since the greatest common divisor only depends on the numbers involved and not their order, we might as take the larger one first, so set a = 84 and b = 60. Then 84 = , 24 = 84 + ( ) 60, 60 = , 2 = 60 + ( 2) 24, 24 = 2 2, 2 = gcd(60, 84). Working back we find 2 = 60 + ( 2) 24 = 60 + ( 2) (84 + ( ) 60) = ( 2) Thus gcd(60, 84) = 2 = ( 2) 84. Example.7. Find the greatest common divisor of 90 and 72, and express it as an integral linear combination of these numbers. Solution. Taking a = 90, b = 72 we have 90 = ( 2) ( 72) + 46, 46 = ( 72), 72 = ( 2) , 20 = , 46 = , 6 = , 20 = , 2 = 20 + ( 3) 6, 6 = 3 2, 2 = gcd(90, 72). Working back we find 2 = 20 + ( 3) 6 = 20 + ( 3) ( ), = ( 3) , = ( 3) ( ), = 7 ( 72) + 46, = 7 ( 72) + ( ( 72)), = ( 72). Thus gcd(90, 72) = 2 = ( 72). This could also be done by using the fact that gcd(90, 72) = gcd(90, 72) and proceeding as follows. Example.8. Find the greatest common divisor of 90 and 72 and express it as an integral linear combination of these numbers.

10 6. BASIC NUMBER THEORY Solution. Taking a = 90, b = 72 we have 90 = , 46 = 90 + ( 2) 72, 72 = , 26 = 72 + ( ) 46, 46 = , 20 = 46 + ( ) 26, 26 = , 6 = 26 + ( ) 20, 20 = , 2 = 20 + ( 3) 6, 6 = 3 2, 2 = gcd(90, 72). Working back we find 2 = 20 + ( 3) 6 = 20 + ( 3) (26 + ( ) 20), = ( 3) , = ( 3) (46 + ( ) 26), = ( 7) 26, = ( 7) (72 + ( ) 46), = ( 7) , = ( 7) 72 + (90 + ( 2) 72), = 90 + ( 29) 72. Thus gcd(90, 72) = 2 = 90 + ( 29) 72. From this we obtain gcd(90, 72) = 2 = ( 72). It is usually be more straightforward working with positive a, b and to adjust signs at the end. Notice that if gcd(a, b) = ua + vb, the values of u, v are not unique. For example, ( 72) = 2. In general, we can modify the numbers u, v to u + tb, v ta since (u + tb)a + (v ta)b = (ua + vb) + (tba tab) = (ua + vb). Thus different approaches to determining the linear combination giving gcd(a, b) may well produce different answers. 4. The tabular method This section describes an alternative approach to the problem of expressing gcd(a, b) as a linear combination of a, b. I learnt this method from Francis Clarke of the University of Wales Swansea. The tabular method uses the sequence of quotients appearing in the Euclidean Algorithm and is closely related to the continued fraction method of Theorem.42. The tabular method provides an efficient alternative to the method of back-substitution and can also be used check calculations done by that method.

11 4. THE TABULAR METHOD 7 We will illustrate the tabular method with an example. In the case a = 267, b = 207, the Euclidean Algorithm produces the following quotients and remainders. 267 = , 207 = , 60 = , 27 = , 6 = The last non-zero remainder is 3, so gcd(267, 207) = 3. Back-substitution gives 3 = = 27 4 ( ) = = ( ) = = ( ) = ( 3) In the tabular method we form the following table Here the first row is the sequence of quotients. The second and third rows are determined as follows. The entry t k under the quotient q k is calculated from the formula t k = q k t k + t k 2. So for example, 3 arises as The final entries in the second and third rows always have the form b/ gcd(a, b) and a/ gcd(a, b); here 207/3 = 69 and 267/3 = 89. The previous entries are ±A and B, where the signs are chosen according to whether the number of quotients is even or odd. Why does this give the same result as back-substitution? The arithmetic involved seems very different. In our example, the value 40 arises as in the back-substitution method and as in the tabular method. The key to understanding this is provided by matrix multiplication, in particular the fact that it is associative. Consider the matrix product [ ] [ ] [ ] [ ] [ ]

12 8. BASIC NUMBER THEORY in which the quotients occur as the entries in the bottom right-hand corner. By the associative law, the product can be evaluated either from the right: [ ] [ ] [ ] =, [ ] [ ] [ ] [ ] [ ] [ ] = =, [ ] [ ] [ ] [ ] [ ] [ ] [ ] = =, [ ] [ ] [ ] [ ] [ ] [ ] [ ] [ ] = =, or from the left: [ ] [ ] [ ] =, 3 4 [ ] [ ] [ ] [ ] [ ] [ ] = =, [ ] [ ] [ ] [ ] [ ] [ ] [ ] = =, [ ] [ ] [ ] [ ] [ ] [ ] [ ] [ ] = = Notice that the numbers occurring as the left-hand columns of the first set of partial products are the same (apart from the signs) as the numbers which arose in the back-substitution method. The numbers in the second set of partial products are those in the tabular method. Thus back-substitution corresponds to evaluation from the right and the tabular method to evaluation from the left. This shows that they give the same result. Giving a general proof of this identification of the two methods with matrix multiplication [ ] 0 is not too hard. In fact it becomes obvious given the factorization of the matrix as q [ ] [ ] 0 q the product of two elementary matrices. Two elementary row operations are 0 0 [ ] 0 performed when multiplying by on the left. Firstly q (row 2) is added to row, then q [ ] 0 the two rows are swapped. Multiplication by on the right performs similar column q operations. The determinant of [ ] 0 is and so by the multiplicative property of determinants, q [ ] [ ] [ ] det = ( ) r. q q 2 q r It is this that explains the rule for the choice of signs in the tabular method. The partial products have determinant alternately equal to ±. This provides a useful check on the calculations. 5. Congruences Let n N 0 be non-zero, so n > 0. Then for integers x, y, we say that x is congruent to y modulo n if n (x y) and write x y (mod n) or x n y. Then n is an equivalence relation on

13 Z in the sense that the following hold for x, y, z Z: (Reflexivity) (Symmetry) (Transitivity) 5. CONGRUENCES 9 x n x, x n y = y n x, x n y and y n z = x n z. The set of equivalence classes is denoted Z/n. We will denote the congruence class or residue class of the integer x by x n ; sometimes notation such as x or [x] n is used. Residue classes can be added and multiplied using the formulæ x n + y n = (x + y) n, x n y n = (xy) n. These make sense because if x n = x n and y n = y n, then x + y = x + y + (x x) + (y y) n x + y, x y = (x + (x x))(y + (y y)) = xy + y(x x) + x(y y) + (x x)(y y) n xy. We can also define subtraction by x n y n = (x y) n. These operations make Z/n into a commutative ring with zero 0 n and unity n. Since for each x Z we have x = qn + r with q, r Z and 0 r < n, we have x n = r n, so we usually list the distinct elements of Z/n as 0 n, n, 2 n,..., (n ) n. Theorem.9. Let t Z have gcd(t, n) =. Then there is a unique residue class u n Z/n for which u n t n = n. In particular, the integer u satisfies ut n. Proof. By Theorem.5, there are integers u, v for which ut + vn =. This implies that ut n, hence u n t n = n. Notice that if w n also has this property then w n t n = n which gives hence w n = u n. w n (t n u n ) = (w n t n )u n = u n, We will refer to u as the inverse of t modulo n and u n as the inverse of t n in Z/n. Since ut + vn =, neither t nor u can have a common factor with n. Example.0. Solve each of the following congruences, in each case giving all (if any) integer solutions: (i) 5x 2 7; (ii) 3x 0 6; (iii) 2x 0 8; (iv) 2x 0 7. Solution. (i) By use of the Euclidean Algorithm or inspection, 5 2 = This gives (ii) We have 3 34 = 02 0, hence x x x x (iii) Here gcd(2, 0) = 2, so the above method does not immediately apply. We require that 2(x 4) 0 0, giving (x 4) 5 0 and hence x 5 4. So we obtain the solutions x 0 4 and x 0 9. (iv) This time we have 2x 0 7 so 2x + 0k = 7 for some k Z. This is impossible since 2 (2x + 0k) but 2 7, so there are no solutions. Another important application is to the simultaneous solution of two or more congruence equations to different moduli. The next Lemma is the key ingredient.

14 0. BASIC NUMBER THEORY Lemma.. Suppose that a, b N 0 are coprime and n Z. If a n and b n, then ab n. Proof. Let a and b n and choose r, s Z so that n = ra = sb. Then if ua + vb =, n = n(ua + vb) = nua + nvb = su(ab) + rv(ab) = (su + rv)ab. Since su + rv Z, this implies ab n. Theorem.2 (The Chinese Remainder Theorem). Suppose n, n 2 Z + are coprime and b, b 2 Z. Then the pair of simultaneous congruences has a unique solution modulo n n 2. x n b, x n2 b 2, Proof. Since n, n 2 are coprime, there are integers u, u 2 for which u n + u 2 n 2 =. Consider the integer t = u n b 2 + u 2 n 2 b. Then we have the congruences t n u 2 n 2 b n b, t n2 u n b 2 n2 b 2, so t is a solution for the pair of simultaneous congruences in the Theorem. To prove uniqueness modulo n n 2, note that if t, t are both solutions to the original pair of simultaneous congruences then they satisfy the pair of congruences t n t, t n2 t. By Lemma., n n 2 (t t), implying that t t, so the solution t n n n n 2 Z/n n 2 is unique 2 as claimed. Remark.3. The general integer solution of the pair of congruences of Theorem.2 is x = u n b 2 + u 2 n 2 b + kn n 2 (k Z). Example.4. Solve the following pair of simultaneous congruences modulo 28: 3x 4, 5x 7 2. Solution. Begin by observing that and 3 5 = 5 7, hence the original pair of congruences is equivalent to the pair x 4 3, x 7 6. Using the Euclidean Algorithm or otherwise we find so the solution modulo 28 is ( ) 7 =, x ( ) = 27. Hence the general integer solution is n (n Z). Example.5. Find all integer solutions of the three simultaneous congruences 7x 8, x 3 2, x 5. Solution. We can proceed in two steps. First solve the pair of simultaneous congruences 7x 8, x 3 2

15 6. PRIMES AND FACTORIZATION modulo 8 3 = 24. Notice that 7 2 = 49, so the congruences are equivalent to the pair 8 x 7, x Then as ( ) =, we have the unique solution ( ) = = Now solve the simultaneous congruences x, x Notice that ( ) =, hence the solution is ( ) ( ) This gives for the general integer solution x = n (n Z). 6. Primes and factorization Definition.6. A positive natural number p N 0 for which p > whose only integer factors are ± and ±p is called a prime. Otherwise such a natural number is called composite. Some examples of primes are 2, 3, 5, 7,, 3, 7, 9, 23, 29, 3, 37, 4, 43, 47, 53, 59, 6, 67, 7, 73, 79, 83, 89, 97. Notice that apart from 2, all primes are odd since every even integer is divisible by 2. We begin with an important divisibility property of primes. Theorem.7 (Euclid s Lemma). Let p be a prime and a, b Z. If p ab, then p a or p b. Proof. Suppose that p a. Since gcd(p, a) p, we have gcd(p, a) = or gcd(p, a) = p; but the latter implies p a, contradicting our assumption, thus gcd(p, a) =. Let r, s Z be such that rp + sa =. Then rpb + sab = b and so p b. More generally, if a prime p divides a product of integers a a n then p a j for some j. This can be proved by induction on the number n. Theorem.8 (Fundamental Theorem of Arithmetic). Let n N 0 be a natural number such that n. Then n has a unique factorization of the form n = p p 2 p t, where for each j, p j is a prime and 2 p p 2 p t. Proof. We will prove this using the Well Ordering Principle. Consider the set S = {n N 0 : n and no such factorization exists for n} Now suppose that S. Then by the WOP, S has a least element n 0 say. Notice that n 0 cannot be prime since then it have such a factorization. So there must be a factorization n 0 = uv with u, v N 0 and u, v. Then we have < u < n 0 and < v < n 0, hence u, v / S and so there are factorizations u = p p r, v = q q s for suitable primes p j, q j. From this we obtain n 0 = p p r q q s, and after reordering and renaming we have a factorization of the desired type for n 0.

16 2. BASIC NUMBER THEORY To show uniqueness, suppose that p p r = q q s for primes p i, q j satisfying p p 2 p r and q q 2 q s. Then p r q q s and hence p r q t for some t =,..., s, which implies that p r = q t. Thus we have p p r = q q s, where we q,..., q s is the list q,..., q s with the first occurrence of q t omitted. Continuing this way, we eventually get down to the case where = q q s r for some primes q j. But this is only possible if s = r, i.e., there are no such primes. By considering the sizes of the primes we have p = q, p 2 = q 2,..., p r = q s, which shows uniqueness. We refer to this factorization as the prime factorization of n. Corollary.9. Every natural number n has a unique factorization n = p r pr 2 2 prt t, where for each j, p j is a prime, r j and 2 p < p 2 < < p t. We call this factorization the prime power factorization of n. Proposition.20. Let a, b N 0 be non-zero with prime power factorizations where 0 r j and 0 s j. Then with t j = min{r j, s j }. a = p r pr k k, b = p s ps k k, gcd(a, b) = p t p t k k Proof. For each j, we have p t j j p t p t k k gcd(a, b). If a and p t j j b, hence p t j j gcd(a, b). Then by Lemma., gcd(a, b) < m = p t p t, k k then m gcd(a, b) and there is a prime q dividing m, hence q a and q b. This means that q = p l for some l and so p t l+ l gcd(a, b). But then p r l+ l a and p s l+ l b which is impossible. Hence gcd(a, b) = p t p t k k. We have not yet considered the question of how many primes there are, in particular whether there are finitely many. Theorem.2. There are infinitely many distinct primes. Proof. Suppose not. Let the distinct primes be p 0 = 2, p,..., p n where 2 = p 0 < 3 = p < < p n. Consider the natural number N = (2p p n ) +. Notice that for each j, p j N. By the Fundamental Theorem of Arithmetic, N = q q k for some primes q j. This gives a contradiction since none of the q j can occur amongst the p j. We can also show that certain real numbers are not rational. Proposition.22. Let p be a prime. Then p is not a rational number.

17 7. CONGRUENCES MODULO A PRIME 3 Proof. Suppose that p = a b for integers a, b. We can assume that gcd(a, b) = since common factors can be cancelled. Then on squaring we have p = a2 b 2 and hence a2 = pb 2. Thus p a 2, and so by Euclid s Lemma.7, p a. Writing a = a p for some integer a we have a 2 p2 = pb 2, hence a 2 p = b2. Again using Euclid s Lemma we see that p b. Thus p is a common factor of a and b, contradicting our assumption. This means that no such a, b can exist so p is not a rational number. Non-rational real numbers are called irrational. The set of all irrational real numbers is much bigger than the set of rational numbers Q, see Section 5 of Chapter 4 for details. However it is hard to show that particular real numbers such as e and π are actually irrational. 7. Congruences modulo a prime In this section, p will denote a prime number. We will study Z/p. We begin by noticing that it makes sense to consider a polynomial with integer coefficients f(x) = a 0 + a x + + a d x d Z[x], but reduced modulo p. If for each j, a j p b j, we write a 0 + a x + + a d x d p b 0 + b x + + b d x d and talk about residue class of a polynomial modulo p. We will denote the residue class of f(x) by f(x) p. We say that f(x) has degree d modulo p if a d p 0. For an integer c Z, we can evaluate f(c) and reduce the answer modulo p, to obtain f(c) p. If f(c) p = 0 p, then c is said to be a root of f(x) modulo p. We will also refer to the residue class c p as a root of f(x) modulo p. Proposition.23. If f(x) has degree d modulo p, then the number of distinct roots of f(x) modulo p is at most d. Proof. Begin by noticing that if c is root of f(x) modulo p, then f(x) p f(x) f(c) = (a + a 2 (x + c) + + a d (x d + + c d ))(x c). Hence f(x) p f (x)(x c). If c is another root of f(x) modulo p for which c p c p, then since f (c )(c c) p 0 we have p f (c )(c c) and so by Euclid s Lemma.7, p f (c ); thus c is a root of f (x) modulo p. If now the integers c = c, c 2,..., c k are roots of f(x) modulo p which are all distinct modulo p, then f(x) p (x c )(x c 2 ) (x c k )g(x). In fact, the degree of g(x) is then d k. This implies that 0 k d. Theorem.24 (Fermat s Little Theorem). Let t Z. Then t is a root of the polynomial Φ p (x) = x p x modulo p. Moreover, if t p 0 p, then t is a root of the polynomial Φ 0 p(x) = x p modulo p. Proof. Consider the function ϕ: Z Z/p; ϕ(t) = (t p t) p.

18 4. BASIC NUMBER THEORY Notice that if s p t then ϕ(s) = ϕ(t) since s p s p t p t. Then for u, v Z, ϕ has the following additivity property: ϕ(u + v) = ϕ(u) + ϕ(v). To see this, notice that the Binomial Theorem gives p ( ) p (u + v) p = u p + v p + u j v p j. j For j p, j= ( ) p p (p )! = j j!(p j)! and as none of j!, (p j)!, (p )! is divisible by p, the integer the following useful result. Theorem.25 (Idiot s Binomial Theorem). For a prime p and u, v Z, From this we deduce It follows by Induction on n that for n, (u + v) p p u p + v p. (u + v) p (u + v) p (u p + v p ) (u + v) p (u p u) + (v p v). ϕ(u + + u n ) = ϕ(u ) + + ϕ(u n ). To prove Fermat s Little Theorem, notice that ϕ() = 0 p and so for t, ϕ(t) = ϕ( } + {{ + } ) = ϕ() + + ϕ() } {{ } t summands t summands ( ) p is so divisible. This gives j = 0 p p = 0 p. } {{ } t summands For general t Z, we have ϕ(t) = ϕ(t + kp) for k N 0, so we can replace t by a positive natural number congruent to it and then use the above argument. If t p 0 p, then we have p t(t p ) and so by Euclid s Lemma.7, p (t p ). The second part of Fermat s Little Theorem can be used to elucidate the multiplicative structure of Z/p. Let t be an integer not divisible by p. By Theorem.9, since gcd(t, p) =, there is an inverse u of t modulo p. The set P t = {t k p : k } Z/p is finite with at most p elements. Notice that in particular we must have t r p = t s p for some r < s and so t s r p = p. The order of t modulo p is the smallest d > 0 such that t d. We p denote the order of t by ord p t. Notice that the order is always in the range ord p t p. Lemma.26. For t Z with p t, the order of t modulo p divides p. Moreover, for k N 0, t k p if and only if ord p t k. Proof. Let d = ord p t be the order of t modulo p. Writing p = qd + r with 0 r < d, we have p t p p t qd+r = t qd t r p t r, which means that r = 0 since d is the least positive integer with this property.

19 7. CONGRUENCES MODULO A PRIME 5 If t k p, then writing k = q d + r with 0 r < d, we have p t q d t r p t r, hence r = 0 by the minimality of d. So d k. Theorem.27. For a prime p, there is an integer g such that ord p g = p. Proof. Proofs of this result can be found in many books on elementary Number Theory. It is also a consequence of our Theorem Such an integer g is called a primitive root modulo p. The distinct powers of g modulo p are then the (p ) residue classes This implies the following result. p = g 0 p, g p, g 2 p,, g p 2 p. Proposition.28. Let g be a primitive root modulo the prime p. Then for any integer t with p t, there is a unique integer r such that 0 r < p and t p g r. Notice that the power g (p )/2 satisfies (g (p )/2 ) 2 p. Since this number is not congruent to modulo p, Proposition.23 implies that g (p )/2 p. Proposition.29. If p is an odd prime then the polynomial x 2 + has no roots modulo p if p 4 3, two roots modulo p if p 4. Proof. Let g be a primitive root modulo p. If p 4 3, suppose that u 2 + p 0. Then if u p g r, we have g 2r p, hence g 2r p g (p )/2. But then (p ) (2r (p )/2) which is impossible since (p )/2 is odd. If p 4, (g (p )/4 ) 4 p 0, so the polynomial x 4 has four distinct roots modulo p, namely p, p, g p (p )/4, gp 3(p )/4. By Proposition.23, this means that g (p )/4, g 3(p )/4 are roots of x 2 + modulo p. Theorem.30 (Wilson s Theorem). For a prime p, (p )! p. Proof. This is trivially true when p = 2, so assume that p is odd. By Fermat s Little Theorem.24, the polynomial x p has for its p distinct roots modulo p the numbers, 2,..., p. Thus By setting x = 0 we obtain (x )(x 2) (x p + ) p x p. ( ) p (p )! p. As (p ) is even, the result follows.

20 6. BASIC NUMBER THEORY 8. Finite continued fractions Let a, b Z with b > 0. If the Euclidean Algorithm for these integers produces the sequence a = q 0 b + r 0, b = q r 0 + r, r 0 = q r + r 2,. r k0 2 = q k0 r k0 + r k0, r k0 = q k0 r k0. Then a b = q 0 + r 0 b = q 0 + b/r 0 = q 0 + q + q q k0 + q k0 and this expression is called the continued fraction expansion of a/b, written [q 0 ; q,..., q k0 ]; we also say that [q 0 ; q,..., q k0 ] represents a/b. In general, [a 0 ; a, a 2, a 3,..., a n ] gives a finite continued fraction if each a k is an integer with all except possibly a 0 being positive. Then [a 0 ; a, a 2, a 3,..., a n ] = a 0 + a + a 2 + a 3 + Notice that this expansion for a/b is not necessarily unique since if q k0 >, then q k0 = (q k0 )+ and we obtain the different expansion a b = q 0 + r 0 b = q 0 + b/r 0 = q 0 + q + q q k0 + (q k0 ) +

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

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

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

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

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

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

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

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

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

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

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

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

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

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

### G = G 0 > G 1 > > G k = {e}

Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same

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

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

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

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

### Introduction to Modern Algebra

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

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

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

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

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

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

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

### 4. FIRST STEPS IN THE THEORY 4.1. A

4. FIRST STEPS IN THE THEORY 4.1. A Catalogue of All Groups: The Impossible Dream The fundamental problem of group theory is to systematically explore the landscape and to chart what lies out there. We

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

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

### Stanford University Educational Program for Gifted Youth (EPGY) Number Theory. Dana Paquin, Ph.D.

Stanford University Educational Program for Gifted Youth (EPGY) Dana Paquin, Ph.D. paquin@math.stanford.edu Summer 2010 Note: These lecture notes are adapted from the following sources: 1. Ivan Niven,

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

### 13 Solutions for Section 6

13 Solutions for Section 6 Exercise 6.2 Draw up the group table for S 3. List, giving each as a product of disjoint cycles, all the permutations in S 4. Determine the order of each element of S 4. Solution

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

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

### Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013

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

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

### Groups and Symmetry. Andrew Baker

Groups and Symmetry Andrew Baker [24/12/2005] Department of Mathematics, University of Glasgow. E-mail address: a.baker@maths.gla.ac.uk URL: http://www.maths.gla.ac.uk/ ajb Contents Chapter 1. Isometries

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

### Unique Factorization

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

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

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

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

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

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

### MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions

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

GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

### SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

### Chapter 7. Permutation Groups

Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral

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

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

### 4. Number Theory (Part 2)

4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

### INTRODUCTORY SET THEORY

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

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

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

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

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

### CLASSIFYING FINITE SUBGROUPS OF SO 3

CLASSIFYING FINITE SUBGROUPS OF SO 3 HANNAH MARK Abstract. The goal of this paper is to prove that all finite subgroups of SO 3 are isomorphic to either a cyclic group, a dihedral group, or the rotational

### PROBLEM SET 6: POLYNOMIALS

PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other

GROUP ACTIONS KEITH CONRAD 1. Introduction The symmetric groups S n, alternating groups A n, and (for n 3) dihedral groups D n behave, by their very definition, as permutations on certain sets. The groups

### ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

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

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

### Finite Fields and Error-Correcting Codes

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

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

### CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

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

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

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

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

### Elements of Abstract Group Theory

Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for

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

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

### Groups, Rings, and Fields. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, S S = {(x, y) x, y S}.

Groups, Rings, and Fields I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, A binary operation φ is a function, S S = {(x, y) x, y S}. φ : S S S. A binary

### 10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

### PYTHAGOREAN TRIPLES PETE L. CLARK

PYTHAGOREAN TRIPLES PETE L. CLARK 1. Parameterization of Pythagorean Triples 1.1. Introduction to Pythagorean triples. By a Pythagorean triple we mean an ordered triple (x, y, z) Z 3 such that x + y =

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

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

### THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

### Number Theory: A Mathemythical Approach. Student Resources. Printed Version

Number Theory: A Mathemythical Approach Student Resources Printed Version ii Contents 1 Appendix 1 2 Hints to Problems 3 Chapter 1 Hints......................................... 3 Chapter 2 Hints.........................................

### r + s = i + j (q + t)n; 2 rs = ij (qj + ti)n + qtn.

Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in

### Abstract Algebra Cheat Sheet

Abstract Algebra Cheat Sheet 16 December 2002 By Brendan Kidwell, based on Dr. Ward Heilman s notes for his Abstract Algebra class. Notes: Where applicable, page numbers are listed in parentheses at the

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

### MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu

Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### The cyclotomic polynomials

The cyclotomic polynomials Notes by G.J.O. Jameson 1. The definition and general results We use the notation e(t) = e 2πit. Note that e(n) = 1 for integers n, e(s + t) = e(s)e(t) for all s, t. e( 1 ) =

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,

### Group Theory. Contents

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

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

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

### 6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise

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

### minimal polyonomial Example

Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We

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

### Continued fractions and good approximations.

Continued fractions and good approximations We will study how to find good approximations for important real life constants A good approximation must be both accurate and easy to use For instance, our

### MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

### Mathematics Course 111: Algebra I Part II: Groups

Mathematics Course 111: Algebra I Part II: Groups D. R. Wilkins Academic Year 1996-7 6 Groups A binary operation on a set G associates to elements x and y of G a third element x y of G. For example, addition

### A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number

Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we