Found problems: 191
Find the smallest real number $x$ for which exist two non-congruent triangles, whose sides have integer lengths and the numerical value of the area of each triangle is $x$.
Given a $\triangle ABC$, determine which is the circle with the smallest area that contains it.
Let $ABC$ be an acute triangle. A line, parallel to $BC$, intersects sides $AB$ and $AC$ at points $M$ and $P$, respectively. At which placement of points $M$ and $P$, is the radius of the circumcircle of the triangle $BMP$ is the smallest?
Find the smallest value of the expression $|3 \cdot 5^m - 11 \cdot 13^n|$ for all $m,n \in N$.
(Folklore)
What is the smallest positive integer $k$ such that $k(3^3 + 4^3 + 5^3) = a^n$ for some positive integers $a$ and $n$, with $n > 1$?
In three houses $A,B$ and $C$, forming a right triangle with the legs $AC=30$ and $CB=40$, live three beetles $a,b$ and $c$, capable of moving at speeds of $2, 3$ and $4$, respectively. Suppose that you simultaneously release these bugs from point $M$ and mark the time after which beetles reach their homes. Find on the plane such a point $M$, where is the last time to reach the house a bug would be minimal.
Given two circles with the radiuses $R$ and $r$, touching each other from the outer side. Consider all the trapezoids, such that its lateral sides touch both circles, and its bases touch different circles. Find the shortest possible lateral side.
An ant, which is on an edge of a cube of side $8$, must travel on the surface and return to the starting point. It's path must contain interior points of the six faces of the cube and should visit only once each face of the cube. Find the length of the path that the ant can carry out and justify why it is the shortest path.
Into an angle $A$ of size $a$, a circle is inscribed tangent to its sides at points $B$ and $C$. A line tangent to this circle at a point M meets the segments $AB$ and $AC$ at points $P$ and $Q$ respectively. What is the minimum $a$ such that the inequality $S_{PAQ}<S_{BMC}$ is possible?
Find the smallest real constant $p$ for which the inequality holds $\sqrt{ab}- \frac{2ab}{a + b} \le p \left( \frac{a + b}{2} -\sqrt{ab}\right)$ with any positive real numbers $a, b$.
For an integer $n \ge 1$ we consider sequences of $2n$ numbers, each equal to $0, -1$ or $1$. The [i]sum product value[/i] of such a sequence is calculated by first multiplying each pair of numbers from the sequence, and then adding all the results together.
For example, if we take $n = 2$ and the sequence $0,1, 1, -1$, then we find the products $0\cdot 1, 0\cdot 1, 0\cdot -1, 1\cdot 1, 1\cdot -1, 1\cdot -1$. Adding these six results gives the sum product value of this sequence: $0+0+0+1+(-1)+(-1) = -1$. The sum product value of this sequence is therefore smaller than the sum product value of the sequence $0, 0, 0, 0$, which equals $0$.
Determine for each integer $n \ge 1$ the smallest sum product value that such a sequence of $2n$ numbers could have.
[i]Attention: you are required to prove that a smaller sum product value is impossible.[/i]
If $x$ and $y$ are nonnegative real numbers such that $x+y=1$, determine minimal and maximal value of $$A=x\sqrt{1+y}+y\sqrt{1+x}$$
A plane is divided into $N$ regions by three families of parallel lines. No three lines pass through the same point. What is the smallest number of lines needed so that $N > 1999$?
Let two positive integers $x, y$ satisfy the condition $44 /( x^2 + y^2)$.
Determine the smallest value of $T = x^3 + y^3$.
Let $a, b, c$ positive reals such that $a+b+c=1$. Prove that
$$\min\{a(1-b),b(1-c),c(1-a)\}\leq \frac{1}{4}$$
$$\max\{a(1-b),b(1-c),c(1-a)\}\geq \frac{2}{9}$$
What is the smallest $n$ for which there is a solution to $$\begin{cases} \sin x_1 + \sin x_2 + ... + \sin x_n = 0 \\ \sin x_1 + 2 \sin x_2 + ... + n \sin x_n = 100 \end{cases}$$ ?
Find the smallest positive integer $n$ such that the number $2^n + 2^8 + 2^{11}$ is a perfect square.
(A): $8$, (B): $9$, (C): $11$, (D): $12$, (E) None of the above.
Find the smallest positive value of $36^k - 5^m$, where $k$ and $m$ are positive integers.
$20$ numbers are written on the board $1, 2, ... ,20$. Two players are putting signs before the numbers in turn ($+$ or $-$). The first wants to obtain the minimal possible absolute value of the sum. What is the maximal value of the absolute value of the sum that can be achieved by the second player?
Sofia and Viktor are playing the following game on a $2022 \times 2022$ board:
- Firstly, Sofia covers the table completely by dominoes, no two are overlapping and all are inside the table;
- Then Viktor without seeing the table, chooses a positive integer $n$;
- After that Viktor looks at the table covered with dominoes, chooses and fixes $n$ of them;
- Finally, Sofia removes the remaining dominoes that aren't fixed and tries to recover the table with dominoes differently from before.
If she achieves that, she wins, otherwise Viktor wins. What is the minimum number $n$ for which Viktor can always win, no matter the starting covering of dominoes.
[i]Proposed by Viktor Simjanoski[/i]
On the sides $BC,CA$ and $AB$ of a triangle $ABC$ of area $S$ are taken points $A' ,B' ,C'$ respectively such that $AC' /AB = BA' /BC = CB' /CA = p$, where $0 < p < 1$ is variable.
(a) Find the area of triangle $A' B' C'$ in terms of $ p$.
(b) Find the value of $p$ which minimizes this area.
(c) Find the locus of the intersection point $P$ of the lines through $A' $ and $C'$ parallel to $AB$ and $AC$ respectively.
In a unit cube, $CG$ is the edge perpendicular to the face $ABCD$. Let $O_1$ be the incircle of square $ABCD$ and $O_2$ be the circumcircle of triangle $BDG$. Determine min$\{XY|X\in O_1,Y\in O_2\}$.
Let $a_1, a_2, . . . , a_{2019}$ be any positive real numbers such that $\frac{1}{a_1 + 2019}+\frac{1}{a_2 + 2019}+ ... +\frac{1}{a_{2019} + 2019}=\frac{1}{2019}$.
Find the minimum value of $a_1a_2... a_{2019}$ and determine for which values of $a_1, a_2, . . . , a_{2019}$ this minimum occurs
The positive real numbers $a, b, c$ satisfy the equality $a + b + c = 1$. For every natural number $n$ find the minimal possible value of the expression $$E=\frac{a^{-n}+b}{1-a}+\frac{b^{-n}+c}{1-b}+\frac{c^{-n}+a}{1-c}$$
Let $n$ be a positive integer. For a set of points in the plane $M$, we call $2$ distinct points $A,B \in M$ [i]connected[/i] if the line $AB$ contains exactly $n+1$ points from $M$.
Find the minimum value of a positive integer $m$ such that there exists a set $M$ of $m$ points in the plane with the property that any point $A \in M$ is connected with exactly $2n$ other points from $M$.