Maths Olympiad Prep

Library / /241 of 520

Number theory Difficulty 6.0 National olympiad Prove it

Example 5 Let m,n>0,mn(m2+n2)m, n>0, m n \mid\left(m^{2}+n^{2}\right), then m=nm=n.

Solution

Proof: Let (m,n)=d(m, n)=d, then m=m1d,n=n1dm=m_{1} d, n=n_{1} d, where (m1,n1)=1\left(m_{1}, n_{1}\right)=1. Thus, the given condition becomes m1n1(m12+n12)m_{1} n_{1} \mid\left(m_{1}^{2}+n_{1}^{2}\right), hence we also have m1(m12+n12)m_{1} \mid\left(m_{1}^{2}+n_{1}^{2}\right), which implies m1n12m_{1} \mid n_{1}^{2}. But (m1,n1)=1\left(m_{1}, n_{1}\right)=1, so (m1,n12)=1\left(m_{1}, n_{1}^{2}\right)=1. Combining m1n12m_{1} \mid n_{1}^{2}, we must have m1=1m_{1}=1. Similarly, n1=1n_{1}=1, therefore m=nm=n.

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.