Note that if you turn over a sheet on which numbers are written, then the digits 0, 1, 8 will not change and the digits 6 and 9 will switch places, whilst the others will lose their meaning. How many nine-digit numbers exist that do not change when a sheet is turned over?
In order to encrypt telegraph signals it is necessary to divide every possible 10 character ‘word’ – an arrangement of 10 dots and dashes – into two groups, so that any two words in the same group differed by no fewer than three characters. Find a method of doing this or prove that no such method exists.
A White Rook pursues a black bishop on a board of \(3 \times 1969\) cells (they walk in turn according to the usual rules). How should the rook play to take the bishop? White makes the first move.
Izzy wrote a correct equality on the board: \(35 + 10 - 41 = 42 + 12 - 50\), and then subtracted 4 from both parts: \(35 + 10 - 45 = 42 + 12 - 54\). She noticed that on the left hand side of the equation all of the numbers are divisible by 5, and on the right hand side by 6. Then she took 5 outside of the brackets on the left hand side and 6 on the right hand side and got \(5(7 + 2 - 9)4 = 6(7 + 2 - 9)\). Having simplified both sides by a common multiplier, Izzy found that \(5 = 6\). Where did she go wrong?
A moth has made \(15\) little holes on a carpet of size \(4\text{m}\times 4\text{m}\). Is it possible to cut out a \(1\text{m}\times 1\text{m}\) square of the carpet that contains no holes? (The holes are assumed to be points)
Prove that in any group of 2001 whole numbers there will be two whose difference is divisible by 2000.
The natural number \(a\) was increased by 1, and its square increased by 1001. What is \(a\)?
In a basket, there are 30 red and green apples. Among any 12 apples there is at least one red one, and among any 20 apples there is at least one green one. How many red apples and how many green apples are there in the basket?
Does there exist a flat quadrilateral in which the tangents of all interior angles are equal?
On an island there are 1,234 residents, each of whom is either a knight (who always tells the truth) or a liar (who always lies). One day, all of the inhabitants of the island were broken up into pairs, and each one said: “He is a knight!" or “He is a liar!" about his partner. Could it eventually turn out to be that the number of “He is a knight!" and “He is a liar!" phrases is the same?