MathDB
Estonian Math Competitions 2006/2007

Source: Seniors Problem 7

July 29, 2008
combinatorics unsolvedcombinatorics

Problem Statement

Find all positive integers n such that one can write an integer 1 to n2 n^2 into each unit square of a n2×n2 n^2 \times n^2 table in such a way that, in each row, each column and each n×n n \times n block of unit squares, each number 1 to n2 n^2 occurs exactly once.
Back to ProblemsView on AoPS