There are \(2k+1\) cards numbered with the numbers \(1\) to \(2k+1\). What is the largest number of cards that can be chosen so that no number on a chosen card is equal to the sum of two numbers from two other chosen cards?
We are given 51 two-digit numbers – we will count one-digit numbers as two-digit numbers with a leading 0. Prove that it is possible to choose 6 of these so that no two of them have the same digit in the same column.
You are given 1002 different integers that are no greater than 2000. Prove that it is always possible to choose three of the given numbers so that the sum of two of them is equal to the third.
Will this still always be possible if we are given 1001 integers rather than 1002?
A rectangular table is given, in each cell of which a real number is written, and in each row of the table the numbers are arranged in ascending order. Prove that if you arrange the numbers in each column of the table in ascending order, then in the rows of the resulting table, the numbers will still be in ascending order.
In a volleyball tournament teams play each other once. A win gives the team 1 point, a loss 0 points. It is known that at one point in the tournament all of the teams had different numbers of points. How many points did the team in second last place have at the end of the tournament, and what was the result of its match against the eventually winning team?
An endless board is painted in three colours (each cell is painted in one of the colours). Prove that there are four cells of the same colour, located at the vertices of the rectangle with sides parallel to the side of one cell.
Prove that amongst any 11 different decimal fractions of infinite length, there will be two whose digits in the same column – 10ths, 100s, 1000s, etc – coincide (are the same) an infinite number of times.
On a plane, six points are given so that no three of them lie on the same line. Each pair of points is connected by a blue or red segment.
Prove that among these points three such points can be chosen so that all sides of the triangle formed by them will be of the same colour.
There are 17 carriages in a passenger train. How many ways can you arrange 17 conductors around the carriages if one conductor has to be in each carriage?
The number of permutations of a set of \(n\) elements is denoted by \(P_n\).
Prove the equality \(P_n = n!\).