Problem 4. Consider f(x) = x5+ x4 + 2x3 + 3x2 + 4x + 5 ∈ Q[x] and our goal is to determine if f is irreducible over Q. We compute f(1), f(−1), f(5), f(−5) directly and see that none of them is zero. By the Rational Roots Theorem, f has no root in Q. So if f is reducible over Q, it cannot be factored into the product of a linear polynomial and a quartic polynomial (i.e. polynomial of degree 4). By the useful consequence of Gauss’ Lemma (i.e. Theorem 6 in Chapter 4.2), if f is reducible, it has factorization in Z[x]. So the only possibility is: f(x) = (x2 + ax + b)(x3 + cx2 + dx + e) with a, b, c, d, e ∈ Z. Comparing the coefficients of x 4 , x 3 ,... of both sides, we have the system of equations: (∗) c + a = 1, d + ac + b = 2, e + ad + bc = 3, ae + bd = 4, be = 5.
Now the last equation be = 5 yields 4 cases: Case 1: b = 5 and e = 1. The remaining equations become:
(1) c + a = 1 .(2) d + ac + 5 = 2 (3) 1 + ad + 5c = 3 (4) a + 5d = 4. The first and last equation allow us to get a and c in terms of d, namely a = 4 − 5d and c = 1 − a = 1 − (4 − 5d) = −3 + 5d. Then we “plug in” the second equation to get: d + (4 − 5d)(−3 + 5d) + 5 = 2. Simplify this and we get the quadratic equation: 25x2 − 36x + 9 = 0. We get 2 roots (18 ± 3 √ 11)/25 neither of which is an integer (actually neither is a rational number since √ 11 ( Q). Note that even if we had an integer solution here, we would still need to find a and c, make sure they are integers, then check that the third equation holds (we have not touched the third equation before). Anyway, this case does not yield any integer solutions a, b, c, d, e of the original system (∗). Case 2: b = 1 and e = 5. We don’t have any integer solutions in this case either. Case 3: b = −1 and e = −5. No solution either. Here is the question for you. Case 4: b = −5 and e = −1. Provide all the details as in Case 1, check if you can find any integer solutions of the system (∗), then conclude whether f is irreducible over Q or not.
Problem 4. Consider f(x) = x5+ x4 + 2x3 + 3x2 + 4x + 5 ∈ Q[x] and our goal is to determine if f i...
4. (a) Prove that if f(x) E Q[x] is irreducible in R[x], then it is irreducible in Q[x]. Is the converse of this statement true? Explain why or why not. (b) Prove that if f(x) E Q[x] is reducible in Q[x], then it is reducible in R[x]. Is the converse of this statement true? Explain why or why not.
Using the complex-n-th roots theorem: 5. (a) Use Theorem 10.5.1: Complex n-th Roots Theorem (CNRT) to com- pute all the 4-th roots of -1/4. (b) Factor the polynomial 4x4 + 1 in C[x]. (c) Factor the polynomial 4x4 +1 in R[x]. (d) Use Rational Roots Theorem to prove that the polynomial 4x4 + 1 has no rational roots. Deduce the factorization of 4x4 + 1 in Q[x].
2. Consider the polynomial p = x3 + x +4 € Z5 [2]. Let q = 3x +2 € Z5 [2]. (a) Is p reducible or irreducible? Prove your claim. (b) Are there any degree 2 polynomials in [g],? Explain. (c) List all degree 3 polynomials in [g]p. (d) (ungraded for thought) How many degree 4 polynomials are in (q),? Degree 5?
Consider the polynomial f(x) = x+ + 4x + 4x? a. What is the degree of this polynomial?_ b. What is the y intercept?_ c. What are the roots (zeros) of this polynomial? d. What is the end behavior of this polynomial ? e. Sketch this polynomial?
Question 39 Let f(x)= 3x2 – 2. g(x) = 4x +4. Find the value of the function. (of)(4) o tof)(4) = 6,350 OVO (4) = 6,346 Ovo(4) = 6,348 ovo(4) = 6,347 OVO (4) = 6,345 O None of the above Question 40 1 pts Use Descartes' rule of signs to find the number of possible positive, negative, and nonreal roots for the following equation 8x° +11x2 + 3x + 5 = 0 O none of these O O positive:...
Part D,E,F,G 10. Let p(x) +1. Let E be the splitting field for p(x) over Q. a. Find the resolvent cubic R(z). b. Prove that R(x) is irreducible over Q. c. Prove that (E:Q) 12 or 24. d. Prove: Gal(E/Q) A4 or S4 e. If p(x) (2+ az+ b)(a2 + cr + d), verify the calculations on page 100 which show that a2 is a root of the cubic polynomial r(x)3-4. 1. f. Prove: r(x) -4z 1 is irreducible in...
Preview Activity 14.1. In previous investigations, we defined irreducible polynomials and showed that irreducible polynomials in polynomial rings over fields play the same role as primes play in Z. In this investigation we will explore some methods to determine when a polynomial is irreducible, with a special emphasis on polynomials with coefficients in C, R, and Q. To begin, we will review the definition and a simple case. Let F be a field. (a) Give a formal definition of what...
Problem 5. Give an example of an irreducible polynomial f ∈ K[x] which has roots a, b, c in its splitting field such that the fields K(a, b) and K(a, c) are not isomorphic over K.
Include all relevant work please. 22.Using the function f(x) = 2x3 - 3x2 - 18x - 8. Use your graphing calculator to help you. a. List the potential rational zeros. [2] P 9 b. Find one rational zero of f(x) using synthetic division. b. One rational zero [3] c. Rewrite f(x) using the Division Algorithm after finding one rational zero. c. f(x) = [2] d. Find all zeros of f(x). (Do not get them by graphing on your calculator!) Show...
5. Prove the Rational Roots Theorem: Let p(x)=ataiェ+ +anz" be a polynomial with integer coefficients (that is, each aj is an integer). If t rls (oherer and s are nonzero integers and t is written in lowest terms, that is, gcd(Irl'ls!) = 1) is a non-zero Tational root orp(r), that is, if tメ0 and p(t) 0, then rao and slan. (Hint: Plug in t a t in the polynomial equation p(t) - o. Clear the fractions, then use a combination...