Given an endless piece of chequered paper with a cell side equal to one. The distance between two cells is the length of the shortest path parallel to cell lines from one cell to the other (it is considered the path of the center of a rook). What is the smallest number of colors to paint the board (each cell is painted with one color), so that two cells, located at a distance of 6, are always painted with different colors?
A group of numbers \(A_1, A_2, \dots , A_{100}\) is created by somehow re-arranging the numbers \(1, 2, \dots , 100\).
100 numbers are created as follows: \[B_1=A_1,\ B_2=A_1+A_2,\ B_3=A_1+A_2+A_3,\ \dots ,\ B_{100} = A_1+A_2+A_3\dots +A_{100}.\]
Prove that there will always be at least 11 different remainders when dividing the numbers \(B_1, B_2, \dots , B_{100}\) by 100.
a) We are given two cogs, each with 14 teeth. They are placed on top of one another, so that their teeth are in line with one another and their projection looks like a single cog. After this 4 teeth are removed from each cog, the same 4 teeth on each one. Is it always then possible to rotate one of the cogs with respect to the other so that the projection of the two partially toothless cogs appears as a single complete cog? The cogs can be rotated in the same plane, but cannot be flipped over.
b) The same question, but this time two cogs of 13 teeth each from which 4 are again removed?
An after school club was attended by 60 pupils. It turns out that in any group of 10 there will always be 3 classmates. Prove that within the group of 60 who attended there will always be at least 15 pupils from the same class.
Some points with integer co-ordinates are marked on a Cartesian plane. It is known that no four points lie on the same circle. Prove that there will be a circle of radius 1995 in the plane, which does not contain a single marked point.
The surface of a \(3\times 3\times 3\) Rubik’s Cube contains 54 squares. What is the maximum number of squares we can mark, so that no marked squares share a vertex or are directly adjacent to another marked square?
The function \(f\) is such that for any positive \(x\) and \(y\) the equality \(f (xy) = f (x) + f (y)\) holds. Find \(f (2007)\) if \(f (1/2007) = 1\).
We are given a \(100\times 100\) square grid and \(N\) counters. All of the possible arrangements of the counters on the grid which follow the following rule are considered: no two counters lie in adjacent squares.
What is the largest value of \(N\) for which, in every single possible arrangement of counters following this rule, it is possible to find at least one counter such that moving it to an adjacent square does not break the rule. Squares are considered adjacent if they share a side.
On a particular day it turned out that every person living in a particular city made no more than one phone call. Prove that it is possible to divide the population of this city into no more than three groups, so that within each group no person spoke to any other by telephone.
We are given a table of size \(n \times n\). \(n-1\) of the cells in the table contain the number \(1\). The remainder contain the number \(0\). We are allowed to carry out the following operation on the table:
1. Pick a cell.
2. Subtract 1 from the number in that cell.
3. Add 1 to every other cell in the same row or column as the chosen cell.
Is it possible, using only this operation, to create a table in which all the cells contain the same number?