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

 To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video
Save this PDF as:

Size: px
Start display at page:

Download "The finite field with 2 elements The simplest finite field is"

## Transcription

1 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 = = = = = = = = 1 Notation Z 2 is sometimes used, but this is illadvised since in closely-related contexts Z 2 is the 2-adic integers, an entirely different thing. Remark: Since = 0, 1 = 1 if by 1 we mean something which when added to 1 gives 0. Similarly, since = 0. 0 = 0 1

2 Remark: It is not possible to tell without context whether symbols 1 and 0 refer to elements of F 2 or something else. Remark: With 0 and 1 viewed as bits, the addition in F 2 is exclusive or. This is worth noting, but there are important and useful other viewpoints which we will pursue. One is the construction of Z/p, the integers modulo p. Here is p = 2. The further abstraction is to finite fields. Remark: In F 2 2 = = 0 3 = = = = 1 4 = = = = 0 and so on. Yes, here 2 = 0 etc. 3 = 1 4 = 0 2

3 Polynomials over GF (2) Basic algebra with polynomials having coefficients in the finite field F 2 is in almost exactly the same as polynomials having real or complex coefficients. A polynomial P (x) in the indeterminate x with coefficients which are real numbers is a sum of powers of x with real numbers in front of them, like P (x) = x x The numbers in front of the powers of x are the coefficients. The degree of a polynomial is the highest power of x that appears with a nonzero coefficient. By convention, to avoid making exceptions, assign the 0-polynomial degree. Proposition: The degree of the product of two polynomials is the sum of their degrees. Proof: The coefficient of the highest-degree term of the product is the product of the highest-degree terms of the factors. /// 3

4 A polynomial gives rise to a polynomial function, denoted by the same symbol, into which we can plug numbers in place of the indeterminate x. Analogously, a polynomial in the indeterminate x with coefficients in the finite field F 2 looks like a polynomial with real coefficients but with coefficients only 0 or 1. Remark: The exponents of x are always ordinary integers, regardless of what kind of coefficients we use. For example, P (x) = 1 x x x x + 1 x 0 = x is such a polynomial. Remark: Since the only coefficients are 0 and 1, if the coefficient of a power of x is 0, don t write it at all, and if the coefficient is 1 write the power of x. Such a polynomial gives a polynomial function from F 2 to F 2, by evaluation: P (0) = = 1 P (1) = = 0 4

5 Unlike with real numbers, different polynomials can give rise to the same function. For example, P (x) = x 2 + x + 1 and Q(x) = 1 have the same values for any input in F 2. Addition of polynomials with coefficients in F 2 is to add the coefficients of corresponding powers of x, inside F 2. For example, (x 3 + x 2 + 1) + (x 3 + x + 1) = (1 + 1) x 3 + (1 + 0) x 2 + (0 + 1)x + (1 + 1) = x 2 + x Multiplication of polynomials is as usual, much like multiplying decimal integers, keeping track of powers of x instead of decimal places. Multiplication of polynomials is simpler in that there is no carry. Integer multiplication is

6 Polynomial multiplication is similar. For example, with real coefficients 2x 3 +3x 2 +x 3 x 2 2x +1 +2x 3 +3x 2 +x 3 4x 4 6x 3 2x 2 +6x 2x 5 +3x 4 +1x 3 3x 2 2x 5 x 4 3x 3 2x 2 +7x 3 Each term in the first polynomial multiplies each term in the second polynomial. Analogously, multiply polynomials with coefficients in F 2 : each term in the first multiplies each term in the second, and add them. This is easier because the arithmetic of F 2 is so easy. 6

7 For example, keeping in mind that = 0 in the finite field F 2 : x 3 +x +1 x 2 +x +1 +x 3 +x +1 +x 4 +x 2 +x x 5 +x 3 +x 2 x 5 +x 4 +1 Preserve the vertical alignment of like powers of x against miscopying errors. Remark: With coefficients in F 2, polynomials which look different may be the same if we do not reduce the coefficients to be either 0 or 1. For example, x 1 = x + 1 = x + 1 2x + 1 = 1 = 2x + 3 7

8 Division of one polynomial by another is analogous to long division (with remainder) of integers, except there is no borrowing nor carrying. First we do an example with coefficients viewed as being ordinary integers or real numbers: x 3 +x 2 x 1 1 R x 4 + 3x + 2 x 5 +x 3 +x +1 x 8 +x x 4 +x x +x 0 x x x 4 +x x 7 x x +x 0 x x x 3 +x x 6 x 5 +0 x 3 x 2 +x +x 0 x 6 +0 x 4 +0 x 2 x +0 x 5 +x 4 x x+x 0 x 5 +0 x 3 +0 x x 0 x x+2 x 3 x 5 s go into x 8 : multiply the divisor by x 3 and subtract from dividend, yielding x 7 x 6 +x+1. x 2 x 5 s go into x 7 : multiply the divisor by x 2 and subtract, giving new remainder x 6 x 5 x 3 x 2 +x+1. Continue until degree of the remainder < degree of divisor. 8

9 Now view the coefficients as in F 2, so 1 = 1, = 0, etc: x 3 +x 2 +x +1 R x 4 + x x 5 +x 3 +x +1 x 8 +x x 4 +x x +x 0 x x x 4 +x x 7 +x x +x 0 x x x 3 +x x 6 +x x 3 +x 2 +x +x 0 +x x x 2 +x +0 +x 5 +x 4 +x x 0 +x x x +x 0 x x +0 Remark: Because in F 2 we have 1 = +1, addition and subtraction are the same. We can add, which is easier, rather than subtract. Remark: Keep in mind things like 2 = 0, 3 = 1 in F 2. Remark: It s impossible to tell what the coefficients of a polynomial are without context. Remark: Regardless of the coefficients, the exponents of x are non-negative integers. 9

10 Cyclic redundancy checks (CRCs) Cyclic redundancy checks (CRCs) detect but do not correct errors, generalizing parity check bits, but better. An optimal n-bit CRC will detect any 2 bit errors in 2 n 1. Common values of n are 12, 16, and 32. With data a stream of bits like , create a data polynomial with coefficients in F 2 by using the 0s and 1s as coefficients: x 9 + x 8 + x 4 + x 2 A CRC-computing algorithm is specified by its generating polynomial, a polynomial with coefficients in F 2. For example, take as generating polynomial x 3 + x + 1 The CRC value of the data is computed by finding the remainder when the data polynomial is divided by the generating polynomial. 10

11 With data polynomial = x 9 + x 8 + x 4 + x 2 and generating polynomial 1101 = x 3 + x + 1 x 6 +x 5 +x Rx 2 x 3 + x + 1 x 9 +x x x x x 7 +x 6 x 8 +x 7 +x x x x x 6 +x 5 x x 5 +x x x x 5 +x 4 x 2 Thus, the remainder is x 2, which we translate back to bits as 100 (descending degree). That is CRC with gen poly x 3 + x + 1 computed for data is 100 Remark: Division can be implemented cleverly so the CRC of large data can be computed quickly. 11

12 Remark: In some cases division is run in the opposite direction bit-wise, meaning that the bit string is interpreted as coefficients in ascending rather than descending order. This doesn t change the idea but changes the interpretation. Remark: Computation of a single parity bit is computation of CRC with generating polynomial x + 1. Remark: For CRC generating polynomials of degree n there are 2 n possible values of CRC of data, since the remainder after division can be any polynomial of degree n 1 or less. If the remainders are uniformly distributed then the CRC misses only 1 in 2 n bit errors. 12

13 Remark: A common but deficient type of redundant information computed to detect errors or changes in data is an XOR checksum. meaning exclusive-or. These are easy in typical computer operations: XOR all the bytes to produce a single-byte checksum value. This is appealing because it is easy and fast. With 2 8 different possible checksum values (because of the 8-bit ASCII bytes) it would seem that these checksums should be good at detecting errors. However, since some 8-bit bytes are much more common than others, these checksum values are not uniformly distributed among the 2 8 possibilities. The XOR checksum is simply the (bad) CRC with generating polynomial x 8 1 Remark: We should realize that if we are unhappy with the statistical (error-detecting) properties of a CRC then we can try a different generating polynomial. 13

14 Better CRC s in real life are among the following standard ones: and x 12 + x 11 + x 3 + x + 1 x 16 + x 12 + x x 32 + x 26 + x 23 + x 22 + x 16 + x 12 + x 11 + x 10 +x 8 + x 7 + x 5 + x 4 + x 2 + x + 1 These catch all two-bit errors in very long strings: that degree 12 CRC catches all two-bit errors up to distance apart, the degree 16 CRC catches all two-bit errors up to distance apart, and the degree 32 CRC catches all two-bit errors up to distance apart. Remark: This is so because these polynomials are all primitive, discussed subsequently. 14

15 What errors does a CRC catch? Algebra can explain what errors will be detected by a CRC, and how choices of the generating polynomial affect performance. For CRC with generator g and for data a polynomial d (both with coefficients in F 2 ), suppose that d is transmitted or played back with some errors, and becomes d. The error vector or error polynomial is the difference e = d d = d d The number of non-zero coefficients in e is its Hamming weight, and is the number of bit errors. 15

16 Let r be the CRC value of d, the remainder when d is divided by g. d = q g + r where q is the quotient. Let r be the CRC value of d, and d = q g + r where q is the quotient dividing d by g. Then the error is e = d d = (q g + r) ( q g + r) = (q q) g + r r The remainder upon dividing e by g is r r. The CRC fails to detect error e = d d the remainder r r must be 0, that is if g divides e (with remainder 0). Remark: Take for granted for now that divisibility properties of polynomials with coefficients in F 2 are reasonable and consistent with divisibility properties of polynomials with real or complex coefficients. 16

17 If there is just one bit error, at i th position, the error polynomial is e(x) = x i undetected by the CRC if and only if g(x) divides e(x) = x i. Since x i is the product of i copies of x, g(x) cannot divide x i unless g(x) = x j for some j i. So g(x) = x + 1 detects single bit errors. With two bit errors, at m th and n th positions (with m < n), the error is e(x) = x m + x n undetected if and only if g(x) divides e(x) = x m + x n = x m (1 + x n m ) If g(x) has constant term 1, then g has no factor of x and g(x) must divide 1 + x n m. 17

18 Example: About detectability of two-bit errors: the XOR checksum, the CRC with g(x) = x 8 1. Recall high-school algebra x 2 1 = (x 1)(x + 1) x 3 1 = (x 1)(x 2 + x + 1) x 4 1 = (x 1)(x 3 + x 2 + x + 1) x 5 1 = (x 1)(x 4 + x 3 + x 2 + x + 1)... x N 1 = (x 1)(x N x + 1) Replaceng x by x 8 x 16 1 = (x 8 1)(x 8 + 1) x 24 1 = (x 8 1)(x 16 + x 8 + 1) x 32 1 = (x 8 1)(x 24 + x 16 + x 8 + 1) x 40 1 = (x 8 1)(x 32 +x 24 +x 16 +x 8 +1)... x 8N 1 = (x 8 1)(x 8(N 1) x 8 + 1) That is, x 8 1 divides (with remainder 0) any polynomial x 8N 1. So two bit errors occur a distance apart which is a multiple of 8, the XOR checksum CRC will not detect it. 18

19 Example: But almost this performance can already be achieved by a smaller/cheaper CRC: the CRC with generating polynomial x 3 + x + 1, of degree 3 rather than 8 only fails to detect two-bit errors a multiple of 7 apart. That is, x 3 + x + 1 divides x N 1 (with remainder 0) only when N is a multiple of 7 smaller N works. (How to check?) This property is a consequence of primitivity, discussed later. Example: Still about 2-bit errors: using CRC with generating polynomial x 4 + x + 1, even though only degree 4, fails to detect two-bit errors only when they re a multiple of 15 apart. That is, x 4 +x+1 divides x N 1 (with remainder 0) only when N is a multiple of 15. (How to check?) This shows the XOR checksum is inefficient. 19

20 Example: Still thinking about 2-bit errors: using the CRC with generating polynomial x 5 + x 2 + 1, even though it s only of degree 5, fails to detect two-bit errors only when a multiple of 31 apart. x 5 + x divides x N 1 only when N is a multiple of 32. Can certainly check by trying to divide all candidates that no smaller N works, but this is not the intelligent way to verify the property. Example: Changing the generating polynomial slightly from x 5 +x 2 +1 to x 5 +x+1,. mysteriously, the performance is degraded so that two-bit errors a multiple of 21 apart will pass undetected. Example: Changing to generating polynomial x 5 + x 4 + x + 1 mysteriously causes a further degradation: two-bit errors which are a multiple of 8 apart will pass undetected. 20

21 Remark: While the degree of the polynomial is higher, so that the CRC s reported value contains more bits, the choice of how these bits are computed is suboptimal. Example: By contrast, the CRC with generator x 16 + x 15 + x = (x + 1)(x 15 + x + 1) will fail to detect two-bit errors only if they are a multiple of = apart! (Obviously this is not discovered by brute force!) Remark: As in the last example, the most effective CRC s are obtained by taking generating polynomials which have a factor like x 15 + x + 1 which is irreducible, meaning that it can t be factored further into smallerdegree polynomials with coefficients in F 2. This is the polynomial analogue of being a prime number. Further, not only is this polynomial irreducible, it is primitive, meaning that the smallest integer N such that the polynomial divides x N 1 is N = 2 d 1 where d is the degree of the polynomial. 21

22 Remark: It is unclear whether there are many such things, how to find them, how to verify the property, etc. Remark: The 16-bit CRC above detects all 3- bit errors in data of bits or less because it is the product of x+1 with a primitive degree 15 polynomial. The primitive degree 15 polynomial detects two-bit errors within distance of while the x + 1 detects all errors consisting of an odd number of bit errors. Burst errors are errors close together. A CRC of degree n with non-zero constant term can detect a any burst error of length < n: the error can be written as e(x) = x n p(x) where p(x) is a polynomial of degree < n. For the CRC to fail to detect this, it must be that g(x) divides e(x) (with remainder 0). Since g(x) has non-zero constant term it has no factors of x, so for g(x) to divide x n p(x) it must be that g(x) actually divides p(x). But if the degree of p(x) is less than the degree of g(x) this is impossible. Thus, the error will be detected. 22

23 Remark: We have implicity used unique factorization of polynomials with coefficients in F 2. This deserves proof later. Remark: It is useful that polynomials f(x) with coefficients in F 2 have the funny property f(x 2 ) = f(x) 2 To see this, let f(x) = x n + g(x) with g(x) the lower-degree terms in f(x). Then f(x) 2 = (x n ) 2 + 2x n g(x) + g(x) 2 = (x n ) g(x) 2 since 2 = 0 in F 2. By induction on the number of terms, assume g(x) 2 = g(x 2 ), so f(x) 2 = (x n ) 2 + g(x 2 ) = (x 2 ) n + g(x 2 ) = f(x 2 ) as asserted. /// 23

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

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

### Sheet 7 (Chapter 10)

King Saud University College of Computer and Information Sciences Department of Information Technology CAP240 First semester 1430/1431 Multiple-choice Questions Sheet 7 (Chapter 10) 1. Which error detection

### An Introduction to Galois Fields and Reed-Solomon Coding

An Introduction to Galois Fields and Reed-Solomon Coding James Westall James Martin School of Computing Clemson University Clemson, SC 29634-1906 October 4, 2010 1 Fields A field is a set of elements on

### Cyclic Codes Introduction Binary cyclic codes form a subclass of linear block codes. Easier to encode and decode

Cyclic Codes Introduction Binary cyclic codes form a subclass of linear block codes. Easier to encode and decode Definition A n, k linear block code C is called a cyclic code if. The sum of any two codewords

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

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

### Introduction to Computer Networks. Codes - Notations. Error Detecting & Correcting Codes. Parity. Two-Dimensional Bit Parity

Introduction to Computer Networks Error Detecting & Correcting Codes Codes - Notations K bits of data encoded into n bits of information. n-k bits of redundancy The information data is of length K The

### SOLVING POLYNOMIAL EQUATIONS

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

### CYCLIC REDUNDANCY CHECKS IN USB. Introduction. Two-minute mathematical background

CYCLIC REDUNDANCY CHECKS IN USB Introduction The USB specification calls for the use of Cyclic Redundancy Checksums (CRC) to protect all non-pid fields in token and data packets from errors during transmission.

### Sect 3.2 Synthetic Division

94 Objective 1: Sect 3.2 Synthetic Division Division Algorithm Recall that when dividing two numbers, we can check our answer by the whole number (quotient) times the divisor plus the remainder. This should

### Module 3. Data Link control. Version 2 CSE IIT, Kharagpur

Module 3 Data Link control Lesson 2 Error Detection and Correction Special Instructional Objectives: On completion of this lesson, the student will be able to: Explain the need for error detection and

### 3.2 The Factor Theorem and The Remainder Theorem

3. The Factor Theorem and The Remainder Theorem 57 3. The Factor Theorem and The Remainder Theorem Suppose we wish to find the zeros of f(x) = x 3 + 4x 5x 4. Setting f(x) = 0 results in the polynomial

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

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

### The Essentials of Computer Organization and Architecture. Linda Null and Julia Lobur Jones and Bartlett Publishers, 2003

The Essentials of Computer Organization and Architecture Linda Null and Julia Lobur Jones and Bartlett Publishers, 2003 Chapter 2 Instructor's Manual Chapter Objectives Chapter 2, Data Representation,

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### Introduction to Finite Fields (cont.)

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

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

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

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

### Unit 2: Number Systems, Codes and Logic Functions

Unit 2: Number Systems, Codes and Logic Functions Introduction A digital computer manipulates discrete elements of data and that these elements are represented in the binary forms. Operands used for calculations

### MATH-0910 Review Concepts (Haugen)

Unit 1 Whole Numbers and Fractions MATH-0910 Review Concepts (Haugen) Exam 1 Sections 1.5, 1.6, 1.7, 1.8, 2.1, 2.2, 2.3, 2.4, and 2.5 Dividing Whole Numbers Equivalent ways of expressing division: a b,

### Dividing Polynomials

4.3 Dividing Polynomials Essential Question Essential Question How can you use the factors of a cubic polynomial to solve a division problem involving the polynomial? Dividing Polynomials Work with a partner.

### Example: Systematic Encoding (1) Systematic Cyclic Codes. Systematic Encoding. Example: Systematic Encoding (2)

S-72.3410 Cyclic Codes 1 S-72.3410 Cyclic Codes 3 Example: Systematic Encoding (1) Systematic Cyclic Codes Polynomial multiplication encoding for cyclic linear codes is easy. Unfortunately, the codes obtained

### Application. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.

Polynomial and Rational Functions Outline 3-1 Polynomial Functions 3-2 Finding Rational Zeros of Polynomials 3-3 Approximating Real Zeros of Polynomials 3-4 Rational Functions Chapter 3 Group Activity:

### minimal polyonomial Example

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

### A.4 Polynomial Division; Synthetic Division

SECTION A.4 Polynomial Division; Synthetic Division 977 A.4 Polynomial Division; Synthetic Division OBJECTIVES 1 Divide Polynomials Using Long Division 2 Divide Polynomials Using Synthetic Division 1 Divide

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

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

### Operations on Decimals

Operations on Decimals Addition and subtraction of decimals To add decimals, write the numbers so that the decimal points are on a vertical line. Add as you would with whole numbers. Then write the decimal

### Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

### Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

### Chapter 3: Elementary Number Theory and Methods of Proof. January 31, 2010

Chapter 3: Elementary Number Theory and Methods of Proof January 31, 2010 3.4 - Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem Quotient-Remainder Theorem Given

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

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

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

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

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

### 7. Some irreducible polynomials

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

### CHAPTER 2 Data Representation in Computer Systems

CHAPTER 2 Data Representation in Computer Systems 2.1 Introduction 47 2.2 Positional Numbering Systems 48 2.3 Converting Between Bases 48 2.3.1 Converting Unsigned Whole Numbers 49 2.3.2 Converting Fractions

### PROBLEM SET 6: POLYNOMIALS

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

### Chapter 4 Fractions and Mixed Numbers

Chapter 4 Fractions and Mixed Numbers 4.1 Introduction to Fractions and Mixed Numbers Parts of a Fraction Whole numbers are used to count whole things. To refer to a part of a whole, fractions are used.

### Recall the process used for adding decimal numbers. 1. Place the numbers to be added in vertical format, aligning the decimal points.

2 MODULE 4. DECIMALS 4a Decimal Arithmetic Adding Decimals Recall the process used for adding decimal numbers. Adding Decimals. To add decimal numbers, proceed as follows: 1. Place the numbers to be added

### Chapter 7 - Roots, Radicals, and Complex Numbers

Math 233 - Spring 2009 Chapter 7 - Roots, Radicals, and Complex Numbers 7.1 Roots and Radicals 7.1.1 Notation and Terminology In the expression x the is called the radical sign. The expression under the

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

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

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

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Name: where Nx ( ) and Dx ( ) are the numerator and

Oblique and Non-linear Asymptote Activity Name: Prior Learning Reminder: Rational Functions In the past we discussed vertical and horizontal asymptotes of the graph of a rational function of the form m

### Factoring Polynomials

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

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### Monomials with the same variables to the same powers are called like terms, If monomials are like terms only their coefficients can differ.

Chapter 7.1 Introduction to Polynomials A monomial is an expression that is a number, a variable or the product of a number and one or more variables with nonnegative exponents. Monomials that are real

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

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

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

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

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

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

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

### Digital Logic. The Binary System is a way of writing numbers using only the digits 0 and 1. This is the method used by the (digital) computer.

Digital Logic 1 Data Representations 1.1 The Binary System The Binary System is a way of writing numbers using only the digits 0 and 1. This is the method used by the (digital) computer. The system we

### AND RATIONAL FUNCTIONS. 2 Quadratic. Polynomials

UNIT 5 POLYNOMIAL In prior units of Core-Plus Mathematics, you developed understanding and skill in the use of linear, quadratic, and inverse variation functions. Those functions are members of two larger

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

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

### Polynomials Classwork

Polynomials Classwork What Is a Polynomial Function? Numerical, Analytical and Graphical Approaches Anatomy of an n th -degree polynomial function Def.: A polynomial function of degree n in the vaiable

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

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

### Digital Fundamentals

Digital Fundamentals with PLD Programming Floyd Chapter 2 29 Pearson Education Decimal Numbers The position of each digit in a weighted number system is assigned a weight based on the base or radix of

### UNIT 3: POLYNOMIALS AND ALGEBRAIC FRACTIONS. A polynomial is an algebraic expression that consists of a sum of several monomials. x n 1...

UNIT 3: POLYNOMIALS AND ALGEBRAIC FRACTIONS. Polynomials: A polynomial is an algebraic expression that consists of a sum of several monomials. Remember that a monomial is an algebraic expression as ax

### Notes 11: List Decoding Folded Reed-Solomon Codes

Introduction to Coding Theory CMU: Spring 2010 Notes 11: List Decoding Folded Reed-Solomon Codes April 2010 Lecturer: Venkatesan Guruswami Scribe: Venkatesan Guruswami At the end of the previous notes,

### Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions

Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective

1 Decimals Adding and Subtracting Decimals are a group of digits, which express numbers or measurements in units, tens, and multiples of 10. The digits for units and multiples of 10 are followed by a decimal

### Lecture 9 - Message Authentication Codes

Lecture 9 - Message Authentication Codes Boaz Barak March 1, 2010 Reading: Boneh-Shoup chapter 6, Sections 9.1 9.3. Data integrity Until now we ve only been interested in protecting secrecy of data. However,

### Finite Fields and Error-Correcting Codes

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

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

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

### CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

### 3.6. The factor theorem

3.6. The factor theorem Example 1. At the right we have drawn the graph of the polynomial y = x 4 9x 3 + 8x 36x + 16. Your problem is to write the polynomial in factored form. Does the geometry of the

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

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

### 2.4 Real Zeros of Polynomial Functions

SECTION 2.4 Real Zeros of Polynomial Functions 197 What you ll learn about Long Division and the Division Algorithm Remainder and Factor Theorems Synthetic Division Rational Zeros Theorem Upper and Lower

### Integrals of Rational Functions

Integrals of Rational Functions Scott R. Fulton Overview A rational function has the form where p and q are polynomials. For example, r(x) = p(x) q(x) f(x) = x2 3 x 4 + 3, g(t) = t6 + 4t 2 3, 7t 5 + 3t

### Systems I: Computer Organization and Architecture

Systems I: Computer Organization and Architecture Lecture 2: Number Systems and Arithmetic Number Systems - Base The number system that we use is base : 734 = + 7 + 3 + 4 = x + 7x + 3x + 4x = x 3 + 7x

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

### 3.6 The Real Zeros of a Polynomial Function

SECTION 3.6 The Real Zeros of a Polynomial Function 219 3.6 The Real Zeros of a Polynomial Function PREPARING FOR THIS SECTION Before getting started, review the following: Classification of Numbers (Appendix,

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

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

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

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

### Introduction Number Systems and Conversion

UNIT 1 Introduction Number Systems and Conversion Objectives 1. Introduction The first part of this unit introduces the material to be studied later. In addition to getting an overview of the material

### Representation of Data

Representation of Data In contrast with higher-level programming languages, C does not provide strong abstractions for representing data. Indeed, while languages like Racket has a rich notion of data type

### Logic Design. Dr. Yosry A. Azzam

Logic Design Dr. Yosry A. Azzam Binary systems Chapter 1 Agenda Binary Systems : Binary Numbers, Binary Codes, Binary Logic ASCII Code (American Standard Code for Information Interchange) Boolean Algebra

MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic

### 3. Power of a Product: Separate letters, distribute to the exponents and the bases

Chapter 5 : Polynomials and Polynomial Functions 5.1 Properties of Exponents Rules: 1. Product of Powers: Add the exponents, base stays the same 2. Power of Power: Multiply exponents, bases stay the same

Data Link Layer Overview Date link layer deals with two basic issues: Part I How data frames can be reliably transmitted, and Part II How a shared communication medium can be accessed In many networks,

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

Intro to Rings, Fields, Polynomials: Hardware Modeling by Modulo Arithmetic Priyank Kalla Associate Professor Electrical and Computer Engineering, University of Utah kalla@ece.utah.edu http://www.ece.utah.edu/~kalla

### A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25

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

### 6.1 The Greatest Common Factor; Factoring by Grouping

386 CHAPTER 6 Factoring and Applications 6.1 The Greatest Common Factor; Factoring by Grouping OBJECTIVES 1 Find the greatest common factor of a list of terms. 2 Factor out the greatest common factor.

### Distributed Storage Networks and Computer Forensics

Distributed Storage Networks 5 Raid-6 Encoding Technical Faculty Winter Semester 2011/12 RAID Redundant Array of Independent Disks Patterson, Gibson, Katz, A Case for Redundant Array of Inexpensive Disks,

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

2 Rings and fields A.M. Cohen, H. Cuypers, H. Sterk A.M. Cohen, H. Cuypers, H. Sterk 2 September 25, 2006 1 / 20 For p a prime number and f an irreducible polynomial of degree n in (Z/pZ)[X ], the quotient

### Algorithms and Methods for Distributed Storage Networks 5 Raid-6 Encoding Christian Schindelhauer

Algorithms and Methods for Distributed Storage Networks 5 Raid-6 Encoding Institut für Informatik Wintersemester 2007/08 RAID Redundant Array of Independent Disks Patterson, Gibson, Katz, A Case for Redundant

### 1 Review of Newton Polynomials

cs: introduction to numerical analysis 0/0/0 Lecture 8: Polynomial Interpolation: Using Newton Polynomials and Error Analysis Instructor: Professor Amos Ron Scribes: Giordano Fusco, Mark Cowlishaw, Nathanael

### Prime Numbers and Irreducible Polynomials

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

### CHAPTER 5: MODULAR ARITHMETIC

CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called

### Complex Numbers and the Complex Exponential

Complex Numbers and the Complex Exponential Frank R. Kschischang The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto September 5, 2005 Numbers and Equations

### Polynomials. Key Terms. quadratic equation parabola conjugates trinomial. polynomial coefficient degree monomial binomial GCF

Polynomials 5 5.1 Addition and Subtraction of Polynomials and Polynomial Functions 5.2 Multiplication of Polynomials 5.3 Division of Polynomials Problem Recognition Exercises Operations on Polynomials

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

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

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