Answers are grounded in this paper and cite their sources.
Given an odd prime q, a natural number l and non-zero q-free integers a₁, a₂, …, aₗ, none of which are equal to $1$ or $-1$, we give necessary and sufficient conditions for the polynomial ∏ⱼ₌₁ˡ (xq - aⱼ) to have roots modulo every positive integer. Consequently: (i) if l ≤ q and none of a₁, a₂, …, aₗ is a perfect qᵗʰ power, then the polynomial ∏ⱼ₌₁ˡ (xq - aⱼ) fails to have roots modulo some positive integer; $(ii)$ For every l, and every (cⱼ)ⱼ₌₁ˡ∈(Fq\0\)ˡ, the polynomial ∏ⱼ₌₁ˡ (xq - aⱼ) has roots modulo every positive integer if and only if ∏ⱼ₌₁ˡ (xq - radq(aⱼ^cⱼ))) has roots modulo every positive integer. Here radq(aⱼ) denotes the q-free part of the integer aⱼ.
No takes yet. Share an insight, caveat, or question.
Bhawesh Mishra (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: