When cleaning her children’s room, a mother found \(9\) socks. In a group of any \(4\) of the socks at least two belonged to the same child. In a group of any \(5\) of the socks no more than \(3\) had the same owner. How many children are there in the room and how many socks belong to each child?
In the family of happy gnomes there is a father, a mother and a child. The names of the family members: Alex, Charlie and Jo. At the dinner table two gnomes made two statements.
Charlie said: “Alex and Jo are of different genders. Alex and Charlie are my parents”.
Alex said: “I am Jo’s father. I am the daughter of Charlie”.
Who is who? That is, what is the name of the father, the mother and the child, if it is known that each gnome lied once, and each told the truth once.
On the first day of school, in all three of the first year classes (1A, 1B, 1C), there were three lessons: Maths, French and Biology. Two classes cannot have the same lesson at the same time. 1B’s first lesson was Maths. The Biology teacher praised the students in 1B: “You have even better marks than 1A”. 1A’s second lesson was not French. Which class’s last lesson was Biology?
A bag contains balls of two different colours – black and white. What is the minimum number of balls you need to remove, without looking, to guarantee that within the removed balls at least two are the same colour.
A forest contains a million fir trees. It is known that any given tree has at most 600,000 needles. Prove that there will be two trees with the same number of needles.
You are given 12 different whole numbers. Prove that it is possible to choose two of these whose difference is divisible by 11.
Prove that in any group of 5 people there will be two who know the same number of people in that group.
Several football teams are taking part in a football tournament, where each team plays every other team exactly once. Prove that at any point in the tournament there will be two teams who have played exactly the same number of matches up to that point.
10 school students took part in a Mathematical Olympiad and solved 35 problems in total. It is known that there were students who solved exactly one problem, students who solved exactly two problems, and students who solved exactly three problems. Prove that there is a student who solved exactly 5 problems.
What is the maximum number of kings you could place on a chess board such that no two of them were attacking each other – that is, no two kings are on horizontally, vertically, or diagonally adjacent squares. Kings can move in any direction, but only one square at a time.