Advertisement

Polynomials and Irreducibility

  • Juliusz Brzeziński
Chapter
Part of the Springer Undergraduate Mathematics Series book series (SUMS)

Abstract

In this chapter, we present facts on zeros of polynomials and discuss some basic methods to decide whether a polynomial is irreducible or reducible, including Gauss’ lemma, the reduction of polynomials modulo prime numbers ((irreducibility over finite fields), and Eisenstein’s criterion.

References

  1. [L]
    S. Lang, Algebra, Third Edition, Addison-Wesley, 1993.Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Juliusz Brzeziński
    • 1
    • 2
  1. 1.Department of Mathematical SciencesUniversity of GothenburgGöteborgSweden
  2. 2.Chalmers University of TechnologyGöteborgSweden

Personalised recommendations