Showing a Residue System Modulo to a Prime Number
Not what you're looking for? Search our solutions OR ask your own Custom question.
Suppose that p is a prime number. Show that 0, (p-1)!/2, (p-1)!/3, ..., (p-1)!/(p-1) is a complete residue system modulo p.
© BrainMass Inc. brainmass.com December 24, 2021, 5:31 pm ad1c9bdddfhttps://brainmass.com/math/number-theory/complete-residue-system-suppose-prime-number-52475
Solution Preview
Please see the attached file for the complete solution.
Thanks for using BrainMass.
Definition(Complete residue system) Let . A set of integers
x1; : : : ; xm is called a complete residue system modulo m, if it contains exactly
one integer from each equivalence class modulo m. Equivalently, a complete
residue system modulo m is a set satisfying
(i) For every there ...
Solution Summary
A complete residue system is proven. The solution is detailed and well presented.
$2.49