Multiplicative polynomials and Fermat's little theorem for non-primes
Fermat's Little Theorem states that xp=x(modp) for x∈N and prime p, and so identifies an integer-valued polynomial (IVP) gp(x)=(xp−x)/p. Presented here are IVP's gn for non-prime n that complete the sequence {gn|n∈N} in a natural way. Also presented are characterizations of the gn's a...
Saved in:
Main Authors: | Paul Milnes, C. Stanley-Albarda |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1997-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171297000719 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
RETRACTED: On the Nature of Some Euler’s Double Equations Equivalent to Fermat’s Last Theorem
by: Andrea Ossicini
Published: (2022-11-01) -
Solutions to some generalized Fermat-type differential-difference equations
by: Zhiyong Xu, et al.
Published: (2024-12-01) -
On Euler’s lemma
by: Juozas Juvencijus Mačys
Published: (2023-09-01) -
On a functional equation related to a generalization of Flett's mean value theorem
by: T. Riedel, et al.
Published: (2000-01-01) -
Sign changes of the partial sums of a random multiplicative function II
by: Aymone, Marco
Published: (2024-10-01)