Prove that the following facts are true for any graph:
a) The sum of degrees of all vertices is equal to twice the number of edges (and therefore it is even);
b) The number of vertices of odd degree is even.
When Gulliver came to Lilliput, he found that everything was exactly 12 times shorter than in his homeland. Can you say how many Lilliputian matchboxes fit into the matchbox of Gulliver?
A three-digit number \(ABB\) is given, the product of the digits of which is a two-digit number \(AC\) and the product of the digits of this number is \(C\) (here, as in mathematical puzzles, the digits in the numbers are replaced by letters where the same letters correspond to the same digits and different letters to different digits). Determine the original number.
Try to find all natural numbers which are five times greater than their last digit.
There is a 12-litre barrel filled with beer, and two empty kegs of 5 and 8 litres. Try using these kegs to:
a) divide the beer into two parts of 3 and 9 litres;
b) divide the beer into two equal parts.
A girl chose a 4-letter word and replaced each letter with the corresponding number in the alphabet. The number turned out to be 2091425. What word did she choose?
One three-digit number consists of different digits that are in ascending order, and in its name all words begin with the same letter. The other three-digit number, on the contrary, consists of identical digits, but in its name all words begin with different letters. What are these numbers?
Replace the question marks with the appropriate letters or words:
a) r, o, y, g, b, ?, ?;
b) a, c, f, j, ?, ?;
c) one, three, five, ?,
d) A, H, I, M, O, T, U, ?, ?, ?, ?;
e) o, t, t, f, f, s, s, e, ?, ?.
A traveller rents a room in an inn for a week and offers the innkeeper a chain of seven silver links as payment – one link per day, with the condition that they will be payed everyday. The innkeeper agrees, with the condition that the traveller can only cut one of the links. How did the traveller manage to pay the innkeeper?
There are five chain links with 3 rings in each. What is the smallest number of rings that need to be unhooked and hooked together to connect these links into one chain?