MathDB

There are given

111

coins and a

n\times n

table divided into unit cells. This coins are placed inside the unit cells (one unit cell may contain one coin, many coins, or may be empty), such that the difference between the number of coins from two neighbouring cells (that have a common edge) is

1

. Find the maximal

n

for this to be possible.

Problem Statement