Skip to main content
OlympiadHQ

Browse · MathNet

Print

Brazilian Math Olympiad

Brazil number theory

Problem

Emerald writes the integers from to in a table, one number in each cell, each number appearing exactly once. Then she computes eight sums: the sums of three numbers on each row, the sums of the three numbers on each column and the sums of the three numbers on both diagonals.

a. Show a table such that exactly three of the eight sums are multiples of .

b. Is it possible that none of the eight sums is a multiple of ?
Solution
a. For instance,
123
456
897
The trick is to only adjust the last row. The usual order , , yields all sums to be multiple of , so it's just a matter of rearranging them.

b. No, it's not possible. First, notice that the sum of three numbers , , is a multiple of iff or , , are , , mod in some order. Let , , , be the numbers in the corner modulo . So two of them are equal. We can suppose wlog that they are either or . Also, let be the number in the central cell modulo .
ab
x
cd
If , then and is equal to either or . Suppose wlog . Then we have the following situation:
ab
b
ca
Let be the other remainder (that is, and ). Then cannot be in the same line as and . This leaves only one possibility:
ab
mb
mma
But the remaining will necessarily yield a line with all three remainders. Now if , then both and are different from (otherwise, we reduce the problem to the previous case). If , , , are the three distinct remainders, and we have no possibility for . So .
aa
x
cc
But this prevents the other remainder to appear in the middle row, leaving only two cells for three numbers, which is not possible. So, in both cases, one of the sums is a multiple of .
Final answer
a. Example grid with rows: 1 2 3; 4 5 6; 8 9 7. b. No, it is not possible.

Techniques

Modular ArithmeticColoring schemes, extremal arguments