Without calculating the answer to \(2^{30}\), prove that it contains at least two identical digits.
Prove that if \((m, 10) = 1\), then there is a repeated unit \(E_n\) that is divisible by \(m\). Will there be infinitely many repeated units?
A class contains 33 pupils, who have a combined age of 430 years. Prove that if we picked the 20 oldest pupils they would have a combined age of no less than 260 years. The age of any given pupil is a whole number.
In a one-on-one tournament 10 chess players participate. What is the least number of rounds after which the single winner could have already been determined? (In each round, the participants are broken up into pairs. Win – 1 point, draw – 0.5 points, defeat – 0).
A chequered strip of \(1 \times N\) is given. Two players play the game. The first player puts a cross into one of the free cells on his turn, and subsequently the second player puts a nought in another one of the cells. It is not allowed for there to be two crosses or two noughts in two neighbouring cells. The player who is unable to make a move loses.
Which of the players can always win (no matter how their opponent played)?
We are given 111 different natural numbers that do not exceed 500. Could it be that for each of these numbers, its last digit coincides with the last digit of the sum of all of the remaining numbers?
Peter marks several cells on a \(5 \times 5\) board. His friend, Richard, will win if he can cover all of these cells with non-overlapping corners of three squares, that do not overlap with the border of the square (you can only place the corners on the squares). What is the smallest number of cells that Peter should mark so that Richard cannot win?
16 teams took part in a handball tournament where a victory was worth 2 points, a draw – 1 point and a defeat – 0 points. All teams scored a different number of points, and the team that ranked seventh, scored 21 points. Prove that the winning team drew at least once.
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?
Every day, James bakes a square cake size \(3\times3\). Jack immediately cuts out for himself four square pieces of size \(1\times1\) with sides parallel to the sides of the cake (not necessarily along the \(3\times3\) grid lines). After that, Sarah cuts out from the rest of the cake a square piece with sides, also parallel to the sides of the cake. What is the largest piece of cake that Sarah can count on, regardless of Jack’s actions?