Euler Type Generalization of Wilson's Theorem
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
In this short note, we introduce an Euler analogue of Wilson's theorem; $a_1a_2... a_{ϕ(n)}\equiv (-1)^{ϕ(n)+1}~({\rm mod}~n)$ say, where ${\rm gcd}(a_i,n)=1$.
a short research note with 2 pages
a short research note with 2 pages