Initially, on each cell of a \(1 \times n\) board a checker is placed. The first move allows you to move any checker onto an adjacent cell (one of the two, if the checker is not on the edge), so that a column of two pieces is formed. Then one can move each column in any direction by as many cells as there are checkers in it (within the board); if the column is on a non-empty cell, it is placed on a column standing there and unites with it. Prove that in \(n - 1\) moves you can collect all of the checkers on one square.
Elephants, rhinoceroses, giraffes. In all zoos where there are elephants and rhinoceroses, there are no giraffes. In all zoos where there are rhinoceroses and there are no giraffes, there are elephants. Finally, in all zoos where there are elephants and giraffes, there are also rhinoceroses. Could there be a zoo in which there are elephants, but there are no giraffes and no rhinoceroses?
Several natives of an island met up (each either a liar or a knight), and everyone said to everyone else: “You are all liars.” How many knights were there among them?
Inside a square with side 1 there are several circles, the sum of the radii of which is 0.51. Prove that there is a line that is parallel to one side of the square and that intersects at least 2 circles.
The seller with weights. With four weights the seller can weigh any integer number of kilograms, from 1 to 40 inclusive. The total mass of the weights is 40 kg. What are the weights available to the seller?
The cells of a \(15 \times 15\) square table are painted red, blue and green. Prove that there are two lines which at least have the same number of cells of one colour.
Cutting into four parts. Cut each of the figures below into four equal parts (you can cut along the sides and diagonals of cells).
We are looking for the correct statement. In a notebook one hundred statements are written:
1) There is exactly one false statement in this notebook.
2) There are exactly two false statements in this notebook.
...
100) There are exactly one hundred false statements in this notebook.
Which of these statements is true, if it is known that only one is true?
Solve the rebus \(AC \times CC \times K = 2002\) (different letters correspond to different integers and vice versa).
Can the equality \(K \times O \times T\) = \(U \times W \times E \times H \times S \times L\) be true if instead of the letters in it we substitute integers from 1 to 9 (different letters correspond to different numbers)?