Question: Problem 2. Let p be a prime number. (a) (5 pts) Let f(T) be a polynomial modulo p of degree 2 or 3. Prove

Problem 2. Let p be a prime number. (a) (5 pts) Let

Problem 2. Let p be a prime number. (a) (5 pts) Let f(T) be a polynomial modulo p of degree 2 or 3. Prove that f(T) is irreducible if and only if f(T) has no roots modulo p. Hint. Prove the contrapositive, looking at the degrees of the divisors of f(T). (b) (5 pts) Count the number of monic polynomials modulo p of degree d. (c) (5 pts) Count the number of monic irreducible polynomials modulo p of degree 2. (d) (5 pts) Count the number of monic irreducible polynomials modulo p of degree 3.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!