MathDB
Problems
Contests
National and Regional Contests
Taiwan Contests
TST Round 1
2019 Taiwan TST Round 1
4
4
Part of
2019 Taiwan TST Round 1
Problems
(1)
So Many Arrows
Source: 2019 Taiwan TST Round 1
3/31/2020
Find all positive integers
n
n
n
with the following property: It is possible to fill a
n
×
n
n \times n
n
×
n
chessboard with one of arrows
↑
,
↓
,
←
,
→
\uparrow, \downarrow, \leftarrow, \rightarrow
↑
,
↓
,
←
,
→
such that 1. Start from any grid, if we follows the arrows, then we will eventually go back to the start point.2. For every row, except the first and the last, the number of
↑
\uparrow
↑
and the number of
↓
\downarrow
↓
are the same. 3. For every column, except the first and the last, the number of
←
\leftarrow
←
and the number of
→
\rightarrow
→
are the same.
combinatorics