Maths Olympiad Prep

Library / /7 of 24

, 2010

Combinatorics Difficulty 8.2 Shortlist Prove it Balkan Mathematical Olympiad

Is it possible to partition the set of all integer numbers into ordered triples in such a way that, for every triple (a,b,c)(a, b, c) the number
a3b+b3c+c3a |a^3 b + b^3 c + c^3 a|
be a perfect square?

Solution

Suppose first that a+b+c=0a + b + c = 0. Then we have
a3b+b3c+c3a=a3b+b3(ab)+(ab)3a=b42b3a3a2b22a3ba4=(a2+ab+b2)2. \begin{aligned} |a^3 b + b^3 c + c^3 a| &= |a^3 b + b^3 (-a-b) + (-a-b)^3 a| \\ &= |-b^4 - 2b^3 a - 3a^2 b^2 - 2a^3 b - a^4| \\ &= (a^2 + ab + b^2)^2. \end{aligned}
So it suffices to partition the set of all integers into triples of zero sum. One way to do this is the following:

a) Begin with the triple (1,0,1)(-1, 0, 1).

b) Then, let on every next step pp and qq be the least two positive integers not paired yet.

c) Form the triplets (p,q,pq)(p, q, -p-q) and (p,q,p+q)(-p, -q, p+q) and repeat.

It is easy to see that this procedure works. \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.