One term a school ran 20 sessions of an after-school Astronomy Club. Exactly five pupils attended each session and no two students encountered one another over all of the sessions more than once. Prove that no fewer than 20 pupils attended the Astronomy Club at some point during the term.
In Mexico, environmentalists have succeeded in enacting a law whereby every car should not be driven at least one day a week (the owner informs the police about their car registration number and the day of the week when this car will not be driven). In a certain family, all adults want to travel daily (each for their own business!). How many cars (at least) should the family have, if the family has a) 5 adults? b) 8 adults?
Solve the puzzle: \(BAO \times BA \times B = 2002\).
Prove that if 21 people collected 200 nuts between them, there are two people in the group who collected the same number of nuts.
There are \(n\) integers. Prove that among them either there are several numbers whose sum is divisible by \(n\) or there is one number divisible by \(n\) itself.
a) Prove that in any football team there are two players who were born on the same day of the week.
b) Prove that in the population of London, which is almost 9 million, there will be ten thousand people who celebrate their birthday on the same day.
a) A 1 or a 0 is placed on each vertex of a cube. The sum of the 4 adjacent vertices is written on each face of the cube. Is it possible for each of the numbers written on the faces to be different?
b) The same question, but if 1 and \(-1\) are used instead.
In a chess tournament, each participant played two games with each of the other participants: one with white pieces, the other with black. At the end of the tournament, it turned out that all of the participants scored the same number of points (1 point for a victory, \(\frac{1}{2}\) a point for a draw and 0 points for a loss). Prove that there are two participants who have won the same number of games using white pieces.
In a mathematical olympiad, \(m>1\) candidates solved \(n>1\) problems. Each candidate solved a different number of problems to all the others. Each problem was solved by a different number of candidates to all the others. Prove that one of the candidates solved exactly one problem.
Each of the 1994 deputies in parliament slapped exactly one of his colleagues. Prove that it is possible to draw up a parliamentary commission of 665 people whose members did not clarify the relationship between themselves in the manner indicated above.