Is it true that if \(a\) is a positive number, then \(a^2 \ge a\)? What about \(a^2 +1 \ge a\)?
The numbers \(a\), \(b\) and \(c\) are positive. By completing the square, show that \[\frac{a^2}4 + b^2 + c^2 \ge ab-ac+2bc.\]
Let \(m\) and \(n\) be natural numbers such that \(m>n\). Show that: \[\frac1{n^2} + \frac1{(n+1)^2} + \frac1{(n+2)^2} + \dots + \frac1{m^2} > \frac1{n} - \frac1{m}.\]
The numbers \(a,b,c\) are positive. Show that: \[\frac{ab}{c} + \frac{bc}{a} + \frac{ac}{b} \ge a +b+c.\]
Consider the following sum: \[\frac1{1 \times 2} + \frac1{2 \times 3} + \frac1{3 \times 4} + \dots\] Show that no matter how many terms it has, the sum will never be larger than \(1\).
Cut a \(7\times 7\) square into \(9\) rectangles, out of which you can construct any rectangle whose sidelengths are less than \(7\). Show how to construct the rectangles.
There are \(16\) cities in the kingdom. Prove that it is possible to build a system of roads in such a way that one can get from any city to any other without passing through more than one city on the way, and with at most five roads coming out of each city.
Recall that a line is tangent to a circle if they have only one point of intersection, a circle is called inscribed in a polygon if it is tangent to every side as a segment of that polygon.
In the triangle \(CDE\) the angle \(\angle CDE = 90^{\circ}\) and the line \(DH\) is the median. A circle with center \(A\) is inscribed in the triangle \(CDH\) and is tangent to the segment \(DH\) in its middle, let’s denote it as \(G\), so \(GH=DG\). Find the angles of the triangle \(CDE\).
Recall that a line is tangent to a circle if they have only one point of intersection, a circle is called inscribed in a polygon if it is tangent to every side as a segment of that polygon.
In the triangle \(EFG\) the line \(EH\) is the median. Two circles with centres \(A\) and \(C\) are inscribed into triangles \(EFH\) and \(EGH\) respectively, they are tangent to the median \(EH\) at the points \(B\) and \(D\). Find the length of \(BD\) if \(EF-EG=2\).
Is it possible to cover a \((4n+2) \times (4n+2)\) board with the \(L\)-tetraminos without overlapping for any \(n\)? The pieces can be flipped and turned.