Chapter 6: Problem 17
Show that the minimal polynomial for \(\sqrt[3]{2}\) is \(x^{3}-2\)
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 6: Problem 17
Show that the minimal polynomial for \(\sqrt[3]{2}\) is \(x^{3}-2\)
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(\alpha\) be an algebraic number. Show that there is an integer \(n\) such that \(n \alpha\) is an algebraic integer.
Show that \(\left|\sum_{i=m}^{n}(t / p)\right|<\sqrt{p} \log p .\) The inequality holds for the sum over any range. This remarkable inequality is associated with the names of Polya and Vinogradov. [Hint: Use the relation \((t / p) g=g_{1}\) and sum. The inequality \(\sin x \geq(2 / \pi) x\) for any acute angle \(x\) will be useful.]
If \(\alpha\) and \(\beta\) are algebraic integers, prove that any solution to \(x^{2}+\alpha x+\beta=0\) is an algebraic integer. Generalize this result.
Let \(x^{2}+m x+n \in \mathbb{Z}[x]\) be irreducible and \(\alpha\) be a root. Show that \(\mathbb{O}[\alpha]=\) \(\\{r+s x \mid r, s \in Q\\}\) is a ring (in fact, it is a field). Let \(m^{2}-4 n=D_{0}^{2} D\), where \(D\) is square-free. Show that \(Q[\alpha]=Q[\sqrt{D}]\).
A polynomial \(f(x) \in \mathbb{Z}[x]\) is said to be primitive if the greatest common divisor of its coefficients is 1 . Prove that the product of primitive polynomials is again primitive. [fint: Let \(f(x)=a_{0} x^{n}+a_{1} x^{n-1}+\cdots+a_{n}\) and \(g(x)=b_{0} x^{m}+b_{1} x^{n-1}+\cdots+b_{m}\) be primitive. If \(p\) is a prime, let \(a_{i}\) and \(b_{j}\) be the coefficients with the smallest subscripts such that \(p X a_{i}\) and \(\left.p\right\\} b_{j}\). Show that the coefficient of \(x^{i+j}\) in \(f(x) g(x)\) is not divisible by \(p\).] This is one of the many results known as Gauss" lemma.
What do you think about this solution?
We value your feedback to improve our textbook solutions.