Splitting of integer polynomials over fields of prime order

The abstract, sentence by sentence

arXiv listing abstract v3. Results and the main claim are underlined; show every role.

It is well known that a polynomial $\phi(X)\in \mathbb{Z}[X]$ of given degree $d$ factors into at most $d$ factors in $\mathbb{F}_p$ for any prime $p$. We prove in this paper the existence of infinitely many primes $q$ so that the given polynomial $\phi$(X) splits into exactly $d$ linear factors in $\mathbb{F}_q$ by using only elementary results in field theory and some elementary number theory by proving that $\phi$ splits in $\mathbb{F}_q$ iff $P$ has a root in $\mathbb{F}_q$ for all sufficiently large primes $q$, where $P\in \mathbb{Z}[X]$ is any polynomial such that $P$ has a root $\beta \in \mathbb{C}$ for which $\mathbb{Q}(\beta)$ is the splitting field of $\phi$ over $\mathbb{Q}$. Furthermore, we prove that any such $P$ splits in $\mathbb{F}_r$ iff it has a root in $\mathbb{F}_r$, for all sufficiently large primes $r$. Existence of infinitely many such $P$ for any given $\phi$ is also proven.

background contribution method result interpretation main claim

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON