Problem: Let a, b, p, q be positive integers such that a and b are relatively prime, ab is even and p,q≥3. Prove that 2apb−2abq cannot be a square of an integer number.
Solution
Solution: Without loss of generality, assume that a is even and consequently b is odd. Let a=2a′. Then 2apb−2abq=4a′b(ap−1−bq−1) If this is a square, then a′, b and ap−1−bq−1 are pairwise coprime.
On the other hand, ap−1 is divisible by 4 and bq−1 gives the remainder 1 when divided by 4. It follows that ap−1−bq−1 has the form 4k+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.