We solve problems

Problem #PRU-103780

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

11–13 3.0

In any group of 10 children, out of a total of 60 pupils, there will be three who are in the same class. Will it always be the case that amongst the 60 pupils there will be: 1) 15 classmates? 2) 16 classmates?

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-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-21985

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

12–13 3.0

The total age of a group of 7 people is 332 years. Prove that it is possible to choose three members of this group so that the sum of their ages is no less than 142 years.

Problem #PRU-21991

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

11–13 2.0

100 people are sitting around a round table. More than half of them are men. Prove that there are two males sitting opposite one another.

Problem #PRU-22000

Problems Algebra and arithmetic Number theory. Divisibility Divisibility of a number. General properties Methods Algebraic methods Partitions into pairs and groups; bijections Pigeonhole principle Pigeonhole principle (other)

12–13 3.0

You are given 11 different natural numbers that are less than or equal to 20. Prove that it is always possible to choose two numbers where one is divisible by the other.

Problem #PRU-31363

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

12–14 3.0

a) In a group of 4 people, who speak different languages, any three of them can communicate with one another; perhaps by one translating for two others. Prove that it is always possible to split them into pairs so that the two members of every pair have a common language.

b) The same, but for a group of 100 people.

c) The same, but for a group of 102 people.

Problem #PRU-32046

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

11–13 3.0

You are given 25 numbers. The sum of any 4 of these numbers is positive. Prove that the sum of all 25 numbers is also positive.

Problem #PRU-32787

Problems Algebra and arithmetic Number systems Decimal number system Methods Algebraic methods Partitions into pairs and groups; bijections Pigeonhole principle Pigeonhole principle (other)

12–13 3.0

Is it possible to find 57 different two digit numbers, such that no sum of any two of them was equal to 100?

Problem #PRU-34976

Problems Probability and statistics Probability theory Discrete distribution Methods Algebraic methods Partitions into pairs and groups; bijections

12–16 4.0

Two people toss a coin: one tosses it 10 times, the other – 11 times. What is the probability that the second person’s coin showed heads more times than the first?