Ask
your own question, for FREE!
Mathematics
9 Online
Let K be one of Q, R, C (or any field). Prove that a polynomial f(x) in K[x] of degree 3 is reducible if and only if f(x) has a root in K. I need help on the backward proof. I mean "If f has a root, then f is reducible". Please
Still Need Help?
Join the QuestionCove community and study together with friends!
I got the forward one. "if f is reducible, f has a root."
Is it like, if f has a root, then it can be expressed as a product of two factors ?
Yes, I think so
not just 2, can be 3
Still Need Help?
Join the QuestionCove community and study together with friends!
i wont be useful here
Thanks anyway. It's better than no one come. :)
hope somebody assists sooner, good luck! @SithsAndGiggles
@kirbykirby
oh, nvm, I got it. hihihi If \(\alpha \) is a root of f then \((x-\alpha) |f(x)\) ) or f(x) = \((x-\alpha) *q(x) That shows f(x) is reducible
Can't find your answer?
Make a FREE account and ask your own questions, OR help others and earn volunteer hours!
Join our real-time social learning platform and learn together with your friends!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
VERNEISH:
Two objects are moving along separate linear paths where each path is described by position, d, and time, t.
Maci:
what are the best stock apps for people who want to start investing?
Twaylor:
genuienly how do i get better self control i keep watcing youtube and theres this
IzzyCookie:
|dw:1792074056138:dw| Uhm, I don't know where to ask this, but I'm in college welding at my community college, and I need help learning vertical welding for
thehearken:
not sure if this is considered spam, im sorry if it is, but does anyone have tips
18 hours ago
1 Reply
0 Medals
5 days ago
3 Replies
2 Medals
1 week ago
3 Replies
0 Medals
3 days ago
9 Replies
1 Medal
1 week ago
2 Replies
1 Medal