Maths Olympiad Prep

Library / /6 of 105

Number theory Difficulty 4.7 AIME Prove it JBMO

Problem:
Let aa, bb, pp, qq be positive integers such that aa and bb are relatively prime, abab is even and p,q3p, q \geq 3. Prove that
2apb2abq 2 a^{p} b - 2 a b^{q}
cannot be a square of an integer number.

Solution

Solution:
Without loss of generality, assume that aa is even and consequently bb is odd. Let a=2aa = 2 a'. Then
2apb2abq=4ab(ap1bq1) 2 a^{p} b - 2 a b^{q} = 4 a' b \left(a^{p-1} - b^{q-1}\right)
If this is a square, then aa', bb and ap1bq1a^{p-1} - b^{q-1} are pairwise coprime.

On the other hand, ap1a^{p-1} is divisible by 44 and bq1b^{q-1} gives the remainder 11 when divided by 44. It follows that ap1bq1a^{p-1} - b^{q-1} has the form 4k+34k + 3, a contradiction.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.