Maths Olympiad Prep

Library / /12 of 45

, 2008

Number theory Difficulty 5.3 AIME, harder Prove it Slovenia

Let mm and nn be positive integers of different parity. Show that
(m+3n)(5m+7n)(7m+5n)(3m+n) (m + 3n)(5m + 7n)(7m + 5n)(3m + n)
can never be a perfect square.

Solution

Let us assume there exist numbers mm and nn, one even and one odd, such that A=(m+3n)(5m+7n)(7m+5n)(3m+n)A = (m + 3n)(5m + 7n)(7m + 5n)(3m + n) is a perfect square. Let dd be the greatest common divisor of mm and nn, and write m=dm1m = d m_1, n=dn1n = d n_1. Then m1m_1 and n1n_1 are coprime and AA can be written as
A=d4(m1+3n1)(5m1+7n1)(7m1+5n1)(3m1+n1). A = d^4 (m_1 + 3n_1)(5m_1 + 7n_1)(7m_1 + 5n_1)(3m_1 + n_1).
Let B=(m1+3n1)(5m1+7n1)(7m1+5n1)(3m1+n1)B = (m_1 + 3n_1)(5m_1 + 7n_1)(7m_1 + 5n_1)(3m_1 + n_1). Since AA is a perfect square, so is BB.

Let pp be a positive integer that divides both m1+3n1m_1 + 3n_1 and 5m1+7n15m_1 + 7n_1. Since m1m_1 and n1n_1 have different parity, the numbers m1+3n1m_1 + 3n_1 and 5m1+7n15m_1 + 7n_1 are odd and pp must be odd, too. On the other hand we have
p5(m1+3n1)(5m1+7n1)=8n1, p \mid 5 \cdot (m_1 + 3n_1) - (5m_1 + 7n_1) = 8n_1,
p3(5m1+7n1)7(m1+3n1)=8m1, p \mid 3 \cdot (5m_1 + 7n_1) - 7(m_1 + 3n_1) = 8m_1,
so pm1p \mid m_1 and pn1p \mid n_1, which implies p=1p = 1. We have shown that m1+3n1m_1 + 3n_1 and 5m1+7n15m_1 + 7n_1 are coprime.

Let qq be a positive integer such that qm1+3n1q \mid m_1 + 3n_1 and q7m1+5n1q \mid 7m_1 + 5n_1. Again, qq must be odd and
q7(m1+3n1)(7m1+5n1)=16n1, q \mid 7(m_1 + 3n_1) - (7m_1 + 5n_1) = 16n_1,
q3(7m1+5n1)5(m1+3n1)=16m1. q \mid 3(7m_1 + 5n_1) - 5(m_1 + 3n_1) = 16m_1.
So, qn1q \mid n_1 and qm1q \mid m_1, which implies q=1q = 1. We conclude that m1+3n1m_1 + 3n_1 and (5m1+7n1)(7m1+5n1)(5m_1 + 7n_1)(7m_1 + 5n_1) are coprime.

Similarly, one can show that 3m1+n13m_1 + n_1 and (5m1+7n1)(7m1+5n1)(5m_1 + 7n_1)(7m_1 + 5n_1) are coprime. Now, assume rm1+3n1r \mid m_1 + 3n_1 and r3m1+n1r \mid 3m_1 + n_1. Then r3(m1+3n1)(3m1+n1)=8n1r \mid 3(m_1 + 3n_1) - (3m_1 + n_1) = 8n_1 and r3(3m1+n1)(m1+3n1)=8m1r \mid 3(3m_1 + n_1) - (m_1 + 3n_1) = 8m_1, so rn1r \mid n_1, rm1r \mid m_1 and r=1r = 1.

We have shown that the two factors 3m1+n13m_1 + n_1 and m1+3n1m_1 + 3n_1 are coprime to any other factor of B=(m1+3n1)(3m1+n1)(5m1+7n1)(7m1+5n1)B = (m_1 + 3n_1)(3m_1 + n_1)(5m_1 + 7n_1)(7m_1 + 5n_1), and since BB is a perfect square, we see that m1+3n1m_1 + 3n_1 and 3m1+n13m_1 + n_1 must be perfect squares as well. Denote them by a2a^2 and b2b^2, respectively. Then
(ab)(a+b)=a2b2=2(n1m1). (a - b)(a + b) = a^2 - b^2 = 2(n_1 - m_1).
The right-hand side is divisible by 22 but not by 44 because n1n_1 and m1m_1 have different parity. On the other hand, aba - b and a+ba + b have the same parity and since their product is divisible by 22, it must also be divisible by 44. This contradiction shows that
(m+3n)(5m+7n)(7m+5n)(3m+n) (m + 3n)(5m + 7n)(7m + 5n)(3m + n)
cannot be a perfect square.

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.