Root Sets of Polynomials Modulo Prime Po
โ
Davesh Maulik
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 194 KB
A subset R of the integers modulo n is defined to be a root set if it is the set of roots of some polynomial. Using the Chinese Remainder Theorem, the question of finding and counting root sets mod n is reduced to finding root sets modulo a prime power. In this paper, we provide a recursive construc