𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Detecting prime numbers via roots of polynomials

✍ Scribed by Dobbs, David E.

Book ID
118055960
Publisher
Taylor and Francis Group
Year
2012
Tongue
English
Weight
131 KB
Volume
43
Category
Article
ISSN
0020-739X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Roots of Polynomials Modulo Prime Powers
Roots of Polynomials Modulo Prime Powers
✍ Bruce Dearden; Jerry Metzger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 202 KB

In general , not every set of values modulo n will be the set of roots modulo n of some polynomial . In this note , some characteristics of those sets which are root sets modulo a prime power are developed , and these characteristics are used to determine the number of dif ferent sets of integers wh

Root Sets of Polynomials Modulo Prime Po
Root Sets of Polynomials Modulo Prime Powers
✍ 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