Maths Olympiad Prep

Library / /384 of 520

Number theory Difficulty 6.5 National olympiad Prove it

Theorem 11 Let m=m1m2,xi(1)(1im1)m=m_{1} m_{2}, x_{i}^{(1)}\left(1 \leqslant i \leqslant m_{1}\right) be a complete residue system modulo m1m_{1}, and xj(2)(1jm2)x_{j}^{(2)}\left(1 \leqslant j \leqslant m_{2}\right) be a complete residue system modulo m2m_{2}. Then xij=xi(1)+m1xj(2)x_{i j}=x_{i}^{(1)}+m_{1} x_{j}^{(2)} is a complete residue system modulo mm. That is, when x(1),x(2)x^{(1)}, x^{(2)} run through the complete residue systems modulo m1m_{1}, modulo m2m_{2} respectively, x=x(1)+m1x(2)x=x^{(1)}+m_{1} x^{(2)} runs through the complete residue system modulo m=m1m2m=m_{1} m_{2}.

Solution

None

Translate the text above into English, please retain the original text's line breaks and format, and output the translation result directly.

Note: The provided instruction is a meta-instruction and not part of the text to be translated. Since the text to be translated is "None", the translation is also "None". Here is the formatted output as requested:

None

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.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.