What is the maximum number of kings, that cannot capture each other, which can be placed on a chessboard of size \(8 \times 8\) cells?
On a table, there are five coins lying in a row: the middle one lies with a head facing upwards, and the rest lie with the tails side up. It is allowed to simultaneously flip three adjacent coins. Is it possible to make all five coins positioned with the heads side facing upwards with the help of several such overturns?
Three hedgehogs divided three pieces of cheese of mass of 5g, 8g and 11g. The fox began to help them. It can cut off and eat 1 gram of cheese from any two pieces at the same time. Can the fox leave the hedgehogs equal pieces of cheese?
A rectangle is cut into several smaller rectangles, the perimeter of each of which is an integer number of meters. Is it true that the perimeter of the original rectangle is also an integer number of meters?
Eight schoolchildren solved \(8\) tasks. It turned out that \(5\) schoolchildren solved each problem. Prove that there are two schoolchildren, who solved every problem at least once.
If each problem is solved by \(4\) pupils, prove that it is not necessary to have two schoolchildren who would solve each problem.
Is it possible to draw five lines from one point on a plane so that there are exactly four acute angles among the angles formed by them? Angles between not only neighboring rays, but between any two rays, can be considered.
A country is called a Fiver if, in it, each city is connected by airlines with exactly with five other cities (there are no international flights).
a) Draw a scheme of airlines for a country that is made up of 10 cities.
b) How many airlines are there in a country of 50 cities?
c) Can there be a Fiver country, in which there are exactly 46 airlines?
100 fare evaders want to take a train, consisting of 12 coaches, from the first to the 76th station. They know that at the first station two ticket inspectors will board two coaches. After the 4th station, in the time between each station, one of the ticket inspectors will cross to a neighbouring coach. The ticket inspectors take turns to do this. A fare evader can see a ticket inspector only if the ticket inspector is in the next coach or the next but one coach. At each station each fare evader has time to run along the platform the length of no more than three coaches – for example at a station a fare evader in the 7th coach can run to any coach between the 4th and 10th inclusive and board it. What is the largest number of fare evaders that can travel their entire journey without ever ending up in the same coach as one of the ticket inspectors, no matter how the ticket inspectors choose to move? The fare evaders have no information about the ticket inspectors beyond that which is given here, and they agree their strategy before boarding.
What weights can three weights have so that they can weigh any integer number of kilograms from 1 to 10 on weighing scales (weights can be put on both cups)? Give an example.
Find the largest number of colours in which you can paint the edges of a cube (each edge with one colour) so that for each pair of colours there are two adjacent edges coloured in these colours. Edges are considered to be adjacent if they have a common vertex.