Difference between revisions of "1971 IMO Problems/Problem 6"
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
Let <math>A = (a_{ij})(i, j = 1, 2, \cdots, n)</math> be a square matrix whose elements are non-negative integers. Suppose that whenever an element <math>a_{ij} = 0</math>, the sum of the elements in the <math>i</math>th row and the <math>j</math>th column is <math>\geq n</math>. Prove that the sum of all the elements of the matrix is <math>\geq n^2 / 2</math>. | Let <math>A = (a_{ij})(i, j = 1, 2, \cdots, n)</math> be a square matrix whose elements are non-negative integers. Suppose that whenever an element <math>a_{ij} = 0</math>, the sum of the elements in the <math>i</math>th row and the <math>j</math>th column is <math>\geq n</math>. Prove that the sum of all the elements of the matrix is <math>\geq n^2 / 2</math>. | ||
+ | |||
+ | ==Solution 1== | ||
+ | Take the the row or column (without loss of generality, a row) with the minimum possible sum <math> S</math> of its elements. Let <math> z</math> be the number of zeros in this row. We will assume <math> S < \frac{n}{2}</math> once the other case is obvious. Clearly <math> S \ge n - z \Rightarrow z \ge n - S</math>. The total sum <math> T</math> of all elements of the matrix is at least the number of zeros in this row multiplicated by <math> n - S</math> (because the sum of the elements of a row and a column meeting in a zero is <math> \ge n</math>) plus the number of nonzero elements times <math> S</math> (that is the minimum possible sum), it is,<cmath> z(n - S) + (n - z)S.</cmath>Note that, being <math> z \ge n - S</math> and <math> n - S \ge S</math>, we can put <math> z - 1</math> instead of <math> z</math> and <math> n - z + 1</math> instead of <math> n - z</math> until we get <math> z = n - S</math>, what makes the sum become smaller. So we have<cmath> T \ge (n - S)^2 + S^2 \ge 2(\frac{n - S + S}{2})^2 = \frac{n^2}{2}</cmath>by AM - QM inequality. | ||
+ | |||
+ | The above solution was posted and copyrighted by Renan. The original thread for this problem can be found here: [https://aops.com/community/p1074433] | ||
+ | |||
+ | ==Solution 2== | ||
+ | Denote <math>\ell_i,c_i</math> the <math>i</math>th line and column and <math>s(\ell_i), s(c_i)</math> the sum of the elements on that row. Let <math>M=\max_{\sigma \in S_n} | \{ 1\le i\le n| a_{i\sigma(i)}=0\} |</math>. For each permutation <math>\sigma\in S_n</math>, assign to it the number<cmath>\displaystyle\sum\limits_{a_{i\sigma(i)=0}} \left ( s(\ell_i)+s(c_{\sigma(i)}) \right )</cmath>Now pick a permutation <math>\sigma</math> such that it generates <math>M</math> and its assigned number is minimal. Suppose wlog that <math>\{ 1\le i\le n| a_{i\sigma(i)}=0\}=\{1,2,..,k\}</math>. If <math>k=n</math>, we are done as twice the sum of all elements is<cmath>\displaystyle\sum\limits_{i=1}^{n} s(\ell_i) +\displaystyle\sum\limits_{i=1}^{n} s(c_i)=\displaystyle\sum\limits_{i=1}^{n} (s(\ell_i)+s(c_{\sigma(i)}))\ge n^2</cmath> | ||
+ | So suppose <math>k<n</math> and look at a <math>j</math> such that <math>k+1\le j\le n</math>. By the maximality of <math>M</math>, <math>\ell_j</math> can have <math>0</math> only on the columns <math>\sigma(1),...,\sigma(k)</math>. Note that if <math>\ell_j</math> has a <math>0</math> on <math>c_{\sigma(r)}</math> with <math>r\le k</math>, i.e. <math>a_{j\sigma(r)}=0</math>, by the minimality of the assigned number of <math>\sigma</math>, we have that <math>s(\ell_j)\ge s(\ell_r)</math>. However, if the column <math>c_{\sigma(j)}</math> has a <math>0</math> on <math>\ell_r</math>, i.e. <math>a_{r\sigma(j)}=0</math>, by the same argument we have <math>s(c_\sigma(j))\ge s(c_\sigma(r))</math>, hence <math>s(\ell_j)+s(c_{\sigma(j)})\ge s(r)+s(c_{\sigma(r)})\ge n</math>. | ||
+ | |||
+ | Suppose that <math>0</math> appears exactly <math>t</math> times on <math>\ell_j</math>. This means that <math>s(\ell_j)\ge n-t</math>. Suppose that the <math>0</math>s of <math>\ell_j</math> appear on the columns <math>c_{\sigma(i_1)},...,c_{\sigma(i_t)}</math>. We have seen earlier that if <math>c_\sigma(j)</math> has a <math>0</math> on <math>i_1,..,i_t</math> we have that <math>s(\ell_j)+s(c_{\sigma(j)})\ge n</math>. So suppose that it doesn't have <math>0</math> on these lines. However, <math>c_{\sigma(j)}</math> has <math>0</math>s only on the lines <math>\ell_1,..,\ell_k</math> by the maximality of <math>M</math>, hence <math>c_{\sigma(j)}</math> has at most <math>k-t</math> zeroes, so <math>s(c_{\sigma(j)})\ge n-k+t</math>. We thus infer that<cmath>s(\ell_j)+s(c_{\sigma(j)})\ge (n-t)+(n-k+t)=2n-k\ge n</cmath>so <math>s(\ell_j)+s(c_{\sigma(j)})\ge n,\ \forall j\ge k+1</math>. By the hypothesis this is also true for <math>j\le k</math> so summing over all values of <math>j</math> we get that the sum is at least <math>\dfrac{n^2}{2}</math>. | ||
+ | |||
+ | The above solution was posted and copyrighted by Aiscrim. The original thread for this problem can be found here: [https://aops.com/community/p5910485] | ||
+ | |||
+ | ==Solution 3== | ||
+ | If the main diagonal contains all zeroes, we can immediately deduce from the condition that the sum <math>S</math> of the elements is at least <math>n^2/2</math>. This motivates us to consider the largest possible subset of elements, all zero, which are pairwise in different rows of columns - let the size of this subset be <math>k</math>. (If there is no such subset, <math>S\ge n^2</math>.) | ||
+ | |||
+ | Since the condition is invariant under the operation of switching rows or columns, we may rearrange the matrix such that these <math>k</math> entries are on the main diagonal of the matrix, i.e. <math>a_{11}=a_{22}=\dots=a_{kk}=0</math>. Let <math>X=\sum_{1\le i,j\le k}a_{ij}</math>, <math>Y=\sum_{i\le k<j}a_{ij}+\sum_{j\le k<i}a_{ij}</math> and <math>Z=\sum_{k<i,j\le n}a_{ij}</math>. Then applying the condition to <math>a_{11},\dots,a_{kk}</math>, we get <math>2X+Y\ge kn</math>. | ||
+ | |||
+ | If <math>i\le k<j</math>, then if <math>a_{ij}=a_{ji}=0</math>, then we may toss <math>a_{ii}</math> out of our set and replace it with <math>a_{ij}</math> and <math>a_{ji}</math>, to form a larger feasible set of elements, contradiction. Consequently, <math>a_{ij}+a_{ji}\ge 1</math> for <math>i\le k<j</math>, which upon summation yields <math>Y\ge k(n-k)</math>. Finally, <math>Z\ge (n-k)^2</math>, trivially. Therefore, | ||
+ | <cmath>2S=2(X+Y+Z)\ge 2X+Y+Y+Z\ge kn+k(n-k)+(n-k)^2=k^2+2k(n-k)+(n-k)^2=n^2.</cmath> | ||
+ | |||
+ | The above solution was posted and copyrighted by randomusername. The original thread for this problem can be found here: [https://aops.com/community/p5612817] | ||
+ | |||
+ | == See Also == {{IMO box|year=1971|num-b=5|after=Last Question}} |
Latest revision as of 14:14, 29 January 2021
Problem
Let be a square matrix whose elements are non-negative integers. Suppose that whenever an element , the sum of the elements in the th row and the th column is . Prove that the sum of all the elements of the matrix is .
Solution 1
Take the the row or column (without loss of generality, a row) with the minimum possible sum of its elements. Let be the number of zeros in this row. We will assume once the other case is obvious. Clearly . The total sum of all elements of the matrix is at least the number of zeros in this row multiplicated by (because the sum of the elements of a row and a column meeting in a zero is ) plus the number of nonzero elements times (that is the minimum possible sum), it is,Note that, being and , we can put instead of and instead of until we get , what makes the sum become smaller. So we haveby AM - QM inequality.
The above solution was posted and copyrighted by Renan. The original thread for this problem can be found here: [1]
Solution 2
Denote the th line and column and the sum of the elements on that row. Let . For each permutation , assign to it the numberNow pick a permutation such that it generates and its assigned number is minimal. Suppose wlog that . If , we are done as twice the sum of all elements is So suppose and look at a such that . By the maximality of , can have only on the columns . Note that if has a on with , i.e. , by the minimality of the assigned number of , we have that . However, if the column has a on , i.e. , by the same argument we have , hence .
Suppose that appears exactly times on . This means that . Suppose that the s of appear on the columns . We have seen earlier that if has a on we have that . So suppose that it doesn't have on these lines. However, has s only on the lines by the maximality of , hence has at most zeroes, so . We thus infer thatso . By the hypothesis this is also true for so summing over all values of we get that the sum is at least .
The above solution was posted and copyrighted by Aiscrim. The original thread for this problem can be found here: [2]
Solution 3
If the main diagonal contains all zeroes, we can immediately deduce from the condition that the sum of the elements is at least . This motivates us to consider the largest possible subset of elements, all zero, which are pairwise in different rows of columns - let the size of this subset be . (If there is no such subset, .)
Since the condition is invariant under the operation of switching rows or columns, we may rearrange the matrix such that these entries are on the main diagonal of the matrix, i.e. . Let , and . Then applying the condition to , we get .
If , then if , then we may toss out of our set and replace it with and , to form a larger feasible set of elements, contradiction. Consequently, for , which upon summation yields . Finally, , trivially. Therefore,
The above solution was posted and copyrighted by randomusername. The original thread for this problem can be found here: [3]
See Also
1971 IMO (Problems) • Resources | ||
Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Last Question |
All IMO Problems and Solutions |