MathDB
beautiful 3xn board with integers from 1 to n

Source: 2021 JBMO TST Bosnia and Herzegovina P4

October 7, 2022
combinatorics

Problem Statement

Let nn be a nonzero natural number and let S={1,2,...,n}S = \{1, 2, . . . , n\}. A 3×n3 \times n board is called beautiful if it can be completed with numbers from the set SS like this as long as the following conditions are met: \bullet on each line, each number from the set S appears exactly once, \bullet on each column the sum of the products of two numbers on that column is divisible by nn (that is, if the numbers a,b,ca, b, c are written on a column, it must be ab+bc+caab + bc + ca be divisible by nn). For which values ​​of the natural number nn are there beautiful tables ¸and for which values ​​do not exist? Justify your answer.