Theorem 1 Let be a complete residue system modulo , and be a complete residue system modulo . Then is a complete residue system modulo . That is, as run through the complete residue systems modulo , modulo respectively, runs through the complete residue system modulo .
Solution
Prove that at this time, has a total of numbers, so it is only necessary to prove that they are pairwise distinct modulo .
If ,
then it must be that ,
thus it must be that (because takes values in the same complete residue system modulo ).
Furthermore, we get ,
which means .
Similarly, we have , and the theorem is proved.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.