NETMaths
Part CCSIR NET December 2023irreducible-over-Q-not-mod-p

Irreducible over Q not mod p

Let and be polynomials in . Which of the following statements are true?

  1. A.For all prime numbers p, f(X) mod p is irreducible in .
  2. B.There exists a prime number p such that g(X) mod p is irreducible in .
  3. C.g(X) is irreducible in .
  4. D.f(X) is irreducible in .

The answer and working come with the PYQ pack.

See pricing

68 questions are solved free — try those first.

The trap it tests

Base field or ring

The answer changes with the field or ring you are working over.

Drill statements like this

Related counterexample: Irreducible over ℤ ⇒ irreducible mod every prime

More on this topic

From Rings and FieldsPolynomial rings and irreducibility tests

ShareWhatsAppTelegram