Problems like this can be handled by the Pigeonhole Principle. This is one of my favorite tools in mathematics because of its usefulness and its intuitiveness. The Pigeonhole Principle states that if you have $m$ pigeons and $n$ boxes (or holes), and you place each pigeon in some box, then at least one box has at least $m/n$ pigeons inside it. This can also be worded as follows:
Suppose that you have $n$ real numbers $x_1, \dots , x_n$. Then
$ x_1 + \dots + x_n = C \Longrightarrow x_i \geq \frac{C}{n} \quad \text{for some } i. $
Similarly, if one has $n$ positive real numbers $x_1, \dots , x_n$, then
$ x_1 \cdot \dots \cdot x_n = C \Longrightarrow x_1 \geq \sqrt[n]{C} \quad \text{for some } i. $
The easiest proof of this is probably the proof of the contrapositive:
- If one is given $n$ integers $x_1 , \dots , x_n$, and each of them is less than $\frac{C}{n}$, then
$ x_1 + \dots + x_n < C. $