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.
Prove that if the expression
takes a rational value, then the expression
also takes on a rational value.
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.
Does there exist a real number \({\alpha}\) such that the number \(\cos {\alpha}\) is irrational, and all the numbers \(\cos 2{\alpha}\), \(\cos 3{\alpha}\), \(\cos 4{\alpha}\), \(\cos 5{\alpha}\) are rational?
Solve the inequality: \(\lfloor x\rfloor \times \{x\} < x - 1\).
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?
Prove that a graph with \(n\) vertices, the degree of each of which is at least \(\frac{n-1}{2}\), is connected.
In the Far East, the only type of transport is a carpet-plane. From the capital there are 21 carpet-planes, from the city of Dalny there is one carpet-plane, and from all of the other cities there are 20. Prove that you can fly from the capital to Dalny (possibly with interchanges).