Maths Olympiad Prep

Library / /66 of 121

, 2004

Number theory Difficulty 6.1 National Olympiad Prove it India

Problem:
Let SS denote the set of all 6-tuples (a,b,c,d,e,f)(a, b, c, d, e, f) of positive integers such that a2+b2+c2+d2+e2=f2a^{2}+b^{2}+c^{2}+d^{2}+e^{2}=f^{2}. Consider the set
T={abcdef:(a,b,c,d,e,f)S} T=\{a b c d e f:(a, b, c, d, e, f) \in S\}
Find the greatest common divisor of all the members of TT.

Solution

Solution:
We show that the required gcd is 24. Consider an element (a,b,c,d,e,f)S(a, b, c, d, e, f) \in S. We have
a2+b2+c2+d2+e2=f2 a^{2}+b^{2}+c^{2}+d^{2}+e^{2}=f^{2}
We first observe that not all a,b,c,d,ea, b, c, d, e can be odd. Otherwise, we have a2b2c2d2e21a^{2} \equiv b^{2} \equiv c^{2} \equiv d^{2} \equiv e^{2} \equiv 1 (mod8)(\bmod 8) and hence f25(mod8)f^{2} \equiv 5(\bmod 8), which is impossible because no square can be congruent to 5 modulo 8. Thus at least one of a,b,c,d,ea, b, c, d, e is even.

Similarly if none of a,b,c,d,ea, b, c, d, e is divisible by 3, then a2b2c2d2e21(mod3)a^{2} \equiv b^{2} \equiv c^{2} \equiv d^{2} \equiv e^{2} \equiv 1(\bmod 3) and hence f22(mod3)f^{2} \equiv 2(\bmod 3) which again is impossible because no square is congruent to 2 modulo 3. Thus 3 divides abcdefa b c d e f.

There are several possibilities for a,b,c,d,ea, b, c, d, e.

Case 1: Suppose one of them is even and the other four are odd; say aa is even, b,c,d,eb, c, d, e are odd. Then b2+c2+d2+e24(mod8)b^{2}+c^{2}+d^{2}+e^{2} \equiv 4(\bmod 8). If a24(mod8)a^{2} \equiv 4(\bmod 8), then f20(mod8)f^{2} \equiv 0(\bmod 8) and hence 2a,4f2|a, 4| f giving 8af8 \mid a f. If a20(mod8)a^{2} \equiv 0(\bmod 8), then f24(mod8)f^{2} \equiv 4(\bmod 8) which again gives that 4a4 \mid a and 2f2 \mid f so that 8af8 \mid a f. It follows that 8abcdef8 \mid a b c d e f and hence 24abcdef24 \mid a b c d e f.

Case 2: Suppose a,ba, b are even and c,d,ec, d, e are odd. Then c2+d2+e23(mod8)c^{2}+d^{2}+e^{2} \equiv 3(\bmod 8). Since a2+b20a^{2}+b^{2} \equiv 0 or 44 modulo 8, it follows that f23f^{2} \equiv 3 or 7(mod8)7(\bmod 8) which is impossible. Hence this case does not arise.

Case 3: If three of a,b,c,d,ea, b, c, d, e are even and two odd, then 8abcdef8 \mid a b c d e f and hence 24abcdef24|a b c d e f.

Case 4: If four of a,b,c,d,ea, b, c, d, e are even, then again 8abcdef8 \mid a b c d e f and 24abcdef24|a b c d e f.

Here again for any six tuple (a,b,c,d,e,f)(a, b, c, d, e, f) in SS, we observe that 24abcdef24 \mid a b c d e f. Since
12+12+12+22+32=42 1^{2}+1^{2}+1^{2}+2^{2}+3^{2}=4^{2}
We see that (1,1,1,2,3,4)S(1,1,1,2,3,4) \in S and hence 24T24 \in T. Thus 24 is the gcd of TT.

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.