A Polynomial with a Root Mod p for Every p has a Real Root
In this interesting article, it is proved that if \(f\in \mathbb Q[x]\) is a polynomial with distinct complex roots such that \(f\) has at least \(k\) roots modulo \(p\) for every large prime \(p,\) then \(f\) has at least \(k\) real roots. As an application, it is shown that there is no finite set of positive definite binary quadratic forms such that for every large prime \(p,\) at least one of the forms has a non trivial solution to \(g(x, y)\equiv 0\bmod p.\) It is worth mentioning here that examples have been constructed efficaciously to demonstrate how to use Chebotarev's density theorem to study roots of polynomials modulo \(p,\) leading to the proof.
- Algebra with Galois theory. Notes by Albert A. Blank
- Die Bestimmung der Dichtigkeit einer Menge von Primzahlen, welche zu einer gegebenen Substitutionsklasse gehören.
- scientific article; zbMATH DE number 3563269 (Why is no real title available?)
- scientific article; zbMATH DE number 6164023 (Why is no real title available?)
- scientific article; zbMATH DE number 3342087 (Why is no real title available?)
- On a theorem of Jordan
- Polynomials \((x^{3} - n)(x^{2} + 3)\) solvable modulo any integer
- Polynomials consisting of quadratic factors with roots modulo any positive integer
- Polynomials over ring of integers of global fields that have roots modulo every finite indexed subgroup
- Polynomials with roots in ℚ_{𝕡} for all 𝕡
- Polynomials with roots mod \(p\) for all primes \(p\)
- Polynomials with roots modulo every integer
This page was built for publication: A Polynomial with a Root Mod p for Every p has a Real Root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6900997)
