Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 2.1.48* (Product of complete residue systems modulo $p$)
Exercise 2.1.48* (Product of complete residue systems modulo $p$)
If and are any two complete residue systems modulo a prime , prove that the set cannot be a complete residue system modulo .
Answers
Proof. Let and be two complete residue systems modulo a prime . Assume for contradiction that is a complete residue system modulo .
As for every complete residue system, there exists one and only one index such that . So if , thus and if . Therefore . Without loss of generality, we may assume that , so that
are three reduced residue system modulo .
By Exercise 47,
Then
Thus , so . This is a contradiction since by hypothesis.
So cannot be a complete residue system modulo . □