Two ants crawled along their own closed route on a \(7\times7\) board. Each ant crawled only on the sides of the cells of the board and visited each of the 64 vertices of the cells exactly once. What is the smallest possible number of cell edges, along which both the first and second ants crawled?
101 random points are chosen inside a unit square, including on the edges of the square, so that no three points lie on the same straight line. Prove that there exist some triangles with vertices on these points, whose area does not exceed 0.01.
On a chessboard, \(n\) white and \(n\) black rooks are arranged so that the rooks of different colours cannot capture one another. Find the greatest possible value of \(n\).
There are a thousand tickets with numbers 000, 001, ..., 999 and a hundred boxes with the numbers 00, 01, ..., 99. A ticket is allowed to be dropped into a box if the number of the box can be obtained from the ticket number by erasing one of the digits. Is it possible to arrange all of the tickets into 50 boxes?
2011 numbers are written on a blackboard. It turns out that the sum of any of these written numbers is also one of the written numbers. What is the minimum number of zeroes within this set of 2011 numbers?
Can 100 weights of masses 1, 2, 3, ..., 99, 100 be arranged into 10 piles of different masses so that the following condition is fulfilled: the heavier the pile, the fewer weights in it?
We are given \(n+1\) different natural numbers, which are less than \(2n\) (\(n>1\)). Prove that among them there will always be three numbers, where the sum of two of them is equal to the third.
When cleaning her children’s room, a mother found \(9\) socks. In a group of any \(4\) of the socks at least two belonged to the same child. In a group of any \(5\) of the socks no more than \(3\) had the same owner. How many children are there in the room and how many socks belong to each child?
A bag contains balls of two different colours – black and white. What is the minimum number of balls you need to remove, without looking, to guarantee that within the removed balls at least two are the same colour.
A forest contains a million fir trees. It is known that any given tree has at most 600,000 needles. Prove that there will be two trees with the same number of needles.