# Factorization Algorithms for Polynomials over Finite Fields

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran Subject: Mathematics Level: Master Course code: 4MA11E

2 Abstract Integer factorization is a difficult task. Some cryptosystem such as RSA (which stands for Rivest, Shamir and Adleman ) are in fact designed around the difficulty of integer factorization. For factorization of polynomials in a given finite field F p we can use Berlekamp s and Zassenhaus algorithms. In this project we will see how Berlekamp s and Zassenhaus algorithms work for factorization of polynomials in a finite field F p. This project is aimed toward those with interests in computational algebra, finite fields, and linear algebra. 2

3 Contents 1 Introduction 4 2 Field 4 3 Factoring Over Small Finite Fields 8 4 Berlekamp s Algorithm 9 5 Factoring Over Large Finite Fields Zassenhaus Algorithm Mathematica code Berlekamp Zassenhaus Bibiliography 19 3

4 1 Introduction Any non constant polynomial over a field can be expressed as a product of irreducible polynomials. In finite fields, some algorithms work for the calculation of irreducible factors of a polynomial of positive degree. The factorization of polynomials over finite fields has great importance in coding theory. In this project we will present two algorithms which work for factorization of polynomials over finite field. We will use Berlekamp s algorithm for a small finite field and Zassenhaus algorithm for a large finite field. 2 Field Definition 2.1. A field (F, +, ) is a set F, together with two binary operations, denoted by + and such that: 1. F is an abelian group with respect to both (+) and ( ) 2. The distributive laws hold. That is, for all a,b,c F, we have, a.(b + c) = a.b + a.c and (b + c).a = b.a + c.a Definition 2.2. A field F is said to be a finite field if number of elements of field F are finite. A finite field can also be defined as: For a prime p, let F p be the set {1, 2,..., p 1} of integers and let φ : Z/(p) F p be the mapping defined by φ([a]) = a for a = 0, 1, 2,..., p 1. Where Z/(p) is residue class ring and [a] denotes the residue class of integer a, and φ is isomorphism. Then F p, endowed with the field structure induced by φ, is a finite field, called the Galois field of order p. Example 2.1. An even simpler and most important example is the finite field F 2. It has two elements 0 and 1 and operation table has the following form: and The elements 0 and 1 are called binary elements. 4

5 Definition 2.3. Let F be a field. Any expression of the form a n x n + a n 1 x n a 1 x + a 0 is called a polynomial over the field F. Where a n, a n 1,..., a 1, a 0 F and n is a non negative integer. If n is a largest non negative integer a n = 0, then we say that the polynomial f(x) = a n x n a 0 has the degree n, written as deg(f) = n. The coefficient a n is called the leading coefficient of f(x). If a 0 is the leading coefficient, the f is called a constant polynomial. If the leading coefficient is 1, then f is said to be a monic polynomial. Note that the set of all polynomials with coefficients in F is denoted by F[x]. Definition 2.4. A non constant polynomial p F[x] is said to be irreducible over the field F[x] if p has positive degree and p = bc with b,c F[x] implies that either b or c is a constant polynomial. For example, the polynomial p = x 2 2 Q[x] is irreducible over the field Q[x] and reducible over the field of real numbers R[x]. Note that, 1. All polynomials of degree 1 are irreducible. 2. A polynomial of degree 2 or 3 is irreducible over the field F if and only if it has no roots in F. Theorem 2.1. Given a field F, non zero polynomials f 1, f 2,..., f k F[x] that are pairwise relatively prime, and arbitrary polynomials g 1, g 2,..., g k F[x], then the simultaneous congruences h g 1 mod f 1 h g 2 mod f 2 h g r... mod f r has a unique solution modulo f = f 1 f 2...f r. Proof. We have f i (x) is relatively prime to f j (x) for i = j. The polynomial f k (x) is relatively prime to l k (x) = f(x) f k (x) = f 1(x).f 2 (x)...f k 1 (x).f k+1 (x)...f r (x). 5

6 (l k (x).f k (x)) = 1, because (f j (x).f k (x)) = 1 when j = k. Hence we can find the inverse m k (x) of l k (x) mod f k (x), so that l k (x)m k (x) 1 mod f k (x). Let l k (x)m k (x) 0 mod f j (x). h(x) g 1 l 1 m 1 + g 2 l 2 m g r l r m r mod f(x). The polynomial h(x) is the simultaneous solution of the r congruences. To demonstrate this, we must show that h(x) g k (x) mod f k (x), where k = 1, 2,..., r. Since f k (x) divides l j (x), whenever j = k, we have l j (x) 0 mod f k (x). Therefore in the sum for h(x), all the terms except the kth term are congruent to 0 mod f k (x). Hence h(x) g k (x)l k (x)m k (x) g k (x) mod f k (x). because l k (x).m k (x) 1 mod f k (x). Now, we show that any two solutions are congruent modulo f(x). For this, we let h 1 (x) and h 2 (x) both be simultaneous solutions to the system of r congruences. Therefore, for each k h 1 (x) h 2 (x) g k (x) mod f k (x). So that, Also, f k (h 1 (x) h 2 (x)). f (h 1 (x) h 2 (x)). Therefore h 1 (x) h 2 (x) mod f(x). This shows that the simultaneous solution of the system of r congruences is unique modulo f(x). Example 2.2. The system of congruences h 3 mod (x 1) h 2 mod (x 2) h 1 mod (x 3) has unique solution modulo f(x) = (x 1)(x 2)(x 3). 6

7 Solution: Here we have, and f 1 (x) = x 1, f 2 (x) = x 2, f 3 (x) = x 3 g 1 = 3, g 2 = 2, g 3 = 1 f(x) = (x 1)(x 2)(x 3) Now we divide f(x) with f 1 (x), f 2 (x) and f 3 (x). we will get l 1 = f(x) f 1(x) = (x 2)(x 3) = x2 5x + 6 l 2 = f(x) f 2(x) = (x 1)(x 3) = x2 4x + 3 l 3 = f(x) f 3(x) = (x 1)(x 2) = x2 3x + 2 To find the inverse m 1 of l 1, m 2 of l 2 and m 3 of l 3, we solve (x 2 5x + 6)m 1 1 mod (x 1). So that, we get (x 2 4x + 3)m 2 1 mod (x 2). (x 2 3x + 2)m 3 1 mod (x 3). m 1 = 1 2, m 2 = 1, m 3 = 1 2 Hence, h g 1 l 1 m 1 + g 2 l 2 m 2 + g 3 l 3 m 3 mod f(x). ( 1 2 )(x 2)(x 3)(3) + ( 1)(x 1)(x 3)(2) + (1 )(x 1)(x 2)( 1) 2 mod f(x). x 2 + 2x + 2 mod f(x). Theorem 2.2. Any polynomial f F[x] of positive degree can be written in the form f = a.p e1 1.pe pe k k Where, a F, p 1, p 2,... p k are distinct monic irreducible polynomials in F[x] and e 1, e 2,..., e k are positive integers. Moreover, this factorization is unique apart from the order in which the factors occur. Proof. Let f(x) F[x] be a non constant polynomial. If f(x) is reducible then at least f(x) = a g(x) h(x) Where a F and, deg(g(x)) < deg(f(x)) 7

8 deg(h(x)) < deg(f(x)) Further, If g(x) and h(x) are irreducible, then we stop here. If not, then at least one of them is reducible into lower degree polynomials. Continuing this process, we get f(x) = a p 1 (x) p 2 (x)... p r (x) Where, p i (x) are irreducible polynomials in F[x] and i = 1, 2,..., r. To show the uniqueness,let f(x) = a 1 p 1 (x)... p r (x) = a 2 q 1 (x)... q s (x) (2.1) be the two factorizations of f(x) into irreducible polynomials. Then by the theorem, p(x) is an irreducible polynomial in F[x]. If p(x) divides r(x) s(x) for r(x), s(x) F[x], then p(x) divides either r(x) or s(x). So p i (x) divides some q j (x). Let we assume that q 1 (x) divides p 1 (x), then q 1 (x) = u 1.p 1 (x) since q 1 (x) is irreducible By putting this value of q 1 (x) in (2.1), we will get u 1.p 1 (x).q 2 (x)...q s (x) = p 1 (x).p 2 (x)...p r (x) (2.2) u 1.q 2 (x)...q s (x) = p 2 (x)...p r (x) (2.3) Now, by putting q 2 (x) = u 2.p 2 (x) in the equation (2.3), we will get Continuing this process and we get u 1.u 2.q 3 (x)...q s (x) = p 3 (x)...p r (x) (2.4) 1 = u 1.u 2...u r.q r+1 (x)...q s (x) (2.5) This is only possible if r = s, so that the equation (2.5) has actually the form 1 = u 1.u 2...u r. Therefore, irreducible factors p i (x) and q i (x) were the same. Hence the theorem. 3 Factoring Over Small Finite Fields Lemma 3.1. If F is a finite field with q elements,then every a F satisfies a q = a. Lemma 3.2. If F is a finite field with q elements and K is a sub field of F, then the polynomial x q = x in K[x] factors in F[x] as x q x = a F q (x a). and F is a splitting field of x q x over K. 8

9 Theorem 3.3. Let F q be a field. If f F q [x] is a monic polynomial and h F q [x] is such that h q h mod f,then f(x) = c F q gcd(f(x), h(x) c)). (3.1) Proof. From the above equation (3.1) we can see that each greatest common divisor on the right side divides f(x). For c F q and h(x) F q [x], h(x) c are pairwise relatively prime polynomials. i.e h 2 (x) = h 1 (x) + c 1 c 2, where c 1, c 2 F q, c 1 = c 2. So are the greatest common divisors with f(x), and thus product of all these greatest common divisors divides f(x). Since h q h mod f f(x) divides h(x) q h(x) and from (Lemma 3.2) we have h(x) q h(x) = (h(x) c). (3.2) c F q Which shows that f(x) divides the right-hand side of (3.1).Thus both sides of equation (3.1) are monic polynomials which divides each other. Therefore must be equal. Hence the theorem. Particulars 1. Note that it is feasible to use (theorem 3.3) to obtain a factorization of polynomial f(x) over a small finite field F q since it requires the calculation of q gcd s. 2. In general (theorem 3.3) does not give a complete factorization of f(x) since the gcd(f, h c) s might be reducible. Definition 3.1. If h F q [x] be such that (theorem 3.3) yields a non trivial factorization of f(x) is called f-reducing polynomials. If h c mod f for some c F q, then (theorem 3.3) gives trivial factorization of f. And for any h with h q h mod f, when 0 < deg h < deg f, is obviously f-reducing polynomial. Now we use Berlekamp s algorithm to find these freducing polynomials. 4 Berlekamp s Algorithm Let us assume that f has no repeated factors, so that f = f 1.f 2...f k are the distinct monic irreducible polynomials over F q. If (c 1.c 2...c k ) is any k-tuple of elements of F q.then by (theorem 2.1) there is a unique h F q [x] with h(x) c i mod f i (x) for 1 i k and deg(h) < deg(f). 9

10 The polynomial h(x) satisfies the condition and therefore h(x) q c q i = c i h(x) mod f i (x) for 1 i k, h(x) q h(x) mod f(x), deg(h) < deg(f). (4.1) Also if h is is a solution of (4.1) then (3.2) implies that every irreducible factor of f divides one of the polynomials h(x) c. Thus, all solutions of (4.1) satisfy h(x) c i mod f i (x), 1 i k, for k-tuple (c 1.c 2...c k ) of elements of F q. Consequently, we have exactly q k solutions of (4.1). We find these solutions by reducing (4.1) to a system of linear equations. Let deg(f) = n then we construct n n matrix B = (b ij ), 0 i, j n 1, by calculating the powers of x iq mod f(x). x iq n 1 j=0 b ij x j mod f(x) for 0 i n 1. (4.2) where b ij F q. h(x) = a 0 + a 1 x a n 1 x n 1 F q [x] satisfies (4.1) if and only if (a 0,..., a n 1 )B = (a 0,..., a n 1 ). (4.3) where B = (b ij ) and 0 i, j n 1 (4.3) holds if and only if h(x) = n 1 j=0 n 1 i=0 The system (4.3) can be written as a j x j = n 1 j=0 a i x iq h q n 1 i=0 a i b ij x j. mod f(x). (a 0,..., a n 1 )(B I) = (0, 0,..., 0), (4.4) By the considerations above system (4.4) has exact q k solutions. Therefore dimensions of B I is k, the number of distinct monic irreducible factors of f. And rank of B I is n k. Since the polynomial h 1 (x) = 1 is trivial solution of (4.1), so the vector (1,0,...,0,) is solution of (4.4). There will exist the polynomials h 2 (x),... h k (x) with degree n 1 such that the corresponding vectors to h 2 (x),... h k (x) form the basis of null space of B I. So the polynomials h 2 (x),... h k (x) are f-reducing. Now once the rank r is found, we know the number of irreducible polynomials by k = n r. If k = 1 then f(x) is irreducible and we will terminate the procedure. Also for k = 1, the solutions of h q h mod f are the constant polynomials and the null 10

11 space of B I will have the vectors (c, 0, 0,...0) where c F q. If k 2, we will get the polynomial h 2 (x) which is f-reducing. Then we find gcd(f(x), h 2 (x) c), for all c F q, the result will be a non trivial factorization of f(x) by (theorem 3.3). If we do not get k factors of f by using h 2 (x), we will find the gcd(g(x), h 3 (x) c), for all c F q, and the process will continue until we get k factors of f(x). Example 4.1. Factor f(x) = x 4 +x 2 +x+1 over F 2 by Berlekamp s algorithm. Solution: To factor the polynomial f(x) we will do following steps. 1. Note that, f (x) = 4x 3 + 2x + 1 = 1. so, gcd(f(x), f (x)) = 1 and f(x) has no repeated factors. 2. We must compute the powers x 2i mod f(x) for 0 i 3.This yields the following congruences: x 0 1 x 2 x 2 mod f. mod f. x x + x 2 x x + x 3 mod f. mod f. 3. So, the matrix B of order 4 4 is given as B = and the matrix B-I is B I = Now rank of B I is r = 2, therefore f(x) has k = 4 2 = 2 distinct monic irreducible factors. 5. Two vectors (1, 0, 0, 0) and (0, 0, 1, 1) form the basis of the null space of B I. 6. The polynomials corresponding to the basis vectors are: h 1 (x) = 1 and h 2 (x) = x 2 + x 3 7. Now, by using the (theorem 3.3) we calculate gcd(f(x), h 2 (x) 0) = x + 1. gcd(f(x), h 2 (x) 1) = x 3 + x

12 8. f has two distinct monic irreducible factors. Therefore, our desired factorization is f(x) = (x + 1)(x 3 + x 2 + 1). Example 4.2. Factor f(x) = x 8 + x 7 + x 4 + x 3 + x + 1 over F 3 by Berlekamp s algorithm. Solution: Since, gcd(f(x), f (x)) = 1, f(x) has no repeated factors. Now we will compute x iq mod f(x) for q = 3 and 0 i 7. We have the congruences x 0 1 mod f. x 3 x 3 mod f. x 6 x 6 mod f. x x 2 + x 3 + 2x 5 + x 7 x 12 x + x 4 + 2x 5 mod f. x x + x 3 + 2x 4 + 2x 7 x x 4 + 2x 6 mod f. x x 2 + x 5 mod f. mod f. mod f. So, the matrix B of order 8 8 is given as B = and the matrix B-I is B I = Since, the rank of B I is r = 5, therefore f(x) has k = 8 5 = 3 distinct monic irreducible factors. The null space of the matrix B I is (1,0,0,0,0,0,0,0), 12

13 (0,0,0,1,0,0,0,1) and (0,2,2,1,1,1,1,0). And the polynomials corresponding to these basis vectors are h 1 (x) = 1. h 2 (x) = x 3 + x 7. First, we take h 2 (x) and we find that h 3 (x) = 2x + 2x 2 + x 3 + x 4 + x 5 + x 6. gcd(f(x), h 2 (x) 0) = 1. gcd(f(x), h 2 (x) 1) = 1 + x. gcd(f(x), h 2 (x) 2) = 1 + x 3 + x 7. Since f(x) has three distinct monic irreducible factors but we have f(x) = (1 + x)(1 + x 3 + x 7 ). To obtain f-reducing polynomial, we take the polynomial 1 + x 3 + x 7 and by repeating the same procedure as above, we will get So that 1 + x 3 + x 7 = (2 + 2x + 2x 2 + x 3 + x 4 + x 5 + x 6 )(2 + x). f(x) = (1 + x)(2 + 2x + 2x 2 + x 3 + x 4 + x 5 + x 6 )(2 + x). Now for 2 + 2x + 2x 2 + x 3 + x 4 + x 5 + x 6 we see that k = 1, so it is irreducible and we terminate here. Secondly, for h 3 (x) we will have gcd(f(x), h 3 (x) 0) = 1 + x. gcd(f(x), h 3 (x) 1) = 2 + 2x + 2x 2 + x 3 + x 4 + x 5 + x 6. gcd(f(x), h 3 (x) 2) = 2 + x. then f has the factorization as f(x) = (1 + x)(2 + 2x + 2x 2 + x 3 + x 4 + x 5 + x 6 )(2 + x). 5 Factoring Over Large Finite Fields A finite field, F q is considered large if q is substantially bigger than the degree of the polynomial to be factored. In that case, the factorization of the given polynomial by the method in the previous section become more difficult. However, we may still be able to find an f-reducing polynomial with a reasonable effort but a direct application of the basic formula (3.1) become difficult because it requires the calculation of q greatest common divisors. 13

14 Let f be a monic polynomial in F[x] with no repeated factors. We can find an f-reducing polynomial h(x) by the use of Berlekamp s algorithm. Since the various greatest common divisors in (3.1) are pairwise relatively prime, it is clear that at most k of these greatest common divisors will be = 1. We will then use the Zassenhaus algorithm to characterize the elements c F q for which gcd(f(x), h(x) c) = Zassenhaus Algorithm To characterize the elements c F q for which the greatest common divisors in (3.1) need to be calculated is based on the following considerations Let C = {c F q : gcd(f(x), h(x) 1) = 1}, (3.1) implies f(x) = c C gcd(f(x), h(x) c)). (5.1) and so f(x) divides c C (h(x) c). Also consider the polynomial G(y) = c F q (y c), then f(x) divides G(h(x)). To characterize the polynomial G(y), we take a look at the following theorems. Theorem 5.1. F[x] is principal ideal domain. In fact, for every ideal J = (0) of F[x] there exist a uniquely determined monic polynomial g F[x] with J = (g) Theorem 5.2. Among all the polynomials g F q [y] such that f(x) divides g(h(x)), the polynomial G(y) is the unique monic polynomial of least degree. Proof. We have already shown above that the monic polynomial G(y) is such that f(x) divides G(h(x)). It is easily seen that the polynomials g F q [y] with f(x) dividing g(h(x)) form a non zero ideal of F q [y]. By (theorem 5.1) F q [y] is a principal ideal domain, so this ideal is generated by a uniquely determined monic G o F q [y]. It follows that G o (y) divides G(y) and so G o (y) = c C 1 (y c). where C 1 C. Furthermore, f(x) divides G o (h(x)) = c C 1 (h(x) c), so f(x) = gcd(f(x), h(x) c)). c C 1 A comparison with (5.1) shows that C = C 1, so G o (y) = G(y), and hence the theorem. This result is applied in following method. Let m be the number of elements of the set C. then G(y) = m (y c) = b j y j F q [y]. c C j=0 14

15 where b m = 1. Since f(x) divides G(h(x)), so that m j=0 b jy j 0 mod f. Since b m = 1, this may be given a non trivial linearly dependent relation over F q of residues 1, h(x), h(x) 2,..., h(x) m mod f(x). (theorem 5.2) says with the normalization b m = 1 this linearly dependent relation is unique and residue classes 1, h(x), h(x) 2,..., h(x) m mod f(x) are linearly independent. We can find the polynomial G by calculating the residues mod f(x) of 1, h(x), h(x) 2,..., until we find the smallest powers of h(x) that is linearly dependent over F q on its predecessors. The scalars in this linear dependence relation are the coefficients of G. The elements of the set C are the roots of the polynomial G. This method of reducing the problem of finding the elements of C to that of calculating the roots of a polynomial in F q is called the Zassenhaus algorithm. Example 5.1. Factor f = x 5 + 4x 2 + 3x + 1 over F 17. Solution: Using Berlekamp s algorithm, we can determine that k = 3 and find an f-reducing polynomial h = x 3 8x 2 5x. We now compute the powers of h mod f until we find a non trivial linear dependence. h 2 3x 4 + 8x 3 + x 2 4x 1 h 3 4x 4 4x 3 6x mod f. mod f. So linearly dependent relation is h 3 = 7h 2 + 8h. Thus G = y 3 7y 2 8y. Now by using Remainder theorem we can see that G(0) = = 0 mod 17. G(8) = = 0 mod 17. G(16) = = 0 mod 17. Therefore roots of G are 0,8 and 16, so we only need to compute gcd(f, h 0) = x gcd(f, h 8) = x gcd(f, h 16) = x 3 + 9x x + 1. So we get f = (x + 11)(x + 14)(x 3 + 9x x + 1). where x + 11, x + 14 are monic and so irreducible, also on checking further x 3 + 9x x + 1 is irreducible Hence f = (x + 11)(x + 14)(x 3 + 9x x + 1). is factorization of f. 15

16 6 Mathematica code 6.1 Berlekamp Implementation of Berlekemp algorithm for factorizing polynomials modulo a prime field p. Sajid Hanif, Muhammad Imran, Marcus Nilsson f[x] = x ˆ8+ x ˆ6+ x ˆ4+ x ˆ3+1; p = 2; deg = Exponent [f[x], x]; First we check that the polynomial has no repeated factors. PolynomialGCD [f[x], D[f[x], x], Modulus -> p] 1 Now we have to compute xˆiq mod f(x) for q ( field ) and 0 <=i <= n -1, where n is degree of polynomial and we will get coefficient matrix B from our computation of x ˆ iq. And then we have to find B-I. where I is identity matrix of order n* n. B = {}; Do[pol = CoefficientList [ PolynomialMod [xˆ(p i), f[x], Modulus -> p], x]; pol = PadRight [pol, deg ]; AppendTo [B, pol ], {i, 0, deg - 1}]; b = Transpose [ Mod [B - IdentityMatrix [ deg ], p ]]; b // MatrixForm It will give us B- I marix. Now we will find the rank of matrix B- I. MatrixRank [b, Modulus -> p] 6 Since rank r and degree n, so k =n- r. Therefore we will get factors. of polynomial f( x). Now we will find bases of null space of matrix B- I and our h ( x) f- reducing polynomial. At the end we will compute gcd (f(x),h(x)-c) where c belongs to F(x). 16

17 nullbase = Mod [ NullSpace [b, Modulus -> p], p]; pollist = Table [ FromDigits [ Reverse [ nullbase [[i]]], x], {i, 1, Length [ nullbase ]}]; maybefactors = Table [ PolynomialGCD [f[x], pollist [[i]] - j, Modulus -> p], {i, 1, Length [ pollist ]}, {j, 0, p - 1}] {{1 + x + xˆ4 + xˆ5 + xˆ6, 1 + x + xˆ2}, {1, 1 + xˆ3 + xˆ4 + xˆ6 + x ˆ8}} This will give the required factorization of any given polynomial. Here f (x )=(1+ x+x ˆ4+ x ˆ5+ x ˆ6)(1+ x+x ˆ2). On checking further on 1+x+x ˆ4+ x ˆ5+ xˆ6 and 1+x+xˆ2 we will see f(x )=(1+ x+x ˆ4+ x ˆ5+ x ˆ6)(1+ x+x ˆ2) is the factorization of f (x). 6.2 Zassenhaus Implementation of Zassenhaus algorithm for factorizing polynomials modulo a prime p. Sajid Hanif, Muhammad Imran, Marcus Nilsson f[x] = xˆ6-3x ˆ5+5 xˆ4-9xˆ3-5x ˆ2+6 x +7; p = 47; deg = Exponent [f[x], x]; First we check that the polynomial has no repeated factors. PolynomialGCD [f[x], D[f[x], x], Modulus -> p] 1 Now we have to compute xˆiq mod f(x) for q ( field ) and 0 <=i <= n -1, where n is degree of polynomial and we will get coefficient matrix B from our computation of x ˆ iq. And then we have to find B-I. where I is identity matrix of order n* n. B = {}; Do[pol = CoefficientList [ PolynomialMod [xˆ(p i), f[x], Modulus -> p], x]; 17

18 pol = PadRight [pol, deg ]; AppendTo [B, pol ], {i, 0, deg - 1}]; b = Transpose [ Mod [B - IdentityMatrix [ deg ], p ]]; b // MatrixForm Now we have to check number of facotrs of f ( x). And then we will find bases of null space of matrix B-I and h(x) f- reducing polynomial. NumberOfFactors = MatrixRank [ b, Modulus - > p]; nullbase = Mod [ NullSpace [b, Modulus -> p], p]; onepoly = Prepend [ Table [0, { deg - 1}], 1]; If[ nullbase [[1]] == onepoly, i = 2, i = 1]; h[x] = Expand [ FromDigits [ Reverse [ nullbase [[i]]], x ]]; zlist = {}; AppendTo [ zlist, Reverse [ PadRight [ CoefficientList [h[x],x], deg ]]]; nullsp = {}; i = 2; While [ Length [ nullsp ] == 0, Now after finding h( x) we will compute h( x)ˆ i until we get a linearly dependent relation between all h(x)ˆi. zpol = Reverse [ PadRight [ CoefficientList [ PolynomialMod [h[x]ˆi, f[x], Modulus -> p], x], deg ]]; AppendTo [ zlist, zpol ]; nullsp = NullSpace [ Transpose [ zlist ], Modulus -> p]; i ++]; base = NullSpace [ Transpose [ zlist ], Modulus - > p]; base = Append [ Reverse [ base [[1]]], 0]; In linearly dependent relation just replace h( x) by y, so will get a polynomial G(y). factorization = 1; Do[ factorization = factorization * PolynomialGCD [f[x], h[x] - roots [[i]], Modulus -> p], {i, 1, Length [ roots ]}]; factorization (28+ x )(31+4 x+x ˆ2)(11+42 x +12 x ˆ2+ x ˆ3) 18

19 This will give our required factorization of any given polynomial. In above example we get f(x )=(28+ x )(31+4 x+x ˆ2)(11+42 x +12 x ˆ2+ x ˆ3). 7 Bibiliography References [1] RUDOLF LIDL and HARALD NIEDERREITER. Introduction to finite fields and their applications. Cambridge university press,

20 SE Växjö / SE Kalmar Tel Lnu.se/dfm

### Introduction to Finite Fields (cont.)

Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

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

### H/wk 13, Solutions to selected problems

H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.

### The Division Algorithm for Polynomials Handout Monday March 5, 2012

The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,

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

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

### Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2) Kevin Broughan University of Waikato, Hamilton, New Zealand May 13, 2010 Remainder and Factor Theorem 15 Definition of factor If f (x)

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

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

### RESULTANT AND DISCRIMINANT OF POLYNOMIALS

RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results

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

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

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

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

### calculating the result modulo 3, as follows: p(0) = 0 3 + 0 + 1 = 1 0,

Homework #02, due 1/27/10 = 9.4.1, 9.4.2, 9.4.5, 9.4.6, 9.4.7. Additional problems recommended for study: (9.4.3), 9.4.4, 9.4.9, 9.4.11, 9.4.13, (9.4.14), 9.4.17 9.4.1 Determine whether the following polynomials

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

### SOLVING POLYNOMIAL EQUATIONS

C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra

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

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

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

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

### Chapter 13: Basic ring theory

Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring

### Basics of Polynomial Theory

3 Basics of Polynomial Theory 3.1 Polynomial Equations In geodesy and geoinformatics, most observations are related to unknowns parameters through equations of algebraic (polynomial) type. In cases where

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

### Algebra 3: algorithms in algebra

Algebra 3: algorithms in algebra Hans Sterk 2003-2004 ii Contents 1 Polynomials, Gröbner bases and Buchberger s algorithm 1 1.1 Introduction............................ 1 1.2 Polynomial rings and systems

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

### Integer Factorization using the Quadratic Sieve

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

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

### 7. Some irreducible polynomials

7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of

### Math 345-60 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field

Math 345-60 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field 1. Throughout this section, F is a field and F [x] is the ring of polynomials with coefficients in F. We will

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

### EXERCISES FOR THE COURSE MATH 570, FALL 2010

EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime

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

### Factoring Polynomials

Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent

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

### 9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role

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

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

### 1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is

### Factoring Algorithms

Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors

### The van Hoeij Algorithm for Factoring Polynomials

The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial

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

### 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 1. Search for Good Linear Codes in the Class of Quasi-Cyclic and Related Codes

Chapter 1 Search for Good Linear Codes in the Class of Quasi-Cyclic and Related Codes Nuh Aydin and Tsvetan Asamov Department of Mathematics, Kenyon College Gambier, OH, USA 43022 {aydinn,asamovt}@kenyon.edu

### Factoring of Prime Ideals in Extensions

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

### Lecture 6: Finite Fields (PART 3) PART 3: Polynomial Arithmetic. Theoretical Underpinnings of Modern Cryptography

Lecture 6: Finite Fields (PART 3) PART 3: Polynomial Arithmetic Theoretical Underpinnings of Modern Cryptography Lecture Notes on Computer and Network Security by Avi Kak (kak@purdue.edu) January 29, 2015

### Cyclotomic Extensions

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

### Factoring Cubic Polynomials

Factoring Cubic Polynomials Robert G. Underwood 1. Introduction There are at least two ways in which using the famous Cardano formulas (1545) to factor cubic polynomials present more difficulties than

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

### a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x

### FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

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

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

### 3 Factorisation into irreducibles

3 Factorisation into irreducibles Consider the factorisation of a non-zero, non-invertible integer n as a product of primes: n = p 1 p t. If you insist that primes should be positive then, since n could

### Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}

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

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

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

### Factorization in Polynomial Rings

Factorization in Polynomial Rings These notes are a summary of some of the important points on divisibility in polynomial rings from 17 and 18 of Gallian s Contemporary Abstract Algebra. Most of the important

### Die ganzen zahlen hat Gott gemacht

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

### FACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set

FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is called a quadratic field and it has degree 2 over Q. Similarly,

### Theory of Matrices. Chapter 5

Chapter 5 Theory of Matrices As before, F is a field We use F[x] to represent the set of all polynomials of x with coefficients in F We use M m,n (F) and M m,n (F[x]) to denoted the set of m by n matrices

### Non-unique factorization of polynomials over residue class rings of the integers

Comm. Algebra 39(4) 2011, pp 1482 1490 Non-unique factorization of polynomials over residue class rings of the integers Christopher Frei and Sophie Frisch Abstract. We investigate non-unique factorization

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

### Basic Algorithms In Computer Algebra

Basic Algorithms In Computer Algebra Kaiserslautern SS 2011 Prof. Dr. Wolfram Decker 2. Mai 2011 References Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, 1993. Cox, D.; Little,

### First and raw version 0.1 23. september 2013 klokken 13:45

The discriminant First and raw version 0.1 23. september 2013 klokken 13:45 One of the most significant invariant of an algebraic number field is the discriminant. One is tempted to say, apart from the

### The Dirichlet Unit Theorem

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

### Polynomial Factoring. Ramesh Hariharan

Polynomial Factoring Ramesh Hariharan The Problem Factoring Polynomials overs Integers Factorization is unique (why?) (x^2 + 5x +6) (x+2)(x+3) Time: Polynomial in degree A Related Problem Factoring Integers

### ALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY

ALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY HENRY COHN, JOSHUA GREENE, JONATHAN HANKE 1. Introduction These notes are from a series of lectures given by Henry Cohn during MIT s Independent Activities

### Congruence properties of binary partition functions

Congruence properties of binary partition functions Katherine Anders, Melissa Dennison, Jennifer Weber Lansing and Bruce Reznick Abstract. Let A be a finite subset of N containing 0, and let f(n) denote

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

### QUADRATIC RECIPROCITY IN CHARACTERISTIC 2

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets

### A New Generic Digital Signature Algorithm

Groups Complex. Cryptol.? (????), 1 16 DOI 10.1515/GCC.????.??? de Gruyter???? A New Generic Digital Signature Algorithm Jennifer Seberry, Vinhbuu To and Dongvu Tonien Abstract. In this paper, we study

### Factoring polynomials over finite fields

Factoring polynomials over finite fields Summary and et questions 12 octobre 2011 1 Finite fields Let p an odd prime and let F p = Z/pZ the (unique up to automorphism) field with p-elements. We want to

### 2 Polynomials over a field

2 Polynomials over a field A polynomial over a field F is a sequence (a 0, a 1, a 2,, a n, ) where a i F i with a i = 0 from some point on a i is called the i th coefficient of f We define three special

### LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

### POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

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

### Polynomial Factorization Algorithms over Number Fields

J. Symbolic Computation (2002) 11, 1 14 Polynomial Factorization Algorithms over Number Fields Xavier-François Roblot roblot@euler.univ-lyon1.fr Institut Girard Desargues, Université Claude Bernard, Lyon,

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

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

### Number Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures

Number Theory Hungarian Style Cameron Byerley s interpretation of Csaba Szabó s lectures August 20, 2005 2 0.1 introduction Number theory is a beautiful subject and even cooler when you learn about it

### ALGEBRA HW 5 CLAY SHONKWILER

ALGEBRA HW 5 CLAY SHONKWILER 510.5 Let F = Q(i). Prove that x 3 and x 3 3 are irreducible over F. Proof. If x 3 is reducible over F then, since it is a polynomial of degree 3, it must reduce into a product

### Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a

### The finite field with 2 elements The simplest finite field is

The finite field with 2 elements The simplest finite field is GF (2) = F 2 = {0, 1} = Z/2 It has addition and multiplication + and defined to be 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 0 0 0 = 0 0 1 = 0

### 6. Fields I. 1. Adjoining things

6. Fields I 6.1 Adjoining things 6.2 Fields of fractions, fields of rational functions 6.3 Characteristics, finite fields 6.4 Algebraic field extensions 6.5 Algebraic closures 1. Adjoining things The general

### Primality - Factorization

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

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

### Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

### 15. Symmetric polynomials

15. Symmetric polynomials 15.1 The theorem 15.2 First examples 15.3 A variant: discriminants 1. The theorem Let S n be the group of permutations of {1,, n}, also called the symmetric group on n things.

### Galois Theory III. 3.1. Splitting fields.

Galois Theory III. 3.1. Splitting fields. We know how to construct a field extension L of a given field K where a given irreducible polynomial P (X) K[X] has a root. We need a field extension of K where

### JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials

### 2. Let H and K be subgroups of a group G. Show that H K G if and only if H K or K H.

Math 307 Abstract Algebra Sample final examination questions with solutions 1. Suppose that H is a proper subgroup of Z under addition and H contains 18, 30 and 40, Determine H. Solution. Since gcd(18,

### Prime Numbers and Irreducible Polynomials

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

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

### 26 Ideals and Quotient Rings

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 26 Ideals and Quotient Rings In this section we develop some theory of rings that parallels the theory of groups discussed

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

### (a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9

Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned

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

### FACTORING AFTER DEDEKIND

FACTORING AFTER DEDEKIND KEITH CONRAD Let K be a number field and p be a prime number. When we factor (p) = po K into prime ideals, say (p) = p e 1 1 peg g, we refer to the data of the e i s, the exponents

### Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following

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

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

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