We solve problems

Problem #PRU-98170

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

10–14 4.0

Ben noticed that all 25 of his classmates have a different number of friends in this class. How many friends does Ben have?

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

Problems Methods Algebraic methods Counting in two ways Extremal principle Extremal principle (other) Pigeonhole principle Pigeonhole principle (other)

12–14 3.0

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.

Problem #PRU-103882

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

11–12 2.0

Find the smallest four-digit number \(CEEM\) for which there exists a solution to the rebus \(MN + PORG = CEEM\). (The same letters correspond to the same numbers, different – different.)

Problem #PRU-103888

Problems Methods Algebraic methods Proof by exhaustion Geometry Solid geometry Visual geometry in space

11–12 2.0

A square napkin was folded in half, the resulting rectangle was then folded in half again (see the figure). The resulting square was then cut with scissors (in a straight line). Could the napkin have been broken up a) into 2 parts? b) into 3 parts? c) into 4 parts? d) into 5 parts? If yes – illustrate such a cut, if not – write the word “no”.

Problem #PRU-109937

Problems Methods Invariants and semi-invariants Invariants Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.) Algebraic methods Processes and operations Proof by exhaustion

14–16 4.0

We are given a table of size \(n \times n\). \(n-1\) of the cells in the table contain the number \(1\). The remainder contain the number \(0\). We are allowed to carry out the following operation on the table:

1. Pick a cell.

2. Subtract 1 from the number in that cell.

3. Add 1 to every other cell in the same row or column as the chosen cell.

Is it possible, using only this operation, to create a table in which all the cells contain the same number?

Problem #PRU-110920

Problems Methods Pigeonhole principle Pigeonhole principle (other) Algebraic methods Proof by exhaustion

11–13 2.0

Peter has some coins in his pocket. If Peter pulls \(3\) coins from his pocket, without looking, there will always be a £1 coin among them. If Peter pulls \(4\) coins from his pocket, without looking, there will always be a £2 coin among them. Peter pulls \(5\) coins from his pocket. Identify these coins.

Problem #PRU-115489

Problems Set theory and logic Mathematical logic Mathematical logic (other) Methods Algebraic methods Proof by exhaustion

10–12 2.0

One day, Claudia, Sofia and Freia noticed that they brought the same toy cars to kindergarten. Claudia has a car with a trailer, a small car and a green car without a trailer. Sofia has a car without a trailer and a small green one with a trailer, and Freia has a big car and a small blue car with a trailer. What kind of car (in terms of colour, size and availability of a trailer) did all of the girls bring to the kindergarten? Explain the answer.

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