sol6 - U.C. Berkeley - CS70: Discrete Mathematics and...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
U.C. Berkeley — CS70: Discrete Mathematics and Probability Problem Set 6 Due October 6, 2006 at 4:00pm Problem Set 6 Solutions 1. Polynomials with no roots A polynomial p ( x ) of degree n over a Feld F has at most n roots. But it does not need to have n roots, nor it must have roots at all. (a) Write all polynomials in GF 2 having no roots over GF 2 . (b) Write all polynomials in GF 3 having no roots over GF 3 . (c) ±ind a polynomial p ( x ) which has roots over GF 3 , but not over Z . Solution : Recall that polynomials of degree q in GF q can be rewritten as polynomials of degree q as x q = 1 for all x GF q . (a) The constant 1 polynomial is the only polynomial without roots. All non-constant polynomials have degree 1 and hence have one root. (b) These can be found by iterating through all 3 3 polynomials, but it is not necessary. ±irst, notice that all non-zero constant polynomials have no roots and that all degree 1 polynomials have roots. Then, we are left with the 2 * 3 * 3 = 18 polynomials of degree 2. Here, observe that those with 0 constant term will have 0 as a root and exclude them. Now, you have 2 * 3 * 2 = 12 polynomials to consider. Moreover, you can arrange these in pairs
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/14/2009 for the course CMPSC 360 taught by Professor Haullgren during the Fall '08 term at Pennsylvania State University, University Park.

Page1 / 2

sol6 - U.C. Berkeley - CS70: Discrete Mathematics and...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online