ps2sol

# ps2sol - Introduction to Algorithms Massachusetts Institute...

This preview shows pages 1–3. Sign up to view the full content.

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

View Full Document
2 Handout 9: Problem Set 2 Solutions Consider a polynomial in the ﬁeld Z /p : n a ( x ) = a i x i mod p (1) i =0 A root or zero of a polynomial is a value of x for which a ( x ) = 0 . The following theorem describes the number of zeros for a polynomial of degree n . Theorem 1 A polynomial a ( x ) of degree n has at most n distinct zeros. Polly the Parrot is a very smart bird that likes to play math games. Today, Polly is thinking of a polynomial a ( x ) over the ﬁeld Z /p . Though Polly will not tell you the coefﬁcients of a ( x ) , she will happily evaluate a ( x ) for any x of your choosing. She challenges you to ﬁgure out whether or not a is equivalent to zero (that is, whether x ≤ { 0 , . . . , p 1 } : a ( x ) 0 mod p ).
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 13

ps2sol - Introduction to Algorithms Massachusetts Institute...

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

View Full Document
Ask a homework question - tutors are online