Algebra 2. Rings and fields. Finite fields. A.M. Cohen, H. Cuypers, H. Sterk. Algebra Interactive
|
|
- Maryann Sherilyn Holland
- 7 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
How To Prove 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 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 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 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 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 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 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 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 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 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 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 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 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 information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationKevin 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
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 p-elements. We want to
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 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 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 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 informationMath 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
More information3.1. RATIONAL EXPRESSIONS
3.1. RATIONAL EXPRESSIONS RATIONAL NUMBERS In previous courses you have learned how to operate (do addition, subtraction, multiplication, and division) on rational numbers (fractions). Rational numbers
More informationPartial Fractions Decomposition
Partial Fractions Decomposition Dr. Philippe B. Laval Kennesaw State University August 6, 008 Abstract This handout describes partial fractions decomposition and how it can be used when integrating rational
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 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 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 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 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 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 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 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 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 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 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 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
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationZeros of Polynomial Functions
Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + 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 informationZero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.
MATH 11011 FINDING REAL ZEROS KSU OF A POLYNOMIAL Definitions: Polynomial: is a function of the form P (x) = a n x n + a n 1 x n 1 + + a x + a 1 x + a 0. The numbers a n, a n 1,..., a 1, a 0 are called
More informationZeros of a Polynomial Function
Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationFINITE FIELDS KEITH CONRAD
FINITE FIELDS KEITH CONRAD This handout discusses finite fields: how to construct them, properties of elements in a finite field, and relations between different finite fields. We write Z/(p) and F p interchangeably
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationOn the largest prime factor of x 2 1
On the largest prime factor of x 2 1 Florian Luca and Filip Najman Abstract In this paper, we find all integers x such that x 2 1 has only prime factors smaller than 100. This gives some interesting numerical
More information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
More informationSection 4.2: The Division Algorithm and Greatest Common Divisors
Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948
More informationZeros of Polynomial Functions
Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
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 information0.8 Rational Expressions and Equations
96 Prerequisites 0.8 Rational Expressions and Equations We now turn our attention to rational expressions - that is, algebraic fractions - and equations which contain them. The reader is encouraged to
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 informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationBasics 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
More informationSUM 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
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 informationAbstract 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
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 informationOn 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
More informationNotes 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
More information1 = (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
More informationRevised 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.
More informationPartial Fractions. (x 1)(x 2 + 1)
Partial Fractions Adding rational functions involves finding a common denominator, rewriting each fraction so that it has that denominator, then adding. For example, 3x x 1 3x(x 1) (x + 1)(x 1) + 1(x +
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
More informationMath 231b Lecture 35. G. Quick
Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the J-homomorphism could be defined by
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationLecture 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
More informationSOLVING QUADRATIC EQUATIONS OVER POLYNOMIAL RINGS OF CHARACTERISTIC TWO
Publicacions Matemàtiques, Vol 42 (1998), 131 142. SOLVING QUADRATIC EQUATIONS OVER POLYNOMIAL RINGS OF CHARACTERISTIC TWO Jørgen Cherly, Luis Gallardo, Leonid Vaserstein and Ethel Wheland Abstract We
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationSECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
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 informationFactoring 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
More informationThe 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,
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationk, 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
More informationA 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
More informationGröbner Bases and their Applications
Gröbner Bases and their Applications Kaitlyn Moran July 30, 2008 1 Introduction We know from the Hilbert Basis Theorem that any ideal in a polynomial ring over a field is finitely generated [3]. However,
More informationSOLVING 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
More informationAlgebra 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
More informationCyclotomic 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
More informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
More information63. Graph y 1 2 x and y 2 THE FACTOR THEOREM. The Factor Theorem. Consider the polynomial function. P(x) x 2 2x 15.
9.4 (9-27) 517 Gear ratio d) For a fixed wheel size and chain ring, does the gear ratio increase or decrease as the number of teeth on the cog increases? decreases 100 80 60 40 20 27-in. wheel, 44 teeth
More information26 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
More informationa 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
More informationCHAPTER 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
More informationDiscrete 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
More information2.3. Finding polynomial functions. An Introduction:
2.3. Finding polynomial functions. An Introduction: As is usually the case when learning a new concept in mathematics, the new concept is the reverse of the previous one. Remember how you first learned
More informationPrime 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.
More informationSUBGROUPS 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
More informationFACTORING 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,
More informationSECRET sharing schemes were introduced by Blakley [5]
206 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 1, JANUARY 2006 Secret Sharing Schemes From Three Classes of Linear Codes Jin Yuan Cunsheng Ding, Senior Member, IEEE Abstract Secret sharing has
More informationMathematics 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
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More informationThe 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
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationChapter 11 Number Theory
Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications
More informationPOLYNOMIAL FUNCTIONS
POLYNOMIAL FUNCTIONS Polynomial Division.. 314 The Rational Zero Test.....317 Descarte s Rule of Signs... 319 The Remainder Theorem.....31 Finding all Zeros of a Polynomial Function.......33 Writing a
More informationPOLYNOMIAL 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).
More informationCryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards
More informationIntroduction 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
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationCopy 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,...}
More information