Four outwardly identical coins weigh 1, 2, 3 and 4 grams respectively.
Is it possible to find out in four weighings on a set of scales without weights, which one weighs how much?
Three cyclists travel in one direction along a circular track that is 300 meters long. Each of them moves with a constant speed, with all of their speeds being different. A photographer will be able to make a successful photograph of the cyclists, if all of them are on some part of the track which has a length of \(d\) meters. What is the smallest value of \(d\) for which the photographer will be able to make a successful photograph sooner or later?
There was a football match of 10 versus 10 players between a team of liars (who always lie) and a team of truth-tellers (who always tell the truth). After the match, each player was asked: “How many goals did you score?” Some participants answered “one”, Callum said “two”, some answered “three”, and the rest said “five”. Is Callum lying if it is known that the truth-tellers won with a score of 20:17?
There are 13 weights, each weighing an integer number of grams. It is known that any 12 of them can be divided into two cups of weights, six weights on each one, which will come to equilibrium. Prove that all the weights have the same weight.
30 teams are taking part in a football championship. Prove that at any moment in the contest there will be two teams who have played the same number of matches up to that moment, assuming every team plays every other team exactly once by the end of the tournament.
A White Rook pursues a black bishop on a board of \(3 \times 1969\) cells (they walk in turn according to the usual rules). How should the rook play to take the bishop? White makes the first move.
The White Rook pursues a black horse on a board of \(3 \times 1969\) cells (they walk in turn according to the usual rules). How should the rook play in order to take the horse? White makes the first move.
The judges of an Olympiad decided to denote each participant with a natural number in such a way that it would be possible to unambiguously reconstruct the number of points received by each participant in each task, and that from each two participants the one with the greater number would be the participant which received a higher score. Help the judges solve this problem!
A council of 2,000 deputies decided to approve a state budget containing 200 items of expenditure. Each deputy prepared his draft budget, which indicated for each item the maximum allowable, in his opinion, amount of expenditure, ensuring that the total amount of expenditure did not exceed the set value of \(S\). For each item, the board approves the largest amount of expenditure that is agreed to be allocated by no fewer than \(k\) deputies. What is the smallest value of \(k\) for which we can ensure that the total amount of approved expenditures does not exceed \(S\)?
Fill the free cells of the “hexagon” (see the figure) with integers from 1 to 19 so that in all vertical and diagonal rows the sum of the numbers, in the same row, is the same.