Polynomials with roots mod \(p\) for all primes \(p\) (Q2711636)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomials with roots mod \(p\) for all primes \(p\) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomials with roots mod \(p\) for all primes \(p\) |
scientific article |
Statements
24 April 2001
0 references
roots modulo primes
0 references
coverable group
0 references
symmetric group
0 references
integer polynomial
0 references
0.98416656
0 references
0.95757115
0 references
0.9345151
0 references
0.92900276
0 references
0.9221151
0 references
0.9151717
0 references
0.9094016
0 references
0.90553147
0 references
0.9015831
0 references
0.89696705
0 references
Polynomials with roots mod \(p\) for all primes \(p\) (English)
0 references
A finite group \(G\) is said to be coverable, if there exist two proper subgroups such that \(G\) is the set-theoretic union of the \(G\)-conjugates of them. The authors prove that the symmetric group \(S_n\) is coverable iff \(3\leq n\leq 6\). As a consequence the following result holds: Let \(f(X)\) be an integer polynomial, which has a root modulo \(p\) for all primes \(p\). If \(f\) is a product of \(\ell\) irreducible factors, none of which is linear, then \(\ell\geq 2\). If \(\ell=2\) and the Galois group of \(f\) over the rationals is isomorphic to \(S_n\) for some \(n\), then \(3\leq n\leq 6\).
0 references