Euler Type Generalization of Wilson's Theorem
Mehdi Hassani, Mahmoud Momeni-Pour
math.NTarXiv:math/0605705
Abstract
In this short note, we introduce an Euler analogue of Wilson's theorem; a1a2... aϕ(n) (-1)ϕ(n)+1~( mod~n) say, where gcd(ai,n)=1.
Create a lesson
Related papers
Value distribution of multiplicative functions along linear fractional sequences
Sun-Kai Leung
Delta theory of Anderson Modules II: Hodge-Pink structure
Sudip Pandit, Arnab Saha
Integers divisible by a shifted prime in a given interval
Rebecca Abi Abdallah, Valeriya Kovaleva, Jeremy Schlitt et al.
On Piatetski-Shapiro primes from almost primes
Yuhua Zhao, Jinjiang Li, Linji Long et al.
On Consecutive Non-primitive Elements over Finite Fields
Bidushi Sharma, Dhiren Kumar Basnet
Birch's theorem over function fields with quadratically many variables
Matthew Hase-Liu