Polynomials which are locally reducible
Abstract
Let K be a global field and n > 1 an integer. We show n is composite if and only if there is an irreducible polynomial f(x) ∈ K[x] of degree n which is reducible q-adically for all the primes q of K.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.