๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Towers of Powers Modulo m

โœ Scribed by Robert J. MacG. Dawson

Book ID
121236481
Publisher
Mathematical Association of America
Year
1994
Tongue
English
Weight
638 KB
Volume
25
Category
Article
ISSN
0746-8342

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

On Euler numbers modulo powers of two
On Euler numbers modulo powers of two
โœ Zhi-Wei Sun ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 132 KB

To determine Euler numbers modulo powers of two seems to be a difficult task. In this paper we achieve this and apply the explicit congruence to give a new proof of a classical result due to M.A. Stern.

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