Polynomials with factors of the form (xq-a) with roots modulo every integer
Abstract
Given an odd prime q, a natural number l and non-zero q-free integers a1, a2, …, al, none of which are equal to 1 or -1, we give necessary and sufficient conditions for the polynomial Πj=1l (xq - aj) to have roots modulo every positive integer. Consequently: (i) if l ≤ q and none of a1, a2, …, al is a perfect qth power, then the polynomial Πj=1l (xq - aj) fails to have roots modulo some positive integer; (ii) For every l∈N, and every (cj)j=1l∈(Fq\0\)l, the polynomial Πj=1l (xq - aj) has roots modulo every positive integer if and only if Πj=1l (xq - radq(ajcj))) has roots modulo every positive integer. Here radq(aj) denotes the q-free part of the integer aj.
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.