\(N\) young men and \(N\) young ladies gathered on the dance floor. How many ways can they split into pairs in order to participate in the next dance?
Prove that the product of any three consecutive natural numbers is divisible by 6.
Prove that \(n^2 + 1\) is not divisible by \(3\) for any natural \(n\).
Prove there are no natural numbers \(a\) and \(b\), such as \(a^2 - 3b^2 = 8\).
The board has the form of a cross, which is obtained if corner boxes of a square board of \(4 \times 4\) are erased. Is it possible to go around it with the help of the knight chess piece and return to the original cell, having visited all the cells exactly once?
There are 30 people in the class. Can it be that 9 of them have 3 friends (in this class), 11 have 4 friends, and 10 have 5 friends?
In the city Smallville there are 15 telephones. Can they be connected by wires so that there are four phones, each of which is connected to three others, eight phones, each of which is connected to six, and three phones, each of which is connected to five others?
A king divided his kingdom into 19 counties who are governed by 19 lords. Could it be that each lord’s county has one, five or nine neighbouring counties?
John, coming back from Disneyland, told me that there are seven islands on the enchanted lake, each of which is lead to by one, three or five bridges. Is it true that at least one of these bridges necessarily leads to the shore of the lake?
Prove that the number of people who have ever lived on Earth and who shook hands an odd number of times is even.