Question #271308

Show that x3+ x2+x+1 is reducible over Q. Does this fact contradict the corollary to Theorem 17.4?


1
Expert's answer
2021-11-26T09:20:34-0500

x3+x2+x+1=(x2+1)(x+1)x^3+ x^2+x+1=(x^2+1)(x+1)

since it splits into factors, then it is reducible over Q


corollary:

for any prime p:

P(x)=xp1x1=xp1+xp2+...+x+1P(x)=\frac{x^p-1}{x-1}=x^{p-1}+x^{p-2}+...+x+1

is irreducible over Q.


in our case: xp1=x3    p=4x^{p-1}=x^3\implies p=4 is not prime

so, our result does not contradict the corollary


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS