Exercise 13.4.7

Let f = x 5 + 20 x + 16 [ x ] be the polynomial of Example 13.4.6. Show that f is irreducible over , and compute its discriminant and irreducible factorization modulo 7 .

Proof.

The given polynomial f is irreducible, since f ( x 1 ) = ( x 1 ) 5 + 20 ( x 1 ) + 16 = x 5 5 x 4 + 10 x 3 10 x 2 + 25 x 5 is irreducible by Schönemann-Eisenstein criterion with p = 5 . The discriminant may be calculated by the formula (cf. Ex.13.2.15):

Δ ( f ) = 256 a 5 + 3125 b 4 , where a = 20 , b = 16 . Then Δ ( f ) = 2 8 2 0 5 + 5 5 1 6 4 = 2 18 5 5 + 5 5 2 16 = 2 16 5 5 ( 4 + 1 ) = 2 16 5 6 . Reducing the polynomial modulo 7 gives: f ¯ ( x ) = x 5 + 6 x + 2 . We have f ¯ ( 4 ) = f ¯ ( 5 ) = 0 and f ¯ ( i ) 0 for i { 0 , 1 , 2 , 3 , 6 } . Division of f ¯ by ( x 4 ) = ( x + 3 ) and ( x 5 ) = ( x + 2 ) gives: f ¯ = ( x + 2 ) ( x + 3 ) ( x 3 + 2 x 2 + 5 x + 5 ) in 𝔽 7 .

Answers

User profile picture
2022-07-19 00:00
Comments