Polynomials with factors of the form $(x^q-a)$ with roots modulo every integer
Bhawesh Mishra

TL;DR
This paper characterizes when polynomials composed of factors of the form $(x^q - a)$ have roots modulo all positive integers, based on properties of the integers $a_j$ and their $q$-free parts, extending understanding of roots in modular arithmetic.
Contribution
It provides necessary and sufficient conditions for such polynomials to have roots modulo every positive integer, including new criteria involving $q$-free parts and powers, generalizing previous results.
Findings
Polynomials with factors $(x^q - a_j)$ lack roots modulo some integers if $a_j$ are not $q$-th powers.
Root existence depends on the $q$-free parts of the integers $a_j$ and their exponents.
The conditions unify and extend previous criteria for roots modulo all positive integers.
Abstract
Given an odd prime , a natural number and non-zero -free integers , none of which are equal to or , we give necessary and sufficient conditions for the polynomial to have roots modulo every positive integer. Consequently: (i) if and none of is a perfect power, then the polynomial fails to have roots modulo some positive integer; For every , and every , the polynomial has roots modulo every positive integer if and only if has roots modulo every positive integer. Here denotes the -free part of the integer .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
