Browse · MathNet
PrintBMO 2010 Shortlist
2010 counting and probability
Problem
Is it possible to partition the set of all integer numbers into ordered triples in such a way that, for every triple the number be a perfect square?
Solution
Suppose first that . Then we have 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 .
b) Then, let on every next step and be the least two positive integers not paired yet.
c) Form the triplets and and repeat.
It is easy to see that this procedure works.
a) Begin with the triple .
b) Then, let on every next step and be the least two positive integers not paired yet.
c) Form the triplets and and repeat.
It is easy to see that this procedure works.
Techniques
Games / greedy algorithmsPolynomial operations