Polynomials (x^3 - n)(x^2 + 3) solvable modulo any integer

DOI10.4169/AMER.MATH.MONTHLY.121.04.355MaRDI QIDQ2928631zbMATH OpenOpenAlexFDO

Authors Andrea M. Hyde, Paul D. Lee, Blair K. Spearman

Publication date 10 November 2014

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/amer.math.monthly.121.04.355

zbMATH Keywords

intersective polynomialpolynomial solvable modulo \(m\)

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09)

Recommendations

• Products of quadratic polynomials with roots modulo any integer
• Polynomials consisting of quadratic factors with roots modulo any positive integer
• Intersective polynomials arising from sums of powers
• Two remarks on the inverse Galois problem for intersective polynomials
• Minimally intersective polynomials with arbitrarily long factorization

Cited in

(8)

• Polynomials over ring of integers of global fields that have roots modulo every finite indexed subgroup
• Covering a semi-direct product and intersective polynomials
• Intersective polynomials arising from sums of powers
• Polynomials consisting of quadratic factors with roots modulo any positive integer
• Minimally intersective polynomials with arbitrarily long factorization
• Products of quadratic polynomials with roots modulo any integer
• scientific article; zbMATH DE number 7674559 (Why is no real title available?)
• A Polynomial with a Root Mod p for Every p has a Real Root

This page was built for publication: Polynomials \((x^{3} - n)(x^{2} + 3)\) solvable modulo any integer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928631)