We solve problems

Problem #PRU-103819

Problems Methods Pigeonhole principle Pigeonhole principle (other) Set theory and logic Theory of algotithms Theory of algorithms (other)

12–14 3.0

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?

Problem #PRU-103869

Problems Set theory and logic Order relations Methods Pigeonhole principle Pigeonhole principle (other)

11–13 2.0

Solve the puzzle: $B A O \times B A \times B = 2002$ .

Problem #PRU-103960

Problems Methods Pigeonhole principle Pigeonhole principle (other)

11–13 2.0

Prove that if 21 people collected 200 nuts between them, there are two people in the group who collected the same number of nuts.

Problem #PRU-103987

Problems Methods Pigeonhole principle Pigeonhole principle (other)

10–12 2.0

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.

Problem #PRU-104021

Problems Geometry Solid geometry Parallelepipeds Special cases of parallelepipeds Cube Algebra and arithmetic Number theory. Divisibility Odd and even numbers Methods Pigeonhole principle Pigeonhole principle (other)

12–13 2.0

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.

Problem #PRU-105052

Problems Methods Pigeonhole principle Pigeonhole principle (other) Proof by contradiction Algebra and arithmetic Word problems Tables and tournaments Tables and tournaments (other)

11–13 3.0

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.

Problem #PRU-105204

Problems Methods Pigeonhole principle Pigeonhole principle (other) Proof by contradiction

12–14 3.0

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.

Problem #PRU-107762

Problems Methods Extremal principle Extremal principle (other) Pigeonhole principle Pigeonhole principle (other)

13–15 4.0

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.

Problem #PRU-107802

Problems Methods Examples and counterexamples. Constructive proofs Algebra and arithmetic Word problems Tables and tournaments Number tables and its properties Pigeonhole principle Pigeonhole principle (other)

12–14 4.0

Eight schoolchildren solved $8$ tasks. It turned out that $5$ schoolchildren solved each problem. Prove that there are two schoolchildren, who solved every problem at least once.
If each problem is solved by $4$ pupils, prove that it is not necessary to have two schoolchildren who would solve each problem.

Problem #PRU-109441

Problems Methods Pigeonhole principle Pigeonhole principle (other)

13–16 4.0

We are given a $100 \times 100$ square grid and $N$ counters. All of the possible arrangements of the counters on the grid which follow the following rule are considered: no two counters lie in adjacent squares.

What is the largest value of $N$ for which, in every single possible arrangement of counters following this rule, it is possible to find at least one counter such that moving it to an adjacent square does not break the rule. Squares are considered adjacent if they share a side.