On the square-free and square-full solutions of polynomial congruences. (English) Zbl 1499.11012
Summary: We study the distribution of the square-free and square-full roots (if they exist) of the congruence \[x^d\equiv a \pmod q\] with \(\gcd(a,q)=1\). Moreover, we obtain the smallest solution of these roots.
MSC:
| 11A07 | Congruences; primitive roots; residue systems |
| 11L40 | Estimates on character sums |
| 11N25 | Distribution of integers with specified multiplicative constraints |
