Maths Olympiad Prep

Library / /2 of 2

Number theory Difficulty 5.9 AIME, harder Prove it Argentina

Let aa and bb be rational numbers such that a+b=a2+b2a+b = a^2 + b^2. Suppose that the common value s=a+b=a2+b2s = a+b = a^2 + b^2 is not an integer, and write it as an irreducible fraction: s=mns = \frac{m}{n}. Let pp be the least prime divisor of nn. Find the minimum value of pp.

Solutions — 2

Solution 1

The minimum value of pp is 55.

Write aa and bb as fractions with least common denominator ww: a=uwa = \frac{u}{w}, b=vwb = \frac{v}{w}. In other words, if a=uwa = \frac{u'}{w'}, b=vwb = \frac{v'}{w'} is another representation with common denominator ww', then www' \ge w. The irreducible representation s=u+vws = \frac{u+v}{w} is obtained from s=u+vws = \frac{u+v}{w} by possible cancelation. Therefore, the prime divisors of nn are among the ones of ww.

We show that ww is not divisible by 22 and 33, implying that neither is nn.

The condition a+b=a2+b2a+b = a^2 + b^2 gives u2+v2=w(u+v)u^2 + v^2 = w(u+v).

Suppose that 33 divides ww. Then u2+v2u^2 + v^2 is a multiple of 33, and since x2=0,1(mod3)x^2 = 0, 1 \pmod{3} for each integer xx, it follows that both uu and vv are divisible by 33. However, then 33 is a common divisor of uu, vv, and ww, which contradicts the minimality of ww.

Similarly, suppose that ww is even. Then u2+v2u^2 + v^2 is even, hence so is u+vu+v (u2+v2u^2 + v^2 has the same parity as u+vu+v). Hence u2+v2u^2 + v^2 is divisible by 44, and since x2=0,1(mod4)x^2 = 0, 1 \pmod{4} for each integer xx, both uu and vv are even. We reach a contradiction with the minimality of ww again.

Solution 2

The minimum value of pp is p=5p = 5. Write aa and bb as fractions with least common denominator ww: a=uwa = \frac{u}{w}, b=vwb = \frac{v}{w}. In other words, if a=uwa = \frac{u'}{w'}, b=vwb = \frac{v'}{w'} is another representation with common denominator ww', then www' \geq w. The irreducible representation s=mns = \frac{m}{n} is obtained from s=u+vws = \frac{u+v}{w} by possible cancellation. Therefore, the prime divisors of nn are among the ones of ww.

We show that ww is not divisible by 22 and 33, implying that neither is nn. The condition a+b=a2+b2a+b = a^2 + b^2 gives u2+v2=w(u+v)u^2 + v^2 = w(u+v). Suppose that 33 divides ww. Then u2+v2u^2 + v^2 is a multiple of 33, and since x20,1(mod3)x^2 \equiv 0,1 \pmod{3} for each integer xx, it follows that both uu and vv are divisible by 33. However, then 33 is a common divisor of uu, vv, and ww, which contradicts the minimality of ww. Similarly, suppose that ww is even. Then u2+v2u^2 + v^2 is even, hence so is u+vu+v (u2+v2u^2 + v^2 has the same parity as u+vu+v). Hence u2+v2u^2 + v^2 is divisible by 44, and since x20,1(mod4)x^2 \equiv 0,1 \pmod{4} for each integer xx, both uu and vv are even. We reach a contradiction with the minimality of ww again.

By the above, each prime divisor of nn is at least 55. For an example with p=5p = 5, let a=25a = \frac{2}{5}, b=65b = \frac{6}{5}.
Then a+b=85a+b = \frac{8}{5}, a2+b2=425+3625=4025=85a^2 + b^2 = \frac{4}{25} + \frac{36}{25} = \frac{40}{25} = \frac{8}{5}. So a+b=a2+b2a+b = a^2 + b^2 holds, the common value ss is not an integer, and its representation s=85s = \frac{8}{5} is irreducible with p=n=5p = n = 5.

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: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.