Prove the reverse triangle inequality: for every pair of real numbers \(x\), \(y\), we have \(\left| \left| x \right| - \left| y \right| \right| \leq \left| x - y \right|\).
Can you come up with a divisibility rule for \(5^n\), where \(n=1\), \(2\), \(3\), . . .? Prove that the rule works.
Show that for each \(n=1\), \(2\), \(3\), . . ., we have \(n<2^n\).
You and I are going to play a game. We have one million grains of sand in a bag. We take it in turns to remove \(2\), \(3\) or \(5\) grains of sand from the bag. The first person that cannot make a move loses.
Would you go first?
For every natural number \(k\ge2\), find two combinations of \(k\) real numbers such that their sum is twice their product.
Show that \(n^2+n+1\) is not divisible by \(5\) for any natural number \(n\).
Prove the following identity for any three non-zero real numbers \(a,b,c\): \[\frac{b}{2a} + \frac{c^2 + ab}{4bc} - \left|{\frac{c^2 - ab}{4bc}} \right| - \left|{\frac{b}{2a} - \frac{c^2 + ab}{4bc} + \left|{\frac{c^2 - ab}{4bc}}\right|}\right| = \min\{\frac{b}{a},\frac{c}{b},\frac{a}{c}\}.\]
Scrooge McDuck has \(100\) golden coins on his office table. He wants to distribute them into \(10\) piles so that no two piles contain the same amount of coins. Moreover, no matter how you divide any of the piles into two smaller piles, among the resulting \(11\) piles there will be two with the same amount of coins. Find an example of how he could do that.
Prove that \(|x|\ge x\). It may be helpful to compare each of \(|3|\), \(|-4.3|\) and \(|0|\) with \(3\), \(-4.3\) and \(0\) respectively.
Let \(a\), \(b\) and \(c\) be the three side lengths of a triangle. Does there exist a triangle with side lengths \(a+1\), \(b+1\) and \(c+1\)? Does it depend on what \(a\), \(b\) and \(c\) are?