MathDB
Problems
Contests
International Contests
Tournament Of Towns
1992 Tournament Of Towns
(343) 1
(343) 1
Part of
1992 Tournament Of Towns
Problems
(1)
TOT 343 1992 Autumn A J1 numbers in nxn table
Source:
6/10/2024
Numbers in an
n
n
n
by
n
n
n
table may be changed by adding
1
1
1
to each number on an arbitrary closed non-selfintersecting “rook path” (a broken line with segments parallel to the borders of the table). Originally
1
1
1
’s stand on one of the diagonals, and $0S’s in the other cells of the table. Can one get (after several transformations) a table in which all numbers are equal to each other? (A “rook path” contains all cells through which it passes.)(AA Egorov)
combinatorics