A square area of size \(100\times 100\) is covered in tiles of size \(1\times 1\) in 4 different colours – white, red, black, and grey. No two tiles of the same colour touch one another, that is share a side or a corner. How many red tiles can there be?
One corner square was cut from a chessboard. What is the smallest number of equal triangles that can be cut into this shape?
In each square of a rectangular table of size \(M \times K\), a number is written. The sum of the numbers in each row and in each column, is 1. Prove that \(M = K\).
Reception pupil Peter knows only the number 1. Prove that he can write a number divisible by 1989.
101 points are marked on a plane; not all of the points lie on the same straight line. A red pencil is used to draw a straight line passing through each possible pair of points. Prove that there will always be a marked point on the plane through which at least 11 red lines pass.
Is it possible to find 57 different two digit numbers, such that no sum of any two of them was equal to 100?
A professional tennis player plays at least one match each day for training purposes. However in order to ensure he does not over-exert himself he plays no more than 12 matches a week. Prove that it is possible to find a group of consecutive days during which the player plays a total of 20 matches.
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.
A road of length 1 km is lit with streetlights. Each streetlight illuminates a stretch of road of length 1 m. What is the maximum number of streetlights that there could be along the road, if it is known that when any single streetlight is extinguished the street will no longer be fully illuminated?