Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 2.1.40 (Sum of the elements of a complete (resp. reduced) residue system)
Exercise 2.1.40 (Sum of the elements of a complete (resp. reduced) residue system)
For odd, prove that the sum of the elements of any complete system modulo is congruent to zero modulo ; prove the analogous result for any reduced system for .
Answers
Proof. Let be a complete system modulo , where is odd, and .
- a)
-
First proof. Since and are relatively prime, Theorem 2.6 shows that is a complete system modulo .
Therefore there is a permutation such that
Then
and .
Thus , so .
Second proof. Since be a complete system modulo ,
where denotes the class of in . Thus
Therefore .
Let be a reduced system modulo , where , and , so that
The proof of is very different ( doesn’t imply ).
Here , so , and (if is odd, , and if is even ).
Note that
so that we can associate to every element such that the element in the sum . Since , we obtain .
More explicitly,
So, for any reduced system , where ,
□