Difference between revisions of "Math 361, Spring 2022, Assignment 14"
From cartan.math.umb.edu
(Created page with "__NOTOC__ ==Describe the following procedures:== # Sieve of Eratosthenes (for integers). # Sieve of Eratosthenes (for polynomials with coefficients in a finite field). # Pro...") |
(→Solutions:) |
||
Line 21: | Line 21: | ||
==Solutions:== |
==Solutions:== |
||
==Notes:== |
|||
https://drive.google.com/file/d/1m34inTUsMS_QGoX0qSQAuv2HvFz9jSE1/view?usp=sharing |
|||
==Problems:== |
|||
https://drive.google.com/file/d/188n4cWhYW3Lx0R0nvxGL9r1920J9XWJM/view?usp=sharing |
Latest revision as of 02:18, 13 May 2022
Describe the following procedures:[edit]
- Sieve of Eratosthenes (for integers).
- Sieve of Eratosthenes (for polynomials with coefficients in a finite field).
- Procedure to factor polynomials over $\mathbb{C}$.
- Procedure to factor polynomials over $\mathbb{R}$.
Solve the following problems:[edit]
- Skim the introduction to the Wikipedia article on polynomial factorization so you will know where to find search terms when you one day need to know how to factor high-degree polynomials.
- Working over $\mathbb{Z}_2$, factor the polynomial $x^3+1$ into irreducibles. (Hint: first look for roots and pull out the corresponding linear factors by long division.)
- Repeat the previous exercise for $x^4+1$ and for $x^5+1$. (Hint: the hardest part will be deciding whether $x^4+x^3+x^2+x+1$ can be factored as the product of two quadratics. But for this, you can make a list of all irreducible quadratics and test for divisibility by each in turn.)
- Working over $\mathbb{Z}_3$, find all irreducible polynomials of degree two. (Hint: you do not need the Sieve; you just need to find quadratics that have no roots.)
- Construct a field with nine elements.
Questions:[edit]
Solutions:[edit]
Notes:[edit]
https://drive.google.com/file/d/1m34inTUsMS_QGoX0qSQAuv2HvFz9jSE1/view?usp=sharing
Problems:[edit]
https://drive.google.com/file/d/188n4cWhYW3Lx0R0nvxGL9r1920J9XWJM/view?usp=sharing