MathDB
Problems
Contests
National and Regional Contests
India Contests
India National Olympiad
1996 India National Olympiad
6
6
Part of
1996 India National Olympiad
Problems
(1)
Arrays
Source: INMO 1996 Problem 6
10/6/2005
There is a
2
n
×
2
n
2n \times 2n
2
n
×
2
n
array (matrix) consisting of
0
′
s
0's
0
′
s
and
1
′
s
1's
1
′
s
and there are exactly
3
n
3n
3
n
zeroes. Show that it is possible to remove all the zeroes by deleting some
n
n
n
rows and some
n
n
n
columns.
linear algebra
matrix
combinatorics unsolved
combinatorics