Intro to Rings, Fields, Polynomials: Hardware Modeling by Modulo Arithmetic


 Evangeline Tyler
 2 years ago
 Views:
Transcription
1 Intro to Rings, Fields, Polynomials: Hardware Modeling by Modulo Arithmetic Priyank Kalla Associate Professor Electrical and Computer Engineering, University of Utah Lecture: Sep 2224, 2014
2 Agenda for Today Wish to build a polynomial algebra model for hardware Modulo arithmetic model is versatile: can represent both bitlevel and wordlevel constraints To build the algebraic/modulo arithmetic model: Rings, Fields, Modulo arithmetic Polynomials, Polynomial functions, Polynomial Rings Ideals, Varieties, and Gröbner Bases Decision procedures in verification P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
3 Motivation for Algebraic Computation Modeling for bitprecise algebraic computation Arithmetic RTLs: functions over kbitvectors kbitvector integers (mod 2 k ) = Z 2 k kbitvector Galois (Finite) field F 2 k For many of these applications SAT/SMT fail miserably! Computer Algebra and Algebraic Geometry + SAT/SMT Model: Circuits as polynomial functions f : Z 2 k Z 2 k, f : F 2 k F 2 k P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
4 Ring algebra All we need is an algebraic object where we can add, multiply, divide. These objects are Rings and Fields. P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
5 Groups, (G,0,+) An Abelian group is a set G and a binary operation + satisfying: Closure: For every a,b G,a+b G. Associativity: For every a,b,c G,a+(b +c) = (a+b)+c. Commutativity: For every a,b G,a+b = b +a. Identity: There is an identity element 0 G such that for all a G;a+0 = a. Inverse: If a G, then there is an element a 1 G such that a+a 1 = 0. Example: The set of Integers Z or Z n with + operation. P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
6 Rings (R,0,1,+, ) A Commutative ring with unity is a set R and two binary operations + and, as well as two distinguished elements 0,1 R such that, R is an Abelian group with respect to addition with additive identity element 0, and the following properties are satisfied: Multiplicative Closure: For every a,b R, a b R. Multiplicative Associativity: For every a, b, c R, a (b c) = (a b) c. Multiplicative Commutativity: For every a,b R, a b = b a. Multiplicative Identity: There is an identity element 1 R such that for all a R, a 1 = a. Distributivity: For every a,b,c R, a (b +c) = a b +a c holds for all a,b,c R. Example: The set of Integers Z or Z n with +, operations. P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
7 Rings Examples of rings: R,Q,C,Z Z n = {0,1,...,n 1} where +, computed +, (mod n) Modulo arithmetic: (a+b) (mod n) = (a (mod n)+b (mod n)) (mod n) (a b) (mod n) = (a (mod n) b (mod n)) (mod n) a (mod n) = (n a) (mod n) Arithmetic kbit vectors arithmetic over Z 2 k For k = 1, Z 2 B P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
8 Rings Examples of rings: R,Q,C,Z Z n = {0,1,...,n 1} where +, computed +, (mod n) Modulo arithmetic: (a+b) (mod n) = (a (mod n)+b (mod n)) (mod n) (a b) (mod n) = (a (mod n) b (mod n)) (mod n) a (mod n) = (n a) (mod n) Arithmetic kbit vectors arithmetic over Z 2 k For k = 1, Z 2 B But, what about division? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
9 How to define division? Over Q, can you divide 2 3 by 4 5? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
10 How to define division? Over Q, can you divide 2 3 by 4 5? Over C, can you divide a+ib c+id? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
11 How to define division? Over Q, can you divide 2 3 by 4 5? Over C, can you divide a+ib c+id? Over Z, can you divide 3 4? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
12 How to define division? Over Q, can you divide 2 3 by 4 5? Over C, can you divide a+ib c+id? Over Z, can you divide 3 4? Over Z (mod 8), can you divide 3 4? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
13 How to define division? Over Q, can you divide 2 3 by 4 5? Over C, can you divide a+ib c+id? Over Z, can you divide 3 4? Over Z (mod 8), can you divide 3 4? Over Z (mod 7), can you divide 3 4? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
14 How to define division? Over Q, can you divide 2 3 by 4 5? Over C, can you divide a+ib c+id? Over Z, can you divide 3 4? Over Z (mod 8), can you divide 3 4? Over Z (mod 7), can you divide 3 4? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
15 How to define division? Over Q, can you divide 2 3 by 4 5? Over C, can you divide a+ib c+id? Over Z, can you divide 3 4? Over Z (mod 8), can you divide 3 4? Over Z (mod 7), can you divide 3 4? Division is multiplication by a (multiplicative) inverse! P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
16 How to define division? Over Q, can you divide 2 3 by 4 5? Over C, can you divide a+ib c+id? Over Z, can you divide 3 4? Over Z (mod 8), can you divide 3 4? Over Z (mod 7), can you divide 3 4? Division is multiplication by a (multiplicative) inverse! Division For an element a in a ring R, a b = a b 1. Here, b 1 R s.t. b b 1 = 1. P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
17 Multiplicative Inverses Over Q: if b = 2 3, b 1 = 3 2? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
18 Multiplicative Inverses Over Q: if b = 2 3, b 1 = 3 2? Over Z: if b = 4, b 1 =? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
19 Multiplicative Inverses Over Q: if b = 2 3, b 1 = 3 2? Over Z: if b = 4, b 1 =? Over rings: inverses may not exist P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
20 Multiplicative Inverses Over Q: if b = 2 3, b 1 = 3 2? Over Z: if b = 4, b 1 =? Over rings: inverses may not exist Over Z 8 : if b = 3,b 1 =? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
21 Multiplicative Inverses Over Q: if b = 2 3, b 1 = 3 2? Over Z: if b = 4, b 1 =? Over rings: inverses may not exist Over Z 8 : if b = 3,b 1 =? Over Z 8 : if b = 6,b 1 =? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
22 Multiplicative Inverses Over Q: if b = 2 3, b 1 = 3 2? Over Z: if b = 4, b 1 =? Over rings: inverses may not exist Over Z 8 : if b = 3,b 1 =? Over Z 8 : if b = 6,b 1 =? Over Z 7 : if b = 6,b 1 =? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
23 Fields Field (F,0,1,+, ) A field F is a commutative ring with unity, where every element in F, except 0, has a multiplicative inverse: a (F {0}), â F such that a â = 1. P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
24 Fields Field (F,0,1,+, ) A field F is a commutative ring with unity, where every element in F, except 0, has a multiplicative inverse: a (F {0}), â F such that a â = 1. A field is called a finite field or Galois field when F has a finite number of elements. P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
25 Fields Field (F,0,1,+, ) A field F is a commutative ring with unity, where every element in F, except 0, has a multiplicative inverse: a (F {0}), â F such that a â = 1. A field is called a finite field or Galois field when F has a finite number of elements. The set Z p = Z (mod p) = {0,1,...,p 1} is a finite field, when p is a prime integer. P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
26 Fields Field (F,0,1,+, ) A field F is a commutative ring with unity, where every element in F, except 0, has a multiplicative inverse: a (F {0}), â F such that a â = 1. A field is called a finite field or Galois field when F has a finite number of elements. The set Z p = Z (mod p) = {0,1,...,p 1} is a finite field, when p is a prime integer. Z n,n p is a ring but not a field. So, Z 2 k is not a field, as even numbers in Z 2 k have no inverses. P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
27 Fields Field (F,0,1,+, ) A field F is a commutative ring with unity, where every element in F, except 0, has a multiplicative inverse: a (F {0}), â F such that a â = 1. A field is called a finite field or Galois field when F has a finite number of elements. The set Z p = Z (mod p) = {0,1,...,p 1} is a finite field, when p is a prime integer. Z n,n p is a ring but not a field. So, Z 2 k is not a field, as even numbers in Z 2 k have no inverses. Z 2 F 2 B {0,1} P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
28 B is arithmetic (mod 2) Boolean ANDORNOT can be mapped to +, (mod 2) P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
29 B is arithmetic (mod 2) B F 2 : Boolean ANDORNOT can be mapped to +, (mod 2) a a+1 (mod 2) a b a+b +a b (mod 2) a b a b (mod 2) a b a+b (mod 2) (1) where a,b F 2 = {0,1}. P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
30 Hardware Model in Z 2 Figure: = AND, = XOR. f 1 : s 0 +a 0 b 0 ; f 2 : s 1 +a 0 b 1, f 3 : s 2 +a 1 b 0 ; f 4 : s 3 +a 1 b 1, f 5 : r 0 +s 1 +s 2 ; f 6 : z 0 +s 0 +s 3, f 7 : z 1 +r 0 +s 3 P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
31 Finite Fields Z p : field of p elements, p = 2, 3, 5, 7,..., 163,... P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
32 Finite Fields Z p : field of p elements, p = 2, 3, 5, 7,..., 163,... Is there a field of 4 elements F 4? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
33 Finite Fields Z p : field of p elements, p = 2, 3, 5, 7,..., 163,... Is there a field of 4 elements F 4? Yes, we can have fields of p k elements F p k P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
34 Finite Fields Z p : field of p elements, p = 2, 3, 5, 7,..., 163,... Is there a field of 4 elements F 4? Yes, we can have fields of p k elements F p k These are called extension fields, we will study them later P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
35 Finite Fields Z p : field of p elements, p = 2, 3, 5, 7,..., 163,... Is there a field of 4 elements F 4? Yes, we can have fields of p k elements F p k These are called extension fields, we will study them later In fact, we are interested in F 2 k (kbit vector arithmetic) P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
36 Finite Fields Z p : field of p elements, p = 2, 3, 5, 7,..., 163,... Is there a field of 4 elements F 4? Yes, we can have fields of p k elements F p k These are called extension fields, we will study them later In fact, we are interested in F 2 k (kbit vector arithmetic) Fields are unique factorization domains (UFDs) P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
37 Finite Fields Z p : field of p elements, p = 2, 3, 5, 7,..., 163,... Is there a field of 4 elements F 4? Yes, we can have fields of p k elements F p k These are called extension fields, we will study them later In fact, we are interested in F 2 k (kbit vector arithmetic) Fields are unique factorization domains (UFDs) P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
38 Finite Fields Z p : field of p elements, p = 2, 3, 5, 7,..., 163,... Is there a field of 4 elements F 4? Yes, we can have fields of p k elements F p k These are called extension fields, we will study them later In fact, we are interested in F 2 k (kbit vector arithmetic) Fields are unique factorization domains (UFDs) Fermat s Little Theorem x F p, x p x = 0 P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
39 Zero Divisors Zero Divisors (ZD) For a,b R,a,b 0,a b = 0. Then a,b are zero divisors of each other. Z n,n p has zero divisors. What about Z p? Integral Domains Any set (ring) with no zero divisors: Z,R,Q,C,Z p,f 2 k. What about Z 2 k? Relationships Commutative Rings Integral Domains (no ZD) Unique Factorization Domains Fields For Hardware: Our interests nonufd Rings (Z 2 k) and Fields F 2 k P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
40 Verification Problems and UFDs In 3bit arithmetic Z 8 : (x 2 +6x) (mod 8) P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
41 Verification Problems and UFDs In 3bit arithmetic Z 8 : (x 2 +6x) (mod 8) Factorize according to its roots: x(x +6) P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
42 Verification Problems and UFDs In 3bit arithmetic Z 8 : (x 2 +6x) (mod 8) Factorize according to its roots: x(x +6) What about (x +2)(x +4)? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
43 Verification Problems and UFDs In 3bit arithmetic Z 8 : (x 2 +6x) (mod 8) Factorize according to its roots: x(x +6) What about (x +2)(x +4)? Degree 2 polynomial has more roots than the degree? Roots x = 0,2,4,6? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
44 Verification Problems and UFDs In 3bit arithmetic Z 8 : (x 2 +6x) (mod 8) Factorize according to its roots: x(x +6) What about (x +2)(x +4)? Degree 2 polynomial has more roots than the degree? Roots x = 0,2,4,6? Z 8 = nonufd P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
45 Verification Problems and UFDs In 3bit arithmetic Z 8 : (x 2 +6x) (mod 8) Factorize according to its roots: x(x +6) What about (x +2)(x +4)? Degree 2 polynomial has more roots than the degree? Roots x = 0,2,4,6? Z 8 = nonufd Cannot use factorization to prove equivalence over nonufds. P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
46 Consolidating the results so far... Over fields Z p,f 2 k,r,q,c We can add, multiply, divide No zerodivisors, can uniquely factorize a polynomial according to its roots Rings Z: integral domains, unique factorization, but no inverses Over Rings Z n,n p; e.g. n = 2 k Presence of zero divisors nonufds, polynomial can have more zeros than its degree Cannot perform division P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
47 Polynomials Let x 1,...,x d be variables Monomial is a power product: X = x α 1 1 xα xα d d, α i Z 0 Polynomial: sum of terms f = c 1 X 1 +c 2 X 2 + +c t X t, where X i are monomials and c i are coefficients f = x 55 not a polynomial! The terms of f have to be ordered: X 1 > X 2 > > X t Term ordering for univariate polynomials is based on the degree: e.g. f = 3x x 3 +4 Multivariate termordering is a lot more involved and we ll study it shortly P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
48 For symbolic computation: Polynomial Rings Let F be a field (any field: R,Q,C,Z p ) P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
49 For symbolic computation: Polynomial Rings Let F be a field (any field: R,Q,C,Z p ) Then, R = F[x] denotes the set (ring) of all univariate polynomials in x (including constants), with coefficients in F P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
50 For symbolic computation: Polynomial Rings Let F be a field (any field: R,Q,C,Z p ) Then, R = F[x] denotes the set (ring) of all univariate polynomials in x (including constants), with coefficients in F Examples: Let R = Q[x], then x R,(x x57 ) R and so on P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
51 For symbolic computation: Polynomial Rings Let F be a field (any field: R,Q,C,Z p ) Then, R = F[x] denotes the set (ring) of all univariate polynomials in x (including constants), with coefficients in F Examples: Let R = Q[x], then x R,(x x57 ) R and so on Is F[x] really a ring or a field? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
52 For symbolic computation: Polynomial Rings Let F be a field (any field: R,Q,C,Z p ) Then, R = F[x] denotes the set (ring) of all univariate polynomials in x (including constants), with coefficients in F Examples: Let R = Q[x], then x R,(x x57 ) R and so on Is F[x] really a ring or a field? Does every nonzero element in F[x] have an inverse? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
53 For symbolic computation: Polynomial Rings Let F be a field (any field: R,Q,C,Z p ) Then, R = F[x] denotes the set (ring) of all univariate polynomials in x (including constants), with coefficients in F Examples: Let R = Q[x], then x R,(x x57 ) R and so on Is F[x] really a ring or a field? Does every nonzero element in F[x] have an inverse? Let f = 3 2 (x2 ) Q[x], What is f 1? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
54 For symbolic computation: Polynomial Rings Let F be a field (any field: R,Q,C,Z p ) Then, R = F[x] denotes the set (ring) of all univariate polynomials in x (including constants), with coefficients in F Examples: Let R = Q[x], then x R,(x x57 ) R and so on Is F[x] really a ring or a field? Does every nonzero element in F[x] have an inverse? Let f = 3 2 (x2 ) Q[x], What is f 1? F[x 1,x 2,...,x d ] denotes the set (ring) of all multivariate polynomials in x 1,...,x d P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
55 For symbolic computation: Polynomial Rings Let F be a field (any field: R,Q,C,Z p ) Then, R = F[x] denotes the set (ring) of all univariate polynomials in x (including constants), with coefficients in F Examples: Let R = Q[x], then x R,(x x57 ) R and so on Is F[x] really a ring or a field? Does every nonzero element in F[x] have an inverse? Let f = 3 2 (x2 ) Q[x], What is f 1? F[x 1,x 2,...,x d ] denotes the set (ring) of all multivariate polynomials in x 1,...,x d R need not have coefficients over a field. E.g., Z 2 k[x 1,...,x d ]: polynomial ring with coefficients in Z 2 k P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
56 For symbolic computation: Polynomial Rings Let F be a field (any field: R,Q,C,Z p ) Then, R = F[x] denotes the set (ring) of all univariate polynomials in x (including constants), with coefficients in F Examples: Let R = Q[x], then x R,(x x57 ) R and so on Is F[x] really a ring or a field? Does every nonzero element in F[x] have an inverse? Let f = 3 2 (x2 ) Q[x], What is f 1? F[x 1,x 2,...,x d ] denotes the set (ring) of all multivariate polynomials in x 1,...,x d R need not have coefficients over a field. E.g., Z 2 k[x 1,...,x d ]: polynomial ring with coefficients in Z 2 k R[x 1,...,x d ] is a finite or infinite set? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
57 For symbolic computation: Polynomial Rings Let F be a field (any field: R,Q,C,Z p ) Then, R = F[x] denotes the set (ring) of all univariate polynomials in x (including constants), with coefficients in F Examples: Let R = Q[x], then x R,(x x57 ) R and so on Is F[x] really a ring or a field? Does every nonzero element in F[x] have an inverse? Let f = 3 2 (x2 ) Q[x], What is f 1? F[x 1,x 2,...,x d ] denotes the set (ring) of all multivariate polynomials in x 1,...,x d R need not have coefficients over a field. E.g., Z 2 k[x 1,...,x d ]: polynomial ring with coefficients in Z 2 k R[x 1,...,x d ] is a finite or infinite set? Z 2 k[x 1,...,x d ] is a finite or infinite set? (It s a loaded question) P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
58 Operations in Polynomial Rings add, mult polynomials, just like you did in highschool Reduce coefficients modulo the coefficient field/ring Consider: f 1,f 2 Z 4 [x,y] f 1 = 3x +2y; f 2 = 2x +2y f 1 +f 2 = x;f 1 f 2 = 2x 2 +2xy Reduce coefficients in Z 4, i.e. (mod 4) Solve f 1 = f 2 = 0, Solutions (x,y) should be in Z 4 P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
59 Operations in Polynomial Rings add, mult polynomials, just like you did in highschool Reduce coefficients modulo the coefficient field/ring Consider: f 1,f 2 Z 4 [x,y] f 1 = 3x +2y; f 2 = 2x +2y f 1 +f 2 = x;f 1 f 2 = 2x 2 +2xy Reduce coefficients in Z 4, i.e. (mod 4) Solve f 1 = f 2 = 0, Solutions (x,y) should be in Z 4 (x,y) = {(0,0),(0,2)} P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
60 Polynomial Functions (Polyfunctions) A function is a map f : A B; where A,B are the domain and codomain, respectively. Ex: f : R R is a function over Reals; and f : Z 2 k Z 2 k is a function over the finite integer ring Z 2 k PolyFunction Given a function f : A B, does there exist a (canonical) polynomial F that describes f? If so, f is a polynomial function. Over finite fields every function f : F p k F p k is a polynomial function. It is possible to interpolate a polynomial F from f. Not every f : Z n Z n,n p, is a polynomial function. Example1: f : Z 4 Z 4,f(0) = 0;f(1) = 1;f(2) = 0;f(3) = 1; then F = x 2 (mod 4) Example2: f : Z 4 Z 4,f(0) = 0;f(1) = 0;f(2) = 1;f(3) = 1; No polynomial F (mod 4) represents f P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
61 Zero Polynomials and Zero Functions Over Z 4 [x], F 1 = 2x 2,F 2 = 2x F 1 F 2 = 2x 2 2x = 0( x Z4) F 1 F 2 and F 1 F 2 0 (zero function) Need a unique, canonical representation of F over Z 2 k,f 2 k Over Galois fields Z p : x p = x (mod p), so (f)(x p x) 0 in Z p Over infinite fields, life is easier: Let F be an infinite field, and F F[x 1,...,x d ]. Then: F = 0 f : F n F is the zero function P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
62 Zero Polynomials and Zero Functions Over Z 4 [x], F 1 = 2x 2,F 2 = 2x F 1 F 2 = 2x 2 2x = 0( x Z4) F 1 F 2 and F 1 F 2 0 (zero function) Need a unique, canonical representation of F over Z 2 k,f 2 k Over Galois fields Z p : x p = x (mod p), so (f)(x p x) 0 in Z p Over infinite fields, life is easier: Let F be an infinite field, and F F[x 1,...,x d ]. Then: F = 0 f : F n F is the zero function Circuits are functions over Z 2 k,f 2 k. Hardware verification is a hard problem! P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
63 Ideals in Rings R = ring, Ideal J R 0 J x,y J,x +y J x J,y R,x y J Examples of Ideals:? P. Kalla (Univ. of Utah) Rings, Fields, Algebra Lecture: Sep 2224, / 22
Computer Algebra for Computer Engineers
p.1/14 Computer Algebra for Computer Engineers Preliminaries Priyank Kalla Department of Electrical and Computer Engineering University of Utah, Salt Lake City p.2/14 Notation R: Real Numbers Q: Fractions
More informationGalois Fields and Hardware Design
Galois Fields and Hardware Design Construction of Galois Fields, Basic Properties, Uniqueness, Containment, Closure, Polynomial Functions over Galois Fields Priyank Kalla Associate Professor Electrical
More informationHardware Datapath Verification using Commutative Algebra and Algebraic Geometry
Hardware Datapath Verification using Commutative Algebra and Algebraic Geometry Priyank Kalla Associate Professor Electrical and Computer Engineering, University of Utah kalla@ece.utah.edu http://www.ece.utah.edu/~kalla
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 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 informationLecture 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
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 informationBasic Properties of Rings
Basic Properties of Rings A ring is an algebraic structure with an addition operation and a multiplication operation. These operations are required to satisfy many (but not all!) familiar properties. Some
More informationFactorization 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
More informationAn Introduction to Galois Fields and ReedSolomon Coding
An Introduction to Galois Fields and ReedSolomon Coding James Westall James Martin School of Computing Clemson University Clemson, SC 296341906 October 4, 2010 1 Fields A field is a set of elements on
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 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 informationFactorization Algorithms for Polynomials over Finite Fields
Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 20110503 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is
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 informationGroups in Cryptography
Groups in Cryptography Çetin Kaya Koç http://cs.ucsb.edu/~koc/cs178 koc@cs.ucsb.edu Koç (http://cs.ucsb.edu/~koc) ucsb cs 178 intro to crypto winter 2013 1 / 13 Groups in Cryptography A set S and a binary
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 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 informationMATH 433 Applied Algebra Lecture 13: Examples of groups.
MATH 433 Applied Algebra Lecture 13: Examples of groups. Abstract groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements
More informationConstructing Zero Divisor Graphs
Constructing Zero Divisor Graphs Alaina Wickboldt, Louisiana State University Alonza Terry, Xavier University of Louisiana Carlos Lopez, Mississippi State University SMILE 2011 Outline Introduction/Background
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 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 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 informationPart V, Abstract Algebra CS131 Mathematics for Computer Scientists II Note 29 RINGS AND FIELDS
CS131 Part V, Abstract Algebra CS131 Mathematics for Computer Scientists II Note 29 RINGS AND FIELDS We now look at some algebraic structures which have more than one binary operation. Rings and fields
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 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 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 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 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 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 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 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 informationHardware Datapath Verification using Algebraic Geometry
Hardware Datapath Verification using Algebraic Geometry Priyank Kalla A = a 0 + a 1 α B = b 0 + b 1 α ideal J = Z = z 0 + z 1 α z 0 = a 0 b 0 + a 1 b 1 z 1 = a 0 b 1 + a 1 b 0 + a 1 b 1 Is Z = AB I(V (J))?
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 nonnegative integers. We say that A divides B, denoted
More informationAlgebra I Notes Review Real Numbers and Closure Unit 00a
Big Idea(s): Operations on sets of numbers are performed according to properties or rules. An operation works to change numbers. There are six operations in arithmetic that "work on" numbers: addition,
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 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 information3 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
More informationfg = f g. 3.1.1. Ideals. An ideal of R is a nonempty ksubspace I R closed under multiplication by elements of R:
30 3. RINGS, IDEALS, AND GRÖBNER BASES 3.1. Polynomial rings and ideals The main object of study in this section is a polynomial ring in a finite number of variables R = k[x 1,..., x n ], where k is an
More informationABSTRACT 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
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 informationNotes on Algebraic Structures. Peter J. Cameron
Notes on Algebraic Structures Peter J. Cameron ii Preface These are the notes of the secondyear course Algebraic Structures I at Queen Mary, University of London, as I taught it in the second semester
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 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 information11 Multivariate Polynomials
CS 487: Intro. to Symbolic Computation Winter 2009: M. Giesbrecht Script 11 Page 1 (These lecture notes were prepared and presented by Dan Roche.) 11 Multivariate Polynomials References: MC: Section 16.6
More informationMODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.
MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on
More informationBasic 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,
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationNonunique factorization of polynomials over residue class rings of the integers
Comm. Algebra 39(4) 2011, pp 1482 1490 Nonunique factorization of polynomials over residue class rings of the integers Christopher Frei and Sophie Frisch Abstract. We investigate nonunique factorization
More informationThe 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 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 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 informationGroups 1. Definition 1 A Group G is a set with an operation which satisfies the following: e a = a e = e. a a 1 = a 1 a = e.
Groups 1 1 Introduction to Groups Definition 1 A Group G is a set with an operation which satisfies the following: 1. there is an identity element e G, such that for every a G e a = a e = e 2. every element
More informationMATH 371 Class notes/outline September 12, 2013
MATH 371 Class notes/outline September 12, 2013 Polynomials Another source of ring theory is the study of polynomials, particularly polynomials over a field. For now, we ll restrict our attention to the
More informationIntroduction to polynomials
Worksheet 4.5 Polynomials Section 1 Introduction to polynomials A polynomial is an expression of the form p(x) = p 0 + p 1 x + p 2 x 2 + + p n x n, (n N) where p 0, p 1,..., p n are constants and x os
More informationFunctions and Equations
Centre for Education in Mathematics and Computing Euclid eworkshop # Functions and Equations c 014 UNIVERSITY OF WATERLOO Euclid eworkshop # TOOLKIT Parabolas The quadratic f(x) = ax + bx + c (with a,b,c
More informationVocabulary Words and Definitions for Algebra
Name: Period: Vocabulary Words and s for Algebra Absolute Value Additive Inverse Algebraic Expression Ascending Order Associative Property Axis of Symmetry Base Binomial Coefficient Combine Like Terms
More informationGroups, Rings, and Fields. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, S S = {(x, y) x, y S}.
Groups, Rings, and Fields I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, A binary operation φ is a function, S S = {(x, y) x, y S}. φ : S S S. A binary
More informationAPPLICATIONS OF THE ORDER FUNCTION
APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and
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 informationAlgebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 201213 school year.
This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra
More information3 Monomial orders and the division algorithm
3 Monomial orders and the division algorithm We address the problem of deciding which term of a polynomial is the leading term. We noted above that, unlike in the univariate case, the total degree does
More information4.4 Clock Arithmetic and Modular Systems
4.4 Clock Arithmetic and Modular Systems A mathematical system has 3 major properies. 1. It is a set of elements 2. It has one or more operations to combine these elements (ie. Multiplication, addition)
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 informationECE 842 Report Implementation of Elliptic Curve Cryptography
ECE 842 Report Implementation of Elliptic Curve Cryptography WeiYang Lin December 15, 2004 Abstract The aim of this report is to illustrate the issues in implementing a practical elliptic curve cryptographic
More informationPROBLEM 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
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 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 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 informationAlgebra I Vocabulary Cards
Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Absolute Value Order of Operations Expression
More information4. FIRST STEPS IN THE THEORY 4.1. A
4. FIRST STEPS IN THE THEORY 4.1. A Catalogue of All Groups: The Impossible Dream The fundamental problem of group theory is to systematically explore the landscape and to chart what lies out there. We
More informationThe mathematics of RAID6
The mathematics of RAID6 H. Peter Anvin 1 December 2004 RAID6 supports losing any two drives. The way this is done is by computing two syndromes, generally referred P and Q. 1 A quick
More informationAlgebraic Systems, Fall 2013, September 1, 2013 Edition. Todd Cochrane
Algebraic Systems, Fall 2013, September 1, 2013 Edition Todd Cochrane Contents Notation 5 Chapter 0. Axioms for the set of Integers Z. 7 Chapter 1. Algebraic Properties of the Integers 9 1.1. Background
More informationMath 34560 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field
Math 34560 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
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 informationEXERCISES 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
More informationIntroduction to Modern Algebra
Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write
More informationFactoring Polynomials
UNIT 11 Factoring Polynomials You can use polynomials to describe framing for art. 396 Unit 11 factoring polynomials A polynomial is an expression that has variables that represent numbers. A number can
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 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 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 informationA 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
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 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 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 informationSome facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the
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 informationa 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
More informationCORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREERREADY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREERREADY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
More informationF1.3YE2/F1.3YK3 ALGEBRA AND ANALYSIS. Part 2: ALGEBRA. RINGS AND FIELDS
F1.3YE2/F1.3YK3 ALGEBRA AND ANALYSIS Part 2: ALGEBRA. RINGS AND FIELDS LECTURE NOTES AND EXERCISES Contents 1 Revision of Group Theory 3 1.1 Introduction................................. 3 1.2 Binary Operations.............................
More informationMonogenic Fields and Power Bases Michael Decker 12/07/07
Monogenic Fields and Power Bases Michael Decker 12/07/07 1 Introduction Let K be a number field of degree k and O K its ring of integers Then considering O K as a Zmodule, the nicest possible case is
More informationORDERS OF ELEMENTS IN A GROUP
ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since
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 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 informationMACHINE LEARNING. Introduction. Alessandro Moschitti
MACHINE LEARNING Introduction Alessandro Moschitti Department of Computer Science and Information Engineering University of Trento Email: moschitti@disi.unitn.it Course Schedule Lectures Tuesday, 14:0016:00
More information9. 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 n1 x n1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role
More informationThe mathematics of RAID6
The mathematics of RAID6 H. Peter Anvin First version 20 January 2004 Last updated 20 December 2011 RAID6 supports losing any two drives. syndromes, generally referred P and Q. The way
More information3. QUADRATIC CONGRUENCES
3. QUADRATIC CONGRUENCES 3.1. Quadratics Over a Finite Field We re all familiar with the quadratic equation in the context of real or complex numbers. The formula for the solutions to ax + bx + c = 0 (where
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 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 information2. 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,
More information