Prime Numbers and Irreducible Polynomials

DOI10.2307/2695645zbMath1053.11020OpenAlexW4246242015MaRDI QIDQ4417734

M. Ram Murty

Publication date: 29 July 2003

Full work available at URL: https://doi.org/10.2307/2695645

zbMATH Keywords

arithmetical properties of values of integer polynomialsirreducibility criteria for integer polynomials

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials over finite fields (11T06) Primes (11A41)

Related Items (max. 100)

49598666989151226098104244512918 ⋮ The discrete Pompeiu problem on the plane ⋮ Unnamed Item ⋮ Zero-free angular sectors and lens-shaped regions for polynomials, with applications to irreducibility ⋮ Irreducible multivariate polynomials obtained from polynomials in fewer variables. II ⋮ A NOTE ON GIRSTMAIR’S IRREDUCIBILITY CRITERION ⋮ On the factors of a polynomial ⋮ Finite field arithmetic in large characteristic for classical and post-quantum cryptography ⋮ A generalization of Eisenstein-Schönemann's irreducibility criterion ⋮ The growth function of Coxeter dominoes and 2-Salem numbers. ⋮ Irreducible multivariate polynomials obtained from polynomials in fewer variables ⋮ Note on graphs with irreducible characteristic polynomials ⋮ A simple generalization of the Schönemann-Eisenstein irreducibility criterion ⋮ An irreducibility test for polynomials whose coefficients are algebraic integers ⋮ Prime and coprime values of polynomials ⋮ On the irreducibility of polynomials associated with the complete residue systems in any imaginary quadratic fields ⋮ On the irreducible factors of a polynomial ⋮ A Useful Irreducibility Result for Integer Polynomials ⋮ Further irreducibility criteria for polynomials with non-negative coefficients ⋮ Unnamed Item ⋮ Apollonius circles and irreducibility criteria for polynomials ⋮ A new class of irreducible polynomials

This page was built for publication: Prime Numbers and Irreducible Polynomials