Maths Olympiad Prep

Library / /491 of 520

Number theory Difficulty 7.3 National olympiad, round 2 Prove it

Theorem 1 Let m=m1m2,xi(1)m=m_{1} m_{2}, x_{i}^{(1)} be a complete residue system modulo m1m_{1}, and xj(2)x_{j}^{(2)} be a complete residue system modulo m2m_{2}. Then xijx_{i j} =xi(1)+m1xj(2)=x_{i}^{(1)}+m_{1} x_{j}^{(2)} is a complete residue system modulo mm. That is, as 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

Prove that at this time, xijx_{ij} has a total of m=m1m2m=m_{1} m_{2} numbers, so it is only necessary to prove that they are pairwise distinct modulo mm.
If xi1(1)+m1xj1(2)xi1j1xi2j2xi2(1)+m1xj2(2)(modm1m2)x_{i_{1}}^{(1)}+m_{1} x_{j_{1}}^{(2)} \equiv x_{i_{1} j_{1}} \equiv x_{i_{2} j_{2}} \equiv x_{i_{2}}^{(1)}+m_{1} x_{j_{2}}^{(2)}\left(\bmod m_{1} m_{2}\right),
then it must be that xi1(1)xi2(1)(modm1)x_{i_{1}}^{(1)} \equiv x_{i_{2}}^{(1)}\left(\bmod m_{1}\right),
thus it must be that i1=i2,xi1(1)=xi2(1)i_{1}=i_{2}, x_{i_{1}}^{(1)}=x_{i_{2}}^{(1)} (because xi(1)x_{i}^{(1)} takes values in the same complete residue system modulo mm).
Furthermore, we get m1xj1(2)m1xj2(2)(modm1m2)m_{1} x_{j_{1}}^{(2)} \equiv m_{1} x_{j_{2}}^{(2)}\left(\bmod m_{1} m_{2}\right),
which means xj2(2)x11(2)(modm2)x_{j_{2}}^{(2)} \equiv x_{1_{1}}^{(2)}\left(\bmod m_{2}\right).
Similarly, we have j1=j2,xj1(2)=xj2(2)j_{1}=j_{2}, x_{j_{1}}^{(2)}=x_{j_{2}}^{(2)}, 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.

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