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.
a) A piece of wire that is 120 cm long is given. Is it possible, without breaking the wire, to make a cube frame with sides of 10 cm?
b) What is the smallest number of times it will be necessary to break the wire in order to still produce the required frame?
Let \(p\) be a prime number, and \(a\) an integer number not divisible by \(p\). Prove that there is a positive integer \(b\) such that \(ab \equiv 1 \pmod p\).
30 people vote on five proposals. In how many ways can the votes be distributed if everyone votes only for one proposal and only the number of votes cast for each proposal is taken into account?
Prove that there is a vertex in the tree from which exactly one edge emerges (such a vertex is called a hanging top).
At a conference there are 50 scientists, each of whom knows at least 25 other scientists at the conference. Prove that is possible to seat four of them at a round table so that everyone is sitting next to people they know.
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.
Prove that the number of US states with an odd number of neighbours is even.
a) What is the minimum number of pieces of wire needed in order to weld a cube’s frame?
b) What is the maximum length of a piece of wire that can be cut from this frame? (The length of the edge of the cube is 1 cm).
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.