A car registration number consists of three letters of the Russian alphabet (that is, 30 letters are used) and three digits: first we have a letter, then three digits followed by two more letters. How many different car registration numbers are there?
An endless board is painted in three colours (each cell is painted in one of the colours). Prove that there are four cells of the same colour, located at the vertices of the rectangle with sides parallel to the side of one cell.
There are 17 carriages in a passenger train. How many ways can you arrange 17 conductors around the carriages if one conductor has to be in each carriage?
How many ways can you choose four people for four different positions, if there are nine candidates for these positions?
Out of two mathematicians and ten economists, it is necessary to form a committee made up of eight people. In how many ways can a committee be formed if it has to include at least one mathematician?
There are \(n\) points on the plane. How many lines are there with endpoints at these points?
On a plane \(n\) randomly placed lines are given. What is the number of triangles formed by them?
On two parallel lines \(a\) and \(b\), the points \(A_1, A_2, \dots , A_m\) and \(B_1, B_2, \dots , B_n\) are chosen, respectively, and all of the segments of the form \(A_iB_j\), where \(1 \leq i \leq m\), \(1 \leq j \leq n\). How many intersection points will there be if it is known that no three of these segments intersect at one point?
Find \(m\) and \(n\) knowing the relation \(\binom{n+1}{m+1}: \binom{n+1}{m}:\binom{n+1}{m-1} = 5:5:3\).
\(N\) points are given, no three of which lie on one line. Each two of these points are connected by a segment, and each segment is coloured in one of the \(k\) colours. Prove that if \(N > \lfloor k!e\rfloor\), then among these points one can choose three such that all sides of the triangle formed by them will be colored in one colour.