Found problems: 191
For any set of points $A_1, A_2,...,A_n$ on the plane, one defines $r( A_1, A_2,...,A_n)$ as the radius of the smallest circle that contains all of these points. Prove that if $n \ge 3$, there are indices $i,j,k$ such that $r( A_1, A_2,...,A_n)=r( A_i, A_j,A_k)$
Two circles centers $O$ and $O'$, radii $R$ and $R'$, meet at two points. A variable line $L$ meets the circles at $A, C, B, D$ in that order and $\frac{AC}{AD} = \frac{CB}{BD}$. The perpendiculars from $O$ and $O'$ to $L$ have feet $H$ and $H'$.
Find the locus of $H$ and $H'$.
If $OO'^2 < R^2 + R'^2$, find a point $P$ on $L$ such that $PO + PO'$ has the smallest possible value.
Show that this value does not depend on the position of $L$.
Comment on the case $OO'^2 > R^2 + R'^2$.
What $n$ is the smallest such that “there is a $n$-gon that can be cut into a triangle, a quadrilateral, ..., a $2006$-gon''?
A class has $25$ students. The teacher wants to stock $N$ candies, hold the Olympics and give away all $N$ candies for success in it (those who solve equally tasks should get equally, those who solve less get less, including, possibly, zero candies). At what smallest $N$ this will be possible, regardless of the number of tasks on Olympiad and the student successes?
Let the sum of positive numbers $x_1, x_2, ... , x_n$ be $1$. Let $s$ be the greatest of the numbers $$\left\{\frac{x_1}{1+x_1}, \frac{x_2}{1+x_1+x_2}, ..., \frac{x_n}{1+x_1+...+x_n}\right\}$$
What is the minimal possible $s$? What $x_i $correspond it?
In a circle there are $2019$ plates, on each lies one cake. Petya and Vasya are playing a game. In one move, Petya points at a cake and calls number from $1$ to $16$, and Vasya moves the specified cake to the specified number of
check clockwise or counterclockwise (Vasya chooses the direction each time). Petya wants at least some $k$ pastries to accumulate on one of the plates and Vasya wants to stop him. What is the largest $k$ Petya can succeed?
Given real $a$. Find the least possible area of the rectangle with the sides parallel to the coordinate axes and containing the figure determined by the system of inequalities $$y \le -x^2 \,\,\, and \,\,\, y \ge x^2 - 2x + a$$
Determine the smallest number $n \in Z_+$, which can be written as $n = \Sigma_{a\in A}a^2$, where $A$ is a finite set of positive integers and $\Sigma_{a\in A}a= 2014$.
In other words: what is the smallest positive number which can be written as a sum of squares of different positive integers summing to $2014$?
Given some cards with either "$-1$" or "$+1$" written on the opposite side. You are allowed to choose a triple of cards and ask about the product of the three numbers on the cards. What is the minimal number of questions allowing to determine all the numbers on the cards ...
a) for $30$ cards,
b) for $31$ cards,
c) for $32$ cards.
(You should prove, that you cannot manage with less questions.)
d) Fifty above mentioned cards are lying along the circumference. You are allowed to ask about the product of three consecutive numbers only. You need to determine the product af all the $50$ numbers. What is the minimal number of questions allowing to determine it?
Given that $a_1, a_2, . . . , a_n$ are nonnegative real numbers with $a_1 + \cdots + a_n = 1$, prove that the expression
$$ \frac{a_1}{1+a_2 +a_3 +\cdots +a_n }\; +\; \frac{a_2}{1+a_1 +a_3 +\cdots +a_n }\; +\; \cdots \; +\, \frac{a_n }{1+a_1 +a_2+\cdots +a_{n-1} }$$
attains its minimum, and determine this minimum.
* Given $\vartriangle ABC$, divide it into the minimal number of parts so that after being flipped over these parts can constitute the same $\vartriangle ABC$.
Determine the minimum value of the expression $2x^4 - 2x^2y^2 + y^4 - 8x^2 + 18$ where $x, y \in R$.
Through a point $M$ inside an angle $a$ line is drawn. It cuts off this angle a triangle of the least possible area. Prove that $M$ is the midpoint of the segment on this line that the angle intercepts.
Consider sequences $a_1, a_2, a_3,...$ of positive integers. Determine the smallest possible value of $a_{2010}$ if
(i) $a_n < a_{n+1}$ for all $n\ge 1$,
(ii) $a_i + a_l > a_j + a_k$ for all quadruples $ (i, j, k, l)$ which satisfy $1 \le i < j \le k < l$.
A square is subdivided into $K^2$ equal smaller squares. We are given a broken line which passes through the centres of all the smaller squares (such a broken line may intersect itself). Find the minimum number of links in this broken line.
(A Andjans, Riga)
For each positive integer $n$, let $S(n)$ be the sum of the digits of $n$. Determines the smallest positive integer $a$ such that there are infinite positive integers $n$ for which you have $S (n) -S (n + a) = 2018$.
Given equilateral triangle with the side $l$. What is the minimal length $d$ of a brush (segment), that will paint all the triangle, if its ends are moving along the sides of the triangle.
Inside the circle with center $O$, points $A$ and $B$ are marked so that $OA = OB$. Draw a point $M$ on the circle from which the sum of the distances to points $A$ and $B$ is the smallest among all possible.
A rectangle is divided into $n^2$ smaller rectangle by $n - 1$ horizontal lines and $n - 1$ vertical lines. Between those rectangles there are exactly $5660$ which are not congruent. For what minimum value of $n$ is this possible?
Suppose we have two identical cardboard polygons. We placed one polygon upon the other one and aligned. Then we pierced polygons with a pin at a point. Then we turned one of the polygons around this pin by $25^o 30'$. It turned out that the polygons coincided (aligned again). What is the minimal possible number of sides of the polygons?
Let $n$ and $k$ be positive integers such that $1 \leq n \leq N+1$, $1 \leq k \leq N+1$. Show that: \[ \min_{n \neq k} |\sin n - \sin k| < \frac{2}{N}. \]
A box contains $900$ cards, labeled from $100$ to $999$. Cards are removed one at a time without replacement. What is the smallest number of cards that must be removed to guarantee that the labels of at least three removed cards have equal sums of digits?
For a natural number $b$, let $N(b)$ denote the number of natural numbers $a$ for which the equation $x^2 + ax + b = 0$ has integer roots. What is the smallest value of $b$ for which $N(b) = 20$?
Positive integers $x, y, z$ satisfy $xy + z = 160$. Compute the smallest possible value of $x + yz$.
$X$ is a set with $100$ members. What is the smallest number of subsets of $X$ such that every pair of elements belongs to at least one subset and no subset has more than $50$ members? What is the smallest number if we also require that the union of any two subsets has at most $80$ members?