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.
Publication Year: 2018
Publication Date: 2018-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot