A NOTE ON GIRSTMAIR’S IRREDUCIBILITY CRITERION
From MaRDI portal
Publication:5097518
Recommendations
- A useful irreducibility result for integer polynomials
- Prime values of irreducible polynomials
- Prime-valued polynomials
- Polynomials with no Small Prime Values
- Prime Numbers and Irreducible Polynomials
- The Irreducibility of Polynomials That Have One Large Coefficient and Take a Prime Value
- On an Irreducibility Criterion of M. Ram Murty
- Polynomials in base \(x\) and the prime-irreducible affinity
- Über Kriterien für irreduzible und für primitive Gleichungen und über die Aufstellung affektfreier Gleichungen.
- Prime values of polynomials and irreducibility testing
Cites work
Cited in
(6)- Prime values of polynomials and irreducibility testing
- Prime values of irreducible polynomials
- A useful irreducibility result for integer polynomials
- On an Irreducibility Criterion of M. Ram Murty
- Further generalizations of Girstmair's irreducibility criterion
- Some factorization results for bivariate polynomials
This page was built for publication: A NOTE ON GIRSTMAIR’S IRREDUCIBILITY CRITERION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097518)