For two indeterminates x, y, let R = 𝔽 and S = R[y]. Which of the following statements are true?
Part CCSIR NET June 2024irreducible-quotient-need-not-be-a-ufd
Irreducible quotient need not be a ufd
Related counterexample: Irreducible over ℤ ⇒ irreducible mod every prime
- Part B questionJune 2023
- irreducible over Q not mod pDecember 2023
- odd and even powers cannot cancelDecember 2024
- the cyclotomic index must be primeDecember 2024
The chapter behind this: Irreducibility tests — free to read
From Rings and Fields › Polynomial rings and irreducibility tests