You are given a $n \times n$ array as follows:
\[\begin{array}{cccc}\displaystyle
1 & \frac 1 2 & \cdots & \frac 1 n\\
\frac 1 2 & \frac 1 3 & \cdots & \frac 1 {n+1}\\
: & : & & :\\
: & : & & :\\
\frac 1 n & \frac 1 {n+1} & \cdots & \frac 1 {2n-1}
\end{array}
\]
Prove that the sum of any $n$ entries situated in different rows and different columns is not less than $1$.
Sum of the entries
"Questions we can't answer are far better than answers we can't question"
- Phlembac Adib Hasan
- Posts:1016
- Joined:Tue Nov 22, 2011 7:49 pm
- Location:127.0.0.1
- Contact:
Re: Sum of the entries
($1000^{th}$ post, yay)
Solution:
Solution:
Welcome to BdMO Online Forum. Check out Forum Guides & Rules