Euler Type Generalization of Wilson's Theorem
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.