We solve problems

Problem #PRU-116539

Problems Methods Algebraic methods Partitions into pairs and groups; bijections Pigeonhole principle Pigeonhole principle (other)

13–15 3.0

There are a thousand tickets with numbers 000, 001, ..., 999 and a hundred boxes with the numbers 00, 01, ..., 99. A ticket is allowed to be dropped into a box if the number of the box can be obtained from the ticket number by erasing one of the digits. Is it possible to arrange all of the tickets into 50 boxes?

Problem #PRU-116560

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

14–15 4.0

2011 numbers are written on a blackboard. It turns out that the sum of any of these written numbers is also one of the written numbers. What is the minimum number of zeroes within this set of 2011 numbers?

Problem #PRU-116589

Problems Algebra and arithmetic Number theory. Divisibility Divisibility of a number. General properties Sequences Recurrent relations Linear recurrent relations Calculus Number sequences Number sequences (other)

13–15 3.0

The sequence of numbers \(a_1, a_2, \dots\) is given by the conditions \(a_1 = 1\), \(a_2 = 143\) and

for all \(n \geq 2\).

Prove that all members of the sequence are integers.

Problem #PRU-116627

Problems Algebra and arithmetic Algebraic inequalities and systems of inequalities Algebraic inequalities (other) Polynomials Algebraic identities for polynomials Factoring polynomials Calculus Real numbers Integer and fractional parts. Archimedean property

14–16 3.0

Solve the inequality: \(\lfloor x\rfloor \times \{x\} < x - 1\).

Problem #PRU-116873

Problems Methods Extremal principle Extremal principle (other) Mathematical induction Mathematical induction (other) Algebraic methods Partitions into pairs and groups; bijections Pigeonhole principle Pigeonhole principle (other)

14–15 4.0

We are given \(n+1\) different natural numbers, which are less than \(2n\) (\(n>1\)). Prove that among them there will always be three numbers, where the sum of two of them is equal to the third.

Problem #PRU-116994

Problems Calculus Functions of one variable. Continuity Intermediate value theorem. Connectedness.

14–16 3.0

Let \(x_1, x_2, \dots , x_n\) be some numbers belonging to the interval \([0, 1]\). Prove that on this segment there is a number \(x\) such that \[\frac{1}{n} (|x - x_1| + |x - x_2| + \dots + |x - x_n|) = 1/2.\]

Problem #PRU-21972

Problems Algebra and arithmetic Number theory. Divisibility Division with remainders. Arithmetic of remainders Division with remainder Methods Pigeonhole principle Pigeonhole principle (other)

11–13 2.0

You are given 12 different whole numbers. Prove that it is possible to choose two of these whose difference is divisible by 11.

Problem #PRU-21974

Problems Methods Pigeonhole principle Pigeonhole principle (other)

12–13 2.0

A supermarket received a delivery of 25 crates of apples of 3 different types; each crate contains only one type of apple. Prove that there are at least 9 crates of apples of the same sort in the delivery.

Problem #PRU-21975

Problems Methods Pigeonhole principle Pigeonhole principle (other)

12–13 2.0

In Scotland there are \(m\) football teams containing 11 players each. All of the players met at the airport in order to travel to England for a match. The plane made 10 journeys from Scotland to England, carrying 10 passengers each time. One player also flew to the location of the match by helicopter. Prove that at least one team made it in its entirety to the other country to play the match.

Problem #PRU-21976

Problems Methods Pigeonhole principle Pigeonhole principle (other)

12–13 3.0

You are given 8 different natural numbers that are no greater than 15. Prove that there are three pairs of these numbers whose positive difference is the same.