2
$\begingroup$

Find the number of irreducible monic polynomials of degree $2$ over a field with five elements.

Please anyone help me.

$\endgroup$

closed as off-topic by user228113, Morgan Rodgers, Kushal Bhuyan, JMP, user1551 Jul 17 '16 at 15:41

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Community, Morgan Rodgers, Kushal Bhuyan, JMP, user1551
If this question can be reworded to fit the rules in the help center, please edit the question.

2
$\begingroup$

Note: As this result is given in this answer.

The number of irreducible monic polynomials of degree $n$ (only when $n$ is prime) over the field of characteristic $p$ is $\frac{p^n-p}{n}$. In your case $p=5$ and $n=2$

Alternately Gauss gave the following result,

The number of irreducible monic polynomials of degree $n$ over $F_q$ is given by $$N_q(n)=\frac{1}{n}\sum_{d|n}\mu(d)q^{n/d}$$ where $\mu$ is the Mobius function.

For a proof see this.

$\endgroup$
  • 5
    $\begingroup$ I think this answer is not really useful for anybody that might actually ask the question. In fact it may mislead somebody into believing the significantly more complicated result is needed. (I will not add a second downvote though.) $\endgroup$ – quid Jul 17 '16 at 12:17
6
$\begingroup$

Hints.

  1. Count the number of monic quadratic polynomials, irreducible or not.

  2. Count the number of products $(x-a)(x-b)$, remembering that $a$ might equal $b$.

  3. Subtract.

$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.