- #1
burritoloco
- 83
- 0
Homework Statement
Prove that for n>=2, n not prime, the following polynomial is reducible
[tex]
f_n(x) = x^{n-1} + x^{n-2} + ... + x + 1
[/tex]
Homework Equations
The Attempt at a Solution
If n is even, the polynomial has -1 as a root, so it is reducible. But when n is odd (and not prime) I'm not sure how to show it? Thanks for the help.