Question

Is x^4 + 1 reducible over GF(2)

(a) Yes

(b) No

(c) Can’t Say

(d) Insufficient Data

The question was asked by my school teacher while I was bunking the class.

My question is taken from Polynomial and Modular Arithmetic- IV topic in section Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security

Answer 1

Right answer is (a) Yes

For explanation: Reducible: (x + 1)^4.