This Demonstration looks at the factorization of polynomials over the integers, the Gaussian integers, and the finite fields ... , where ... is prime. Irreducible polynomials are used to generate new fields using the ring of cosets formed by the ideal generated by the irreducible polynomial. Polynomials of degree two or three are irreducible if and only if they have no linear factors and hence no roots. Polynomials of degree four are thus the first interesting case. If there is a prime ... such that the polynomial ... is irreducible in the finite field ... , then ... is irreducible over the integers. However, there are irreducible polynomials over the integers that factor over all primes. The Gaussian integers ... are an alternative number system used to check for factorization.


    Education Levels:


      EUN,LOM,LRE4,work-cmr-id:397819,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/FactoringPolynomialsOverVariousRings/,ilox,learning resource exchange,LRE metadata application profile,LRE


      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0


      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467