- #1
letmeknow
- 26
- 0
Proposition. A polynomial of degree 2 or 3 over a field F is reducible iff it has a root in F.
Tell me if I'm on the right track... I see that x^4 + 3x^2 + 2 is reducible (x^2+1)(x^2+2) but has no roots in Q.
This serves as a counterexample to the proposition if states for polynomial up to degree 4?
Tell me if I'm on the right track... I see that x^4 + 3x^2 + 2 is reducible (x^2+1)(x^2+2) but has no roots in Q.
This serves as a counterexample to the proposition if states for polynomial up to degree 4?