Question 24
Given an odd positive integer $n$. Determine the smallest positive integer $k$ such that it would be possible to fill all the cells of a $3 \times k$ table with non-negative integers such that
i. The sum of the entries of each column is $n$;
ii. Each of the numbers $0, 1, \dots, n$ appears at least once in each row.
i. The sum of the entries of each column is $n$;
ii. Each of the numbers $0, 1, \dots, n$ appears at least once in each row.