Found problems: 155
Given two intersecting planes $\alpha$ and $\beta$ and a point $A$ on the line of their intersection. Prove that of all lines belonging to $\alpha$ and passing through $A$ the line which is perpendicular to the intersection line of $\alpha$ and $\beta$ forms the greatest angle with $\beta$.
There are $9$ cards with the numbers $1, 2, 3, 4, 5, 6, 7, 8$ and $9$. What is the largest number of these cards can be decomposed in a certain order in a row, so that in any two adjacent cards, one of the numbers is divided by the other?
The base of a pyramid is a regular triangle having side of size $1$. Two of three angles at the vertex of the pyramid are right. Find the maximum value of the volume of the pyramid.
Two players play alternately. The first player is given a pair of positive integers $(x_1, y_1)$. Each player must replace the pair $(x_n, y_n)$ that he is given by a pair of non-negative integers $(x_{n+1}, y_{n+1})$ such that $x_{n+1} = min(x_n, y_n)$ and $y_{n+1} = max(x_n, y_n)- k\cdot x_{n+1}$ for some positive integer $k$. The first player to pass on a pair with $y_{n+1} = 0$ wins. Find for which values of $x_1/y_1$ the first player has a winning strategy.
Given regular pentagon $ABCDE$. $M$ is an arbitrary point inside $ABCDE$ or on its side. Let the distances $|MA|, |MB|, ... , |ME|$ be renumerated and denoted with $$r_1\le r_2\le r_3\le r_4\le r_5.$$ Find all the positions of the $M$, giving $r_3$ the minimal possible value. Find all the positions of the $M$, giving $r_3$ the maximal possible value.