From the set of numbers 1 to \(2n\), \(n + 1\) numbers are chosen. Prove that among the chosen numbers there are two, one of which is divisible by another.
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.
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.
Prove that the 13th day of the month is more likely to occur on a Friday than on other days of the week. It is assumed that we live in the Gregorian style calendar.
Specify any solution of the puzzle: \(2014 + YES =BEAR\).
A pack of 36 cards was placed in front of a psychic face down. He calls the suit of the top card, after which the card is opened, shown to him and put aside. After this, the psychic calls out the suit of the next card, etc. The task of the psychic is to guess the suit as many times as possible. However, the card backs are in fact asymmetrical, and the psychic can see in which of the two positions the top card lies. The deck is prepared by a bribed employee. The clerk knows the order of the cards in the deck, and although he cannot change it, he can prompt the psychic by having the card backs arranged in a way according to a specific arrangement. Can the psychic, with the help of such a clue, ensure the guessing of the suit of
a) more than half of the cards;
b) no less than 20 cards?
In the first term of the year Daniel received five grades in mathematics with each of them being on a scale of 1 to 5, and the most common grade among them was a 5 . In this case it turned out that the median of all his grades was 4, and the arithmetic mean was 3.8. What grades could Daniel have?
The point \(O\) is randomly chosen on piece of square paper. Then the square is folded in such a way that each vertex is overlaid on the point \(O\). The figure shows one of the possible folding schemes. Find the mathematical expectation of the number of sides of the polygon that appears.
10 children were each given a bowl with 100 pieces of pasta. However, these children did not want to eat and instead started to play. One of the children started to place one piece of pasta into every other child’s bowl. What is the least amount of transfers needed so that everyone has a different number of pieces of pasta in their bowl?
100 children were each given a bowl with 100 pieces of pasta. However, these children did not want to eat and instead started to play. One of the children started to place one piece of her pasta into other children’s bowls (to whomever she wants). What is the least amount of transfers needed so that everyone has a different number of pieces of pasta in their bowl?