MathDB
Problems
Contests
Undergraduate contests
MIPT
MIPT Undergraduate Contest 2019
1.3
1.3
Part of
MIPT Undergraduate Contest 2019
Problems
(1)
Rank preservation after interchanging positives and negatives in a matrix
Source: MIPT Undergraduate Competition 2019 1.3
8/17/2020
Given a natural number
n
n
n
, for what maximal value
k
k
k
it is possible to construct a matrix of size
k
×
n
k \times n
k
×
n
consisting only of elements
±
1
\pm 1
±
1
in such a way that for any interchange of a
+
1
+1
+
1
with a
−
1
-1
−
1
or vice versa, its rank is equal to
k
k
k
?
linear algebra
matrix