We solve problems

Problems Methods Pigeonhole principle Pigeonhole principle (other)

A class has 25 pupils. It is known that for any two girls in the class, the number of male friends they have in the class is different. What is the maximum number of girls that it is possible for there to be in the class?

Problem #PRU-115477

Problems Set theory and logic Mathematical logic Mathematical logic (other) Theory of algotithms Theory of algorithms (other)

11–13 2.0

In the king’s prison, there are five cells numbered from 1 to 5. In each cell, there is one prisoner. Kristen persuaded the king to conduct an experiment: on the wall of each cell she writes at one point a number and at midnight, each prisoner will go to the cell with the indicated number (if the number on the wall coincides with the cell number, the prisoner does not go anywhere). On the following night at midnight, the prisoners again must move from their cell to another cell according to the instructions on the wall, and they do this for five nights. If the location of prisoners in the cells for all six days (including the first) is never repeated, then Kristen will be given the title of Wisdom, and the prisoners will be released. Help Kristen write numbers in the cells.

Problem #PRU-115492

Problems Methods Algebraic methods Proof by exhaustion Set theory and logic Mathematical logic Puzzles

11–13 2.0

The \(KUB\) is a cube. Prove that the ball, \(CIR\), is not a cube. (\(KUB\) and \(CIR\) are three-digit numbers, where different letters denote different numbers).

Problem #PRU-115707

Problems Set theory and logic Mathematical logic Puzzles

11–13 2.0

Can I replace the letters with numbers in the puzzle \(RE \times CTS + 1 = CE \times MS\) so that the correct equality is obtained (different letters need to be replaced by different numbers, and the same letters must correspond to the same digits)?

Problem #PRU-116145

Problems Algebra and arithmetic Algebraic inequalities and systems of inequalities Linear inequalites and systems of inequalities Set theory and logic Logic and set theory

12–14 2.0

Of the four inequalities \(2x > 70\), \(x < 100\), \(4x > 25\) and \(x > 5\), two are true and two are false. Find the value of \(x\) if it is known that it is an integer.

Problem #PRU-116208

Problems Set theory and logic Theory of algotithms Balance puzzles

11–13 2.0

At the vertices of the hexagon \(ABCDEF\) (see Fig.) There were 6 identical balls: at \(A\) – one with mass 1 g, at \(B\) – 2 g, ..., at \(F\) – 6 g. Callum changed the places of two balls in opposite vertices. A set of weighing scales with 2 plates is available, which let you know which plate contains the balls of greater mass. How, in one weighing, can it be determined which balls were rearranged?

Problem #PRU-116278

Problems Methods Examples and counterexamples. Constructive proofs Pigeonhole principle Pigeonhole principle (other)

13–14 4.0

Two ants crawled along their own closed route on a \(7\times7\) board. Each ant crawled only on the sides of the cells of the board and visited each of the 64 vertices of the cells exactly once. What is the smallest possible number of cell edges, along which both the first and second ants crawled?

Problem #PRU-116301

Problems Geometry Plane geometry Geometrical inequalities Area inequalities Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.) Area

13–14 4.0

101 random points are chosen inside a unit square, including on the edges of the square, so that no three points lie on the same straight line. Prove that there exist some triangles with vertices on these points, whose area does not exceed 0.01.

Problem #PRU-116433

Problems Calculus Functions of one variable. Continuity Functions. Continuity (other) Algebra and arithmetic Sequences Progressions Geometric progression

14–16 3.0

The function \(f (x)\) is defined on the positive real \(x\) and takes only positive values. It is known that \(f (1) + f (2) = 10\) and \(f(a+b) = f(a) + f(b) + 2\sqrt{f(a)f(b)}\) for any \(a\) and \(b\). Find \(f (2^{2011})\).

Problem #PRU-116435

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

14–16 3.0

On a chessboard, \(n\) white and \(n\) black rooks are arranged so that the rooks of different colours cannot capture one another. Find the greatest possible value of \(n\).