✦ LIBER ✦

Integer Polynomials that are Reducible Modulo all Primes

✍ Scribed by Rolf Brandl

Book ID: 121262823
Publisher: Mathematical Association of America
Year: 1986
Tongue: English
Weight: 423 KB
Volume: 93
Category: Article
ISSN: 0002-9890
DOI: 10.2307/2323681

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integer Polynomials with Roots mod p for

Integer Polynomials with Roots mod p for all Primes p

✍ Rolf Brandl 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Let f X be an integer polynomial which is a product of two irreducible factors. Assume that f X has a root mod p for all primes p. If the splitting field of f X over the rationals is a cyclic extension of the stem fields, then the Galois group of f X over the rationals is soluble and of bounded Fitt

An iterative construction of irreducible

An iterative construction of irreducible polynomials reducible modulo every prime

✍ Rafe Jones 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 265 KB

On Integers All of Whose Prime Factors a

On Integers All of Whose Prime Factors are Small

✍ Halberstam, H. 📂 Article 📅 1970 🏛 Oxford University Press 🌐 English ⚖ 110 KB

On Integers all of whose Prime Factors a

On Integers all of whose Prime Factors are Small

✍ Hazlewood, D. G. 📂 Article 📅 1973 🏛 Oxford University Press 🌐 English ⚖ 94 KB

The probability that k positive integers

The probability that k positive integers are relatively r-prime

✍ Stanley J Benkoski 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 239 KB

On the probability that k positive integ

On the probability that k positive integers are relatively prime

✍ J.E Nymann 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 191 KB