The volume of the regular quadrangular pyramid \(SABCD\) is equal to \(V\). The height \(SP\) of the pyramid is the edge of the regular tetrahedron \(SPQR\), the plane of the face \(PQR\) which is perpendicular to the edge \(SC\). Find the volume of the common part of these pyramids.
The height \(SO\) of a regular quadrilateral pyramid \(SABCD\) forms an angle \(\alpha\) with a side edge and the volume of this pyramid is equal to \(V\). The vertex of the second regular quadrangular pyramid is at the point \(S\), the centre of the base is at the point \(C\), and one of the vertices of the base lies on the line \(SO\). Find the volume of the common part of these pyramids.
In 10 boxes there are pencils (there are no empty boxes). It is known that in different boxes there is a different number of pencils, and in each box, all pencils are of different colors. Prove that from each box you can choose a pencil so that they will all be of different colors.
100 queens, that cannot capture each other, are placed on a \(100 \times 100\) chessboard. Prove that at least one queen is in each \(50 \times 50\) corner square.
The quadratic trinomials \(f (x)\) and \(g (x)\) are such that \(f' (x) g' (x) \geq | f (x) | + | g (x) |\) for all real \(x\). Prove that the product \(f (x) g (x)\) is equal to the square of some trinomial.
In 25 boxes there are spheres of different colours. It is known that for any \(k\) where \(1 \leq k \leq 25\) in any \(k\) of the boxes there are spheres of exactly \(k+1\) different colours. Prove that a sphere of one particular colour lies in every single box.
The sequence \((a_n)\) is given by the conditions \(a_1 = 1000000\), \(a_{n + 1} = n \lfloor a_n/n\rfloor + n\). Prove that an infinite subsequence can be found within it, which is an arithmetic progression.
Given a square trinomial \(f (x) = x^2 + ax + b\). It is known that for any real \(x\) there exists a real number \(y\) such that \(f (y) = f (x) + y\). Find the greatest possible value of \(a\).
In the infinite sequence \((x_n)\), the first term \(x_1\) is a rational number greater than 1, and \(x_{n + 1} = x_n + \frac{1}{\lfloor x_n\rfloor }\) for all positive integers \(n\).
Prove that there is an integer in this sequence.
Note that in this problem, square brackets represent integers and curly brackets represent non-integer values or 0.
When water is drained from a pool, the water level \(h\) in it varies depending on the time \(t\) according to the function \(h (t) = at^2 + bt + c\), and at the time \(t_0\) of when the draining is ending, the equalities \(h (t_0) = h' (t_0) = 0\) are satisfied. For how many hours does the pool drain completely, if in the first hour the water level in it is reduced by half?