Three non-coplanar vectors are given. Is it possible to find a fourth vector perpendicular to the three vectors given?
Find the volume of an inclined triangular prism whose base is an equilateral triangle with sides equal to a if the side edge of the prism is equal to the side of the base and is inclined to the plane of the base at an angle of \(60^{\circ}\).
Prove that the following facts are true for any graph:
a) The sum of degrees of all vertices is equal to twice the number of edges (and therefore it is even);
b) The number of vertices of odd degree is even.
48 blacksmiths must shoe 60 horses. Each blacksmith spends 5 minutes on one horseshoe. What is the shortest time they should spend on the work? (Note that a horse can not stand on two legs.)
Is the sum of the numbers \(1 + 2 + 3 + \dots + 1999\) divisible by 1999?
A schoolboy told his friend Bob:
“We have thirty-five people in the class. And imagine, each of them is friends with exactly eleven classmates...”
“It cannot be,” Bob, the winner of the mathematical Olympiad, answered immediately. Why did he decide this?
This problem is from Ancient Rome.
A rich senator died, leaving his wife pregnant. After the senator’s death it was found out that he left a property of 210 talents (an Ancient Roman currency) in his will as follows: “In the case of the birth of a son, give the boy two thirds of my property (i.e. 140 talents) and the other third (i.e. 70 talents) to the mother. In the case of the birth of a daughter, give the girl one third of my property (i.e. 70 talents) and the other two thirds (i.e. 140 talents) to the mother.”
The senator’s widow gave birth to twins: one boy and one girl. This possibility was not foreseen by the late senator. How can the property be divided between three inheritors so that it is as close as possible to the instructions of the will?
Prove that for every natural number \(n > 1\) the equality: \[\lfloor n^{1 / 2}\rfloor + \lfloor n^{1/ 3}\rfloor + \dots + \lfloor n^{1 / n}\rfloor = \lfloor \log_{2}n\rfloor + \lfloor \log_{3}n\rfloor + \dots + \lfloor \log_{n}n\rfloor\] is satisfied.
\(a_1, a_2, a_3, \dots\) is an increasing sequence of natural numbers. It is known that \(a_{a_k} = 3k\) for any \(k\). Find a) \(a_{100}\); b) \(a_{2022}\).
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?