Problems

Age
Difficulty
Found: 300

11 scouts are working on 5 different badges. Prove that there will be two scouts \(A\) and \(B\), such that every badge that \(A\) is working towards is also being worked towards by \(B\).

How many different four-digit numbers, divisible by 4, can be made up of the digits 1, 2, 3 and 4,

a) if each number can occur only once?

b) if each number can occur several times?

Each of the 102 pupils of one school is friends with at least 68 others. Prove that among them there are four who have the same number of friends.

Each of the edges of a complete graph consisting of 6 vertices is coloured in one of two colours. Prove that there are three vertices, such that all the edges connecting them are the same colour.

There are 100 notes of two types: \(a\) and \(b\) pounds, and \(a \neq b \pmod {101}\). Prove that you can select several bills so that the amount received (in pounds) is divisible by 101.

If a class of 30 children is seated in the auditorium of a cinema there will always be at least one row containing no fewer than two classmates. If we do the same with a class of 26 children then at least three rows will be empty. How many rows are there in the cinema?