Prime values of polynomials and irreducibility testing
From MaRDI portal
Recommendations
Cites work
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- A note on the least prime in an arithmetic progression
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 3221530 (Why is no real title available?)
- Irreducibility Testing and Factorization of Polynomials
- Note on Irreducibility Testing
- On distinguishing prime numbers from composite numbers
Cited in
(13)- On the Sprindžuk-Weissauer approach to universal Hilbert subsets
- Finding irreducible and primitive polynomials
- ABOUT THE PERIOD OF BELL NUMBERS MODULO A PRIME
- The Irreducibility of Polynomials That Have One Large Coefficient and Take a Prime Value
- Polynomials with no Small Prime Values
- Prime values of irreducible polynomials
- Prime Numbers and Irreducible Polynomials
- Prime values of reducible polynomials, II
- The distance to square-free polynomials
- A divisor problem for polynomials
- A NOTE ON GIRSTMAIR’S IRREDUCIBILITY CRITERION
- scientific article; zbMATH DE number 3221530 (Why is no real title available?)
- Polynomial irreducibility via shifts
This page was built for publication: Prime values of polynomials and irreducibility testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3331290)