Problems

Age
Difficulty
Found: 86

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.

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.

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.

On the plane coordinate axes with the same but not stated scale and the graph of the function \(y = \sin x\), \(x\) \((0; \alpha)\) are given.

How can you construct a tangent to this graph at a given point using a compass and a ruler if: a) \(\alpha \in (\pi /2; \pi)\); b) \(\alpha \in (0; \pi /2)\)?

The sequence \(a_1, a_2, \dots\) is such that \(a_1 \in (1,2)\) and \(a_{k + 1} = a_k + \frac{k}{a_k}\) for any positive integer \(k\). Prove that it cannot contain more than one pair of terms with an integer sum.The sequence \(a_1, a_2, \dots\) is such that \(a_1 \in (1,2)\) and \(a_{k + 1} = a_k + \frac{k}{a_k}\) for any positive integer \(k\). Prove that it cannot contain more than one pair of terms with an integer sum.

The nonzero numbers \(a\), \(b\), \(c\) are such that every two of the three equations \(ax^{11} + bx^4 + c = 0\), \(bx^{11} + cx^4 + a = 0\), \(cx^{11} + ax^4 + b = 0\) have a common root. Prove that all three equations have a common root.

The teacher wrote on the board in alphabetical order all possible \(2^n\) words consisting of \(n\) letters A or B. Then he replaced each word with a product of \(n\) factors, correcting each letter A by \(x\), and each letter B by \((1 - x)\), and added several of the first of these polynomials in \(x\). Prove that the resulting polynomial is either a constant or increasing function in \(x\) on the interval \([0, 1]\).

The board has the form of a cross, which is obtained if corner boxes of a square board of \(4 \times 4\) are erased. Is it possible to go around it with the help of the knight chess piece and return to the original cell, having visited all the cells exactly once?