Consider f(x) = x³ + 2x² + 3, g(x) = x³ + 2x² + 4 in the polynomial ring F5[2]. Denote F125 = F5[x]/(f(x)) and R125 = F5[x]/(g(x)). 1. Since f(x) has degree 3, it is irreducible if and only if it has no roots. Verify this by computing the values of f on the 5 elements of F5. This shows that F125 is a field. f(0) = 3 . f(1) = 1 f(2)= 1 f(3) = 4 f(4) = 0 2. Find all the roots of g(x). Give your answer as a list of numbers separated by commas. Roots of g(x)= 2 Since there is at least one, g(z) is reducible and so R125 is not a field. 3. In F125, compute (2x² + x +1)(3x² + 2x + 2) = x^4+2x^3+4x^2+4x+2 with coefficients from F5. 4. 3. In R125, compute (2x² + x + 1)(3x² + 2x + 2) = less with coefficients from F5. 5. In F125, compute (2x² + x + 1)¬¹ ; coefficients from F5. giving your answer as polynomial of degree 2 or less giving your answer as polynomial of degree 2 or giving your answer as polynomial of degree 2 or less with

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

red box are wrong answers

Consider f(x) = x³ + 2x² +3, g(x) = x³ + 2x² +4 in the polynomial ring F5[*]. Denote F125 = F5[x]/(f(x)) and R125 = F5[x]/(g(x)).
1. Since f(x) has degree 3, it is irreducible if and only if it has no roots. Verify this by computing the values of f on the 5 elements of F5. This
shows that IF125 is a field.
f(0) = 3
f(1) = 1
. f(4) = 0
ƒ(2)
= 1
5. In F125, compute (2x² + x + 1)−¹:
coefficients from F5.
f(3) =
2. Find all the roots of g(x). Give your answer as a list of numbers separated by commas.
Roots of g(x) = 2
Since there is at least one, g(x) is reducible and so R125 is not a field.
4. 3. In R125, compute (2x² + x + 1)(3x² + 2x +2):
=
less with coefficients from IF5.
= 4
3. In F125, compute (2x² + x + 1)(3x²+2x + 2) = x^4+2x^3+4x^2+4x+2
with coefficients from F5.
giving your answer as polynomial of degree 2 or less
giving your answer as polynomial of degree 2 or
giving your answer as polynomial of degree 2 or less with
Transcribed Image Text:Consider f(x) = x³ + 2x² +3, g(x) = x³ + 2x² +4 in the polynomial ring F5[*]. Denote F125 = F5[x]/(f(x)) and R125 = F5[x]/(g(x)). 1. Since f(x) has degree 3, it is irreducible if and only if it has no roots. Verify this by computing the values of f on the 5 elements of F5. This shows that IF125 is a field. f(0) = 3 f(1) = 1 . f(4) = 0 ƒ(2) = 1 5. In F125, compute (2x² + x + 1)−¹: coefficients from F5. f(3) = 2. Find all the roots of g(x). Give your answer as a list of numbers separated by commas. Roots of g(x) = 2 Since there is at least one, g(x) is reducible and so R125 is not a field. 4. 3. In R125, compute (2x² + x + 1)(3x² + 2x +2): = less with coefficients from IF5. = 4 3. In F125, compute (2x² + x + 1)(3x²+2x + 2) = x^4+2x^3+4x^2+4x+2 with coefficients from F5. giving your answer as polynomial of degree 2 or less giving your answer as polynomial of degree 2 or giving your answer as polynomial of degree 2 or less with
Expert Solution
steps

Step by step

Solved in 7 steps with 72 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,