Algebra 2. Rings and fields. Finite fields. A.M. Cohen, H. Cuypers, H. Sterk. Algebra Interactive


 Maryann Sherilyn Holland
 1 years ago
 Views:
Transcription
1 2 Rings and fields A.M. Cohen, H. Cuypers, H. Sterk A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
2 For p a prime number and f an irreducible polynomial of degree n in (Z/pZ)[X ], the quotient ring (Z/pZ)[X ]/(f ) is a field with p n elements. We will see that any field is essentially of this form. Let F be a finite field of order q. By a previous result [], we know that q=p a, the power of a prime number p. We need another (more general) version of Fermat s little theorem. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
3 Theorem Fermat s little theorem Each x F satisfies the equation x q =x. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
4 Example Fields of order 9 Rings and fields Each element of a field of order 9 is a zero of the polynomial The polynomial X 9 X (Z/3Z)[X ]. The elements 0, 1, and 2 of Z/3Z are zeros of this polynomial and correspond to the linear factors X, X 1, X 2. Dividing out these factors, we find a polynomial of degree 6 that factors into a product of three quadratic polynomials as follows. (X 2 + X + 2) (X X + 2) (X 2 + 1). Each of these factors can be used to define a field of order 9. In the next theorem [] we shall see that they all lead to the same field up to isomorphism. That means that the fields (Z/3Z)[X ]/ ( X 2 + X + 2 ), (Z/3Z)[X ]/ ( X X + 2 ) (Z/3Z)[X ], and (Z/3Z)[X ]/ ( X ) (Z/3Z)[X ] are isomorphic to each other. On the other hand, Fermat s little theorem says A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
5 Example In a previous proposition, we saw that, for any power r=p b of p, the subset {x F x r =x } is a subfield of F. Apparently, for r=q, the subfield coincides with F ; the subfield only depends on the value of rem(b, a), where q=p a. Note that x q 1 =1 for nonzero x in F. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
6 Example In a previous proposition, we saw that, for any power r=p b of p, the subset {x F x r =x } is a subfield of F. Apparently, for r=q, the subfield coincides with F ; the subfield only depends on the value of rem(b, a), where q=p a. Note that x q 1 =1 for nonzero x in F. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
7 Example In a previous proposition, we saw that, for any power r=p b of p, the subset {x F x r =x } is a subfield of F. Apparently, for r=q, the subfield coincides with F ; the subfield only depends on the value of rem(b, a), where q=p a. Note that x q 1 =1 for nonzero x in F. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
8 Example In a previous proposition, we saw that, for any power r=p b of p, the subset {x F x r =x } is a subfield of F. Apparently, for r=q, the subfield coincides with F ; the subfield only depends on the value of rem(b, a), where q=p a. Note that x q 1 =1 for nonzero x in F. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
9 Example In a previous proposition, we saw that, for any power r=p b of p, the subset {x F x r =x } is a subfield of F. Apparently, for r=q, the subfield coincides with F ; the subfield only depends on the value of rem(b, a), where q=p a. Note that x q 1 =1 for nonzero x in F. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
10 Here are some more properties of finite fields. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
11 Lemma Let F be a finite field of order q. 1 X q X = x F (X x). 2 For every prime power r=p b with b a, the subset {x F x r =x } is a subfield of F of order r. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
12 Lemma Let F be a finite field of order q. 1 X q X = x F (X x). 2 For every prime power r=p b with b a, the subset {x F x r =x } is a subfield of F of order r. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
13 Lemma Let F be a finite field of order q. 1 X q X = x F (X x). 2 For every prime power r=p b with b a, the subset {x F x r =x } is a subfield of F of order r. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
14 Example Constructing a field of order 16 The polynomial f =X 4 + X + 1 in (Z/2Z)[X ] is irreducible. (Verify!) Put K =(Z/pZ)[X ]/(f ) and write x=x + f. We shall prove that K is a field by showing that x is invertible and establishing that, as a set, K={(), X 1, X 2,..., X 15 }. This will suffice as it implies that K has 15 invertible elements (powers of x being invertible if x is). The element x is invertible as x 3 +1 is its inverse. This observation is immediate from a rewrite of f (x)=0 to x=x 3 1. In order to establish that all powers of x up to x 15 are distinct, notice that both x 5 =x 2 + x and x 3 are distinct from 1 and that x 15 =1. The last equation implies that x has order a divisor of 15 and the two previous equations imply that the order is not a divisor of 5 or 3. Therefore, the order of x is exactly 15, which settles that the subgroup of the multiplicative group of K generated by x has order 15. In particular, A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
15 We use Fermat s little theorem [] to determine the structure of finite fields. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
16 Theorem Characterization of finite fields Let F be a finite field of order q=p a and let f (Z/pZ)[X ] be an irreducible polynomial of degree a. 1 The field F is isomorphic to (Z/pZ)[X ]/(f ). 2 The polynomial f divides X q X. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
17 Theorem Characterization of finite fields Let F be a finite field of order q=p a and let f (Z/pZ)[X ] be an irreducible polynomial of degree a. 1 The field F is isomorphic to (Z/pZ)[X ]/(f ). 2 The polynomial f divides X q X. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
18 Theorem Characterization of finite fields Let F be a finite field of order q=p a and let f (Z/pZ)[X ] be an irreducible polynomial of degree a. 1 The field F is isomorphic to (Z/pZ)[X ]/(f ). 2 The polynomial f divides X q X. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
19 Later, we shall see that, for every prime power q, there exists a field of order q. The two assertions imply that if f is an irreducible polynomial in (Z/pZ)[X ] of degree a, it factors into linear terms in F [X ]. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
20 Example A field of order 16 Rings and fields The polynomial f =X 4 + X + 1 in (Z/2Z)[X ] is irreducible. (Verify!) Put K=(Z/pZ)[X ]/f (Z/pZ)[X ]. and x=x + f. This is the field of order 16 that we shall work with. The elements of K can be arranged according to the irreducible divisors of X 16 X of which they are a zero. element(s) zero(s) of 0 X X x, x 2, x 4, x 8 X 4 + X + 1 x 3, x 6, x 12, x 9 X 4 + X 3 + X 2 + X + 1 x 7, x 14, x 13, x 11 X 4 + X The multiplicative group of K is cyclic of order 15, with generator x. The elements of order 3 belong to the subfield {0, 1, x 5, x 10 } of order 4, isomorphic to (Z/2Z)[X ]/ ( X 2 + X + 1 ) (Z/2Z)[X ]. The elements of order 5 can be recognized by their exponents (having gcd with 15 equal to 3), but A.M. Cohen, H. Cuypers, alsoh. Sterk by the corresponding polynomial, 2 which di September 25, / 20
21 Remark Implicit in Part 1 is the fact that any two irreducible polynomials in (Z/pZ)[X ] of the same degree, say f and g, lead to isomorphic finite fields. The theorem does not give any information on how to construct the isomorphism. A way to proceed is to look for a zero y of g in (Z/pZ)[X ]/f (Z/pZ)[X ], and to construct the isomorphism as the map (Z/pZ)[X ] (Z/pZ)[X ]/f (Z/pZ)[X ] sending X + g to y. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
22 We use this observation to prove the following result, announced before. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
23 Theorem The multiplicative group of a finite field of order q is cyclic of order q 1. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
24 By the theorem, there are always primitive elements in finite fields. If g is a primitive element of the finite field F, then the elements can be easily enumerated by their exponents with respect to g : F ={0} { g i i {0,..., q 2} }. When written in this form, multiplication on the nonzero elements of F is given by modular arithmetic, with modulus q 1. This is very efficient, but addition is less convenient. Thus, we have the opposite to the usual form, where addition is a minor effort, but multiplication is harder. In terminology introduced before, the theorem says that any field has a primitive element. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
25 Example Suppose that K is a field of order 32. Then K is a group of order 31. Each element distinct from 1 in K has order 31, as its order is a divisor of 31 and distinct from 1, see a previous theorem []. Consider the polynomial f =X In (Z/2Z)[X ], the polynomial f factors into f =(1 + X ) (1 + X 2 + X 5 ) (1 + X 3 + X 5 ) (1 + X + X 2 + X 3 + X 5 ) (1 Let a be an element of K which is a zero of 1 + X + X 2 + X 3 + X 5. Then an elementary calculation shows that a 2 is also a zero of this polynomial. In fact, 1 + X 2 + X 4 + X 6 + X 10 =rem(0, 1 + X + X 2 + X 3 + X 5 ). The five zeros of the polynomial are therefore a, a 2, a 4, a 8, a 16. This result could also have been derived by applying a previous result [] with x x 2. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
26 The following theorem is the principal result on finite fields. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
27 Theorem Classification theorem of finite fields For every prime number p and positive integer a there exists a field of order p a. It is unique up to isomorphism. A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
28 Example To construct a field of order 81=3 4, we look for an irreducible polynomial f of degree 4 in (Z/3Z)[X ]. According to the theory, f is a divisor of the polynomial X 81 X. We first divide out the roots belonging to the subfield of order 9: X 81 X X 9 X =X 72 + X 64 + X 56 + X 48 + X 40 + X 32 + X 24 + X 16 + X This polynomial will factor into 18 irreducible polynomials of degree 4. We find one by trial and error: Creating a degree 4 polynomial and checking that it is relatively prime with X 9 X. The 18 choices for f that may arise are: X 4 X 2 1 X 4 + X 2 X + 1 X 4 X 3 + X X 4 + X 3 X + 1 X 4 + X 3 + X 2 X 1 X 4 + X 2 1 X 4 X 3 1 X 4 + X 1 X 4 + X 3 1 X 4 X 3 + X + 1 X 4 X 3 + X 2 + X 1 X 4 + X 2 + X + 1 X 4 X 3 X 2 + X 1 X 4 X 3 + X 2 X + 1 X 4 + X 3 X 2 X 1 X 4 + X 3 + X 2 + X + 1 X 4 X 1 X 4 + X 3 + X A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, / 20
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
More informationCHAPTER 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
More informationminimal 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
More information3 Congruence arithmetic
3 Congruence arithmetic 3.1 Congruence mod n As we said before, one of the most basic tasks in number theory is to factor a number a. How do we do this? We start with smaller numbers and see if they divide
More information11 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(
More information3.1 The Definition and Some Basic Properties. We identify the natural class of integral domains in which unique factorization of ideals is possible.
Chapter 3 Dedekind Domains 3.1 The Definition and Some Basic Properties We identify the natural class of integral domains in which unique factorization of ideals is possible. 3.1.1 Definition A Dedekind
More informationIntroduction 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
More informationALGEBRA HANDOUT 2: IDEALS AND QUOTIENTS. 1. Ideals in Commutative Rings In this section all groups and rings will be commutative.
ALGEBRA HANDOUT 2: IDEALS AND QUOTIENTS PETE L. CLARK 1. Ideals in Commutative Rings In this section all groups and rings will be commutative. 1.1. Basic definitions and examples. Let R be a (commutative!)
More information7. 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
More informationCLASS NOTES. We bring down (copy) the leading coefficient below the line in the same column.
SYNTHETIC DIVISION CLASS NOTES When factoring or evaluating polynomials we often find that it is convenient to divide a polynomial by a linear (first degree) binomial of the form x k where k is a real
More informationASS.PROF.DR Thamer Information Theory 4th Class in Communication. Finite Field Arithmetic. (Galois field)
Finite Field Arithmetic (Galois field) Introduction: A finite field is also often known as a Galois field, after the French mathematician Pierre Galois. A Galois field in which the elements can take q
More informationQuotient 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.
More informationAlgebra. Sample Solutions for Test 1
EPFL  Section de Mathématiques Algebra Fall semester 20082009 Sample Solutions for Test 1 Question 1 (english, 30 points) 1) Let n 11 13 17. Find the number of units of the ring Z/nZ. 2) Consider the
More informationFurther 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
More information(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
More informationPolynomials can be added or subtracted simply by adding or subtracting the corresponding terms, e.g., if
1. Polynomials 1.1. Definitions A polynomial in x is an expression obtained by taking powers of x, multiplying them by constants, and adding them. It can be written in the form c 0 x n + c 1 x n 1 + c
More informationLet s just do some examples to get the feel of congruence arithmetic.
Basic Congruence Arithmetic Let s just do some examples to get the feel of congruence arithmetic. Arithmetic Mod 7 Just write the multiplication table. 0 1 2 3 4 5 6 0 0 0 0 0 0 0 0 1 0 1 2 3 4 5 6 2 0
More informationElementary 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,
More information5.1 Commutative rings; Integral Domains
5.1 J.A.Beachy 1 5.1 Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following
More informationIntroduction to finite fields
Introduction to finite fields Topics in Finite Fields (Fall 2013) Rutgers University Swastik Kopparty Last modified: Monday 16 th September, 2013 Welcome to the course on finite fields! This is aimed at
More information(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
More informationIntegral Domains. As always in this course, a ring R is understood to be a commutative ring with unity.
Integral Domains As always in this course, a ring R is understood to be a commutative ring with unity. 1 First definitions and properties Definition 1.1. Let R be a ring. A divisor of zero or zero divisor
More informationARITHMETICAL FUNCTIONS II: CONVOLUTION AND INVERSION
ARITHMETICAL FUNCTIONS II: CONVOLUTION AND INVERSION PETE L. CLARK 1. Sums over divisors, convolution and Möbius Inversion The proof of the multiplicativity of the functions σ k, easy though it was, actually
More informationQuotient Rings of Polynomial Rings
Quotient Rings of Polynomial Rings 87009 Let F be a field. is a field if and only if p(x) is irreducible. In this section, I ll look at quotient rings of polynomial rings. Let F be a field, and suppose
More informationTheorem (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,
More informationH/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.
More informationChapter 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
More informationOrders Modulo A Prime
Orders Modulo A Prime Evan Chen March 6, 2015 In this article I develop the notion of the order of an element modulo n, and use it to prove the famous n 2 + 1 lemma as well as a generalization to arbitrary
More informationI. 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
More informationU.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
More information(0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.
11.01 List the elements of Z 2 Z 4. Find the order of each of the elements is this group cyclic? Solution: The elements of Z 2 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order
More informationMA257: 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
More informationPrime 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
More informationFACTORING 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
More informationSolutions 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
More informationProblem Set 7  Fall 2008 Due Tuesday, Oct. 28 at 1:00
18.781 Problem Set 7  Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list
More informationProofs are short works of prose and need to be written in complete sentences, with mathematical symbols used where appropriate.
Advice for homework: Proofs are short works of prose and need to be written in complete sentences, with mathematical symbols used where appropriate. Even if a problem is a simple exercise that doesn t
More informationPrimality  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.
More informationThe Chebotarev Density Theorem
The Chebotarev Density Theorem Hendrik Lenstra 1. Introduction Consider the polynomial f(x) = X 4 X 2 1 Z[X]. Suppose that we want to show that this polynomial is irreducible. We reduce f modulo a prime
More informationFinite Fields and ErrorCorrecting Codes
Lecture Notes in Mathematics Finite Fields and ErrorCorrecting Codes KarlGustav Andersson (Lund University) (version 1.01316 September 2015) Translated from Swedish by Sigmundur Gudmundsson Contents
More informationDefinition: Group A group is a set G together with a binary operation on G, satisfying the following axioms: a (b c) = (a b) c.
Algebraic Structures Abstract algebra is the study of algebraic structures. Such a structure consists of a set together with one or more binary operations, which are required to satisfy certain axioms.
More informationModern 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)
More informationFinite fields: further properties
Chapter 4 Finite fields: further properties 8 Roots of unity in finite fields In this section, we will generalize the concept of roots of unity (wellknown for complex numbers) to the finite field setting,
More informationFactoring 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 pelements. We want to
More informationThe determinant of a skewsymmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14
4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with
More informationz 0 and y even had the form
Gaussian Integers The concepts of divisibility, primality and factoring are actually more general than the discussion so far. For the moment, we have been working in the integers, which we denote by Z
More informationModule 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
More informationDIVISORS AND LINE BUNDLES
DIVISORS AND LINE BUNDLES TONY PERKINS 1. Cartier divisors An analytic hypersurface of M is a subset V M such that for each point x V there exists an open set U x M containing x and a holomorphic function
More informationit 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
More informationUnique 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
More informationPROBLEM SET # 2 SOLUTIONS
PROBLEM SET # 2 SOLUTIONS CHAPTER 2: GROUPS AND ARITHMETIC 2. Groups.. Let G be a group and e and e two identity elements. Show that e = e. (Hint: Consider e e and calculate it two ways.) Solution. Since
More informationEMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION
EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION CHRISTIAN ROBENHAGEN RAVNSHØJ Abstract. Consider the Jacobian of a genus two curve defined over a finite field and with complex multiplication.
More informationON GALOIS REALIZATIONS OF THE 2COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2COVERABLE 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
More informationr + 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
More informationChapter 9. Computational Number Theory. 9.1 The basic groups Integers mod N Groups
Chapter 9 Computational Number Theory 9.1 The basic groups We let Z = {..., 2, 1,0,1,2,...} denote the set of integers. We let Z + = {1,2,...} denote the set of positive integers and N = {0,1,2,...} the
More informationContinued 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
More informationAn Insight into Division Algorithm, Remainder and Factor Theorem
An Insight into Division Algorithm, Remainder and Factor Theorem Division Algorithm Recall division of a positive integer by another positive integer For eample, 78 7, we get and remainder We confine the
More informationCHAPTER 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.
More information2. Integers and Algorithms Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers
2. INTEGERS AND ALGORITHMS 155 2. Integers and Algorithms 2.1. Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers with a b > 0. (1) Apply the division algorithm: a = bq + r, 0 r < b.
More informationCONTINUED 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.
More informationCongruences. 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
More informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the
More information3. Applications of Number Theory
3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a
More informationGalois 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
More informationHomework 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
More informationPythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers
Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers Amnon Yekutieli Department of Mathematics Ben Gurion University email: amyekut@math.bgu.ac.il Notes available at http://www.math.bgu.ac.il/~amyekut/lectures
More informationz = i ± 9 2 2 so z = 2i or z = i are the solutions. (c) z 4 + 2z 2 + 4 = 0. By the quadratic formula,
91 Homework 8 solutions Exercises.: 18. Show that Z[i] is an integral domain, describe its field of fractions and find the units. There are two ways to show it is an integral domain. The first is to observe:
More informationZeros of Polynomial Functions
Review: Synthetic Division Find (x 25x  5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 35x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 35x 2 + x + 2. Zeros of Polynomial Functions Introduction
More informationINTRODUCTION 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
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationLloyd R. Welch. Let GF (q) be the nite eld with q elements. A linear code over GF (q) is cyclic if,
INTRODUCTION FOURIER TRANSFORMS OVER FINITE FIELDS by Lloyd R. Welch Let GF (q) be the nite eld with q elements. A linear code over GF (q) is cyclic if, whenever the letters of a codeword are cyclically
More informationON THE FIBONACCI NUMBERS
ON THE FIBONACCI NUMBERS Prepared by Kei Nakamura The Fibonacci numbers are terms of the sequence defined in a quite simple recursive fashion. However, despite its simplicity, they have some curious properties
More informationIntroduction to Modular Arithmetic, the rings Z 6 and Z 7
Introduction to Modular Arithmetic, the rings Z 6 and Z 7 The main objective of this discussion is to learn modular arithmetic. We do this by building two systems using modular arithmetic and then by solving
More informationHTP in Positive Characteristic
HTP in Positive Characteristic Alexandra Shlapentokh East Carolina University October 2007 Table of Contents 1 A Brief History of Diophantine Undecidability over Number Fields The Original Problem Extensions
More informationElementary Number Theory
Elementary Number Theory Ahto Buldas December 3, 2016 Ahto Buldas Elementary Number Theory December 3, 2016 1 / 1 Division For any m > 0, we define Z m = {0, 1,... m 1} For any n, m Z (m > 0), there are
More informationsome algebra prelim solutions
some algebra prelim solutions David Morawski August 19, 2012 Problem (Spring 2008, #5). Show that f(x) = x p x + a is irreducible over F p whenever a F p is not zero. Proof. First, note that f(x) has no
More informationAppendix A. Appendix. A.1 Algebra. Fields and Rings
Appendix A Appendix A.1 Algebra Algebra is the foundation of algebraic geometry; here we collect some of the basic algebra on which we rely. We develop some algebraic background that is needed in the text.
More informationFibonacci Numbers Modulo p
Fibonacci Numbers Modulo p Brian Lawrence April 14, 2014 Abstract The Fibonacci numbers are ubiquitous in nature and a basic object of study in number theory. A fundamental question about the Fibonacci
More informationQuadratic Equations in Finite Fields of Characteristic 2
Quadratic Equations in Finite Fields of Characteristic 2 Klaus Pommerening May 2000 english version February 2012 Quadratic equations over fields of characteristic 2 are solved by the well known quadratic
More informationThe Mathematics of Origami
The Mathematics of Origami Sheri Yin June 3, 2009 1 Contents 1 Introduction 3 2 Some Basics in Abstract Algebra 4 2.1 Groups................................. 4 2.2 Ring..................................
More information4 Unique Factorization and Applications
Number Theory (part 4): Unique Factorization and Applications (by Evan Dummit, 2014, v. 1.00) Contents 4 Unique Factorization and Applications 1 4.1 Integral Domains...............................................
More information12 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
More information2 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
More informationPolynomials. Dr. philippe B. laval Kennesaw State University. April 3, 2005
Polynomials Dr. philippe B. laval Kennesaw State University April 3, 2005 Abstract Handout on polynomials. The following topics are covered: Polynomial Functions End behavior Extrema Polynomial Division
More informationPYTHAGOREAN 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 =
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationFactoring 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
More information6.4 The Remainder Theorem
6.4. THE REMAINDER THEOREM 6.3.2 Check the two divisions we performed in Problem 6.12 by multiplying the quotient by the divisor, then adding the remainder. 6.3.3 Find the quotient and remainder when x
More informationDiscrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University
Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called
More informationChapter 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
More informationJUST 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
More informationCHAPTER 6: RATIONAL NUMBERS AND ORDERED FIELDS
CHAPTER 6: RATIONAL NUMBERS AND ORDERED FIELDS LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we construct the set of rational numbers Q using equivalence
More informationZeros of Polynomial Functions
Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n1 x n1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of
More informationWest WindsorPlainsboro Regional School District Algebra I Part 2 Grades 912
West WindsorPlainsboro Regional School District Algebra I Part 2 Grades 912 Unit 1: Polynomials and Factoring Course & Grade Level: Algebra I Part 2, 9 12 This unit involves knowledge and skills relative
More informationHTP in Positive Characteristic
HTP in Positive Characteristic Alexandra Shlapentokh East Carolina University November 2007 Table of Contents 1 A Brief History of Diophantine Undecidability over Number Fields The Original Problem Extensions
More information8 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
More informationNUMBER 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
More informationFree groups. Contents. 1 Free groups. 1.1 Definitions and notations
Free groups Contents 1 Free groups 1 1.1 Definitions and notations..................... 1 1.2 Construction of a free group with basis X........... 2 1.3 The universal property of free groups...............
More informationSYNTHETIC DIVISION AND THE FACTOR THEOREM
628 (11 48) Chapter 11 Functions In this section Synthetic Division The Factor Theorem Solving Polynomial Equations 11.6 SYNTHETIC DIVISION AND THE FACTOR THEOREM In this section we study functions defined
More informationCONTINUED 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
More information