Cut an arbitrary triangle into 3 parts and out of these pieces construct a rectangle.
Fill an ordinary chessboard with the tiles shown in the figure.
Suppose that \(n \geq 3\). Are there n points that do not lie on one line, whose pairwise distances are irrational, and the areas of all of the triangles with vertices in them are rational?
Do there exist three points \(A\), \(B\) and \(C\) on the plane such that for any point \(X\) the length of at least one of the segments \(XA\), \(XB\) and \(XC\) is irrational?
Ten circles are marked on the circle. How many non-closed non-self-intersecting nine-point broken lines exist with vertices at these points?
From the set of numbers 1 to \(2n\), \(n + 1\) numbers are chosen. Prove that among the chosen numbers there are two, one of which is divisible by another.
a) In Wonderland, there are three cities \(A\), \(B\) and \(C\). 6 roads lead from city \(A\) to city \(B\), and 4 roads lead from city \(B\) to city \(C\). How many ways can you travel from \(A\) to \(C\)?
b) In Wonderland, another city \(D\) was built as well as several new roads – two from \(A\) to \(D\) and two from \(D\) to \(C\). In how many ways can you now get from city \(A\) to city \(C\)?
How many distinct seven-digit numbers exist? It is assumed that the first digit cannot be zero.
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?
How many are there six-digit numbers that are divisible by \(5\)?