Review Note
Last Update: 11/26/2024 09:59 PM
Current Deck: ETH CS::Discrete Math
Published
Fields:
Text
A polynomial a(x) of degree 2 or 3 over a field F is irreducible if and only if {{c1::it has no root.}}
Back Extra
Reminder: A factor of degree of 1 is a root, because that means that a(x) = q(x) * (x + i) where i is some integer. Then, the function a(x) obviously has a root at a(-i).
Reference
Suggested Changes:
Deck Changes (Suggestion to move the Note to the following Deck):
Field Changes:
Tag Changes: