English

Polynomials which are locally reducible

Number Theory 2007-05-23 v1

Abstract

Let KK be a global field and n>1n > 1 an integer. We show nn is composite if and only if there is an irreducible polynomial f(x)K[x]f(x) \in K[x] of degree nn which is reducible qq-adically for all the primes qq of KK.

Keywords

Cite

@article{arxiv.math/0404069,
  title  = {Polynomials which are locally reducible},
  author = {R. Guralnick and M. Schacher and J. Sonn},
  journal= {arXiv preprint arXiv:math/0404069},
  year   = {2007}
}