Found problems: 85335
Suppose that $ a_1$, $ a_2$, ..., $ a_n$ are positive real numbers such that $ a_1 \leq a_2 \leq \dots \leq a_n$. Let
\[ {{a_1 \plus{} a_2 \plus{} \dots \plus{} a_n} \over n} \equal{} m; \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ {{a_1^2 \plus{} a_2^2 \plus{} \dots \plus{} a_n^2} \over n} \equal{} 1.
\]
Suppose that, for some $ i$, we know $ a_i \leq m$. Prove that:
\[ n \minus{} i \geq n \left(m \minus{} a_i\right)^2
\]
Consider the set $S$ of integers $k$ which are products of four distinct primes. Such an integer $k=p_1p_2p_3p_4$ has $16$ positive divisors $1=d_1<d_2<\ldots <d_{15}<d_{16}=k$. Find all elements of $S$ less than $2002$ such that $d_9-d_8=22$.
Let $ ABC$ be an acute-angled triangle with altitude $ AK$. Let $ H$ be its ortho-centre and $ O$ be its circum-centre. Suppose $ KOH$ is an acute-angled triangle and $ P$ its circum-centre. Let $ Q$ be the reflection of $ P$ in the line $ HO$. Show that $ Q$ lies on the line joining the mid-points of $ AB$ and $ AC$.
Given triangle $ABC$. Point $M$ is the projection of vertex $B$ to bisector of angle $C$. $K$ is the touching point of the incircle with side $BC$. Find angle $\angle MKB$ if $\angle BAC = \alpha$
(V.Protasov)
A given natural number $N$ is being decomposed in a sum of some consecutive integers.
[b]a.)[/b] Find all such decompositions for $N=500.$
[b]b.)[/b] How many such decompositions does the number $N=2^{\alpha }3^{\beta }5^{\gamma }$ (where $\alpha ,$ $\beta $ and $\gamma $ are natural numbers) have? Which of these decompositions contain natural summands only?
[b]c.)[/b] Determine the number of such decompositions (= decompositions in a sum of consecutive integers; these integers are not necessarily natural) for an arbitrary natural $N.$
[b]Note by Darij:[/b] The $0$ is not considered as a natural number.
Prove that in every convex hexagon of area $S$ one can draw a diagonal that cuts off a triangle of area not exceeding $\frac{1}{6}S.$
Let $a,b,c$ be positive real numbers such that $ab+bc+ca\le 3abc$. Prove that
\[\sqrt{\frac{a^2+b^2}{a+b}}+\sqrt{\frac{b^2+c^2}{b+c}}+\sqrt{\frac{c^2+a^2}{c+a}}+3\le \sqrt{2} (\sqrt{a+b}+\sqrt{b+c}+\sqrt{c+a})\]
Determine if there exist $101$ positive integers (not necessarily distinct) such that their product is equal to the sum of all their pairwise LCM.
In an acute-angled triangle $ABC$, $M$ is the midpoint of side $BC$, and $D, E$ and $F$ the feet of the altitudes from $A, B$ and $C$, respectively. Let $H$ be the orthocenter of $\Delta ABC$, $S$ the midpoint of $AH$, and $G$ the intersection of $FE$ and $AH$. If $N$ is the intersection of the median $AM$ and the circumcircle of $\Delta BCH$, prove that $\angle HMA = \angle GNS$.
[i]Proposed by Marko Djikic[/i]
There are two bowls on the table, in one there are $p$, in the other $q$ stones ($p, q \in N*$ ). Two players $A$ and $B$ take turns playing, starting with $A$.
Who's turn:
$\bullet$ takes a stone from one of the bowls
$\bullet$or removes one stone from each bowl
$\bullet$ or puts a stone from one of the bowls into the other.
Whoever takes the last stone wins.
Under what conditions can $A$ and under what conditions can $B$ force the win?
The answer must be justified.
In a village, there are $n$ houses with $n>2$ and all of them are not collinear. We want to generate a water resource in the village. For doing this, point $A$ is [i]better[/i] than point $B$ if the sum of the distances from point $A$ to the houses is less than the sum of the distances from point $B$ to the houses. We call a point [i]ideal[/i] if there doesn’t exist any [i]better[/i] point than it. Prove that there exist at most $1$ [i]ideal[/i] point to generate the resource.
Solve the system of equations:
$\{\begin{array}{l}(1+\frac{12}{3x+y}).\sqrt{x}=2\\(1-\frac{12}{3x+y}).\sqrt{y}=6\end{array}$
Suppose $f_1(x), f_2(x), \dots, f_n(x)$ are functions of $n$ real variables $x = (x_1, \dots, x_n)$ with continuous second-order partial derivatives everywhere on $\mathbb{R}^n$. Suppose further that there are constants $c_{ij}$ such that
\[
\frac{\partial f_i}{\partial x_j} - \frac{\partial f_j}{\partial x_i}
= c_{ij}
\]
for all $i$ and $j$, $1\leq i \leq n$, $1 \leq j \leq n$. Prove that there is a function $g(x)$ on $\mathbb{R}^n$ such that $f_i + \partial g/\partial x_i$ is linear for all $i$, $1 \leq i \leq n$. (A linear function is one of the form \(
a_0 + a_1 x_1 + a_2 x_2 + \cdots + a_n x_n.)
\)
Quadrilateral $ABCD$ is inscribed in circle $\Gamma$. Segments $AC$ and $BD$ intersect at $E$. Circle $\gamma$ passes through $E$ and is tangent to $\Gamma$ at $A$. Suppose the circumcircle of triangle $BCE$ is tangent to $\gamma$ at $E$ and is tangent to line $CD$ at $C$. Suppose that $\Gamma$ has radius $3$ and $\gamma$ has radius $2$. Compute $BD$.
Given positive reals $ a, b, c $ that satisfy $ a + b + c = 1 $, show that $$ \displaystyle \sum^{}_{cyc}\frac{a^3+bc}{a^2+bc}\ge 2 $$
The numbers $1,\, 2,\, \ldots\, , n^{2}$ are written in the squares of an $n \times n$ board in some order. Initially there is a token on the square labelled with $n^{2}.$ In each step, the token can be moved to any adjacent square (by side). At the beginning, the token is moved to the square labelled with the number $1$ along a path with the minimum number of steps. Then it is moved to the square labelled with $2,$ then to square $3,$ etc, always taking the shortest path, until it returns to the initial square. If the total trip takes $N$ steps, find the smallest and greatest possible values of $N.$
Let $n$ be the $200$th smallest positive real solution to the equation $x- \frac{\pi}{2} =\ tan x$. Find the greatest integer that does not exceed $\frac{n}{2}$.
In an acute-angled triangle $ABC$, $A_1$ and $B_1$ are the feet of the altitudes from $A$ and $B$ respectively, and $M$ is the midpoint of $AB$.
a) Prove that $MA_1$ is tangent to the circumcircle of triangle $A_1B_1C$.
b) Prove that the circumcircles of triangles $A_1B_1C,BMA_1$, and $AMB_1$ have a common point.
Let $p$ be an odd prime number. For every integer $a,$ define the number $S_a = \sum^{p-1}_{j=1} \frac{a^j}{j}.$ Let $m,n \in \mathbb{Z},$ such that $S_3 + S_4 - 3S_2 = \frac{m}{n}.$ Prove that $p$ divides $m.$
[i]Proposed by Romeo Meštrović, Montenegro[/i]
A box $2$ centimeters high, $3$ centimeters wide, and $5$ centimeters long can hold $40$ grams of clay. A second box with twice the height, three times the width, and the same length as the first box can hold $n$ grams of clay. What is $n$?
$\textbf{(A)}\ 120\qquad\textbf{(B)}\ 160\qquad\textbf{(C)}\ 200\qquad\textbf{(D)}\ 240\qquad\textbf{(E)}\ 280$
In a fish shop with 28 kinds of fish, there are 28 fish sellers. In every seller, there exists only one type of each fish kind, depending on where it comes, Mediterranean or Black Sea. Each of the $k$ people gets exactly one fish from each seller and exactly one fish of each kind. For any two people, there exists a fish kind which they have different types of it (one Mediterranean, one Black Sea). What is the maximum possible number of $k$?
For each positive integer $n$, let
\begin{eqnarray*} S_n &=& 1 + \frac 12 + \frac 13 + \cdots + \frac 1n, \\ T_n &=& S_1 + S_2 + S_3 + \cdots + S_n, \\ U_n &=& \frac{T_1}{2} + \frac{T_2}{3} + \frac{T_3}{4} + \cdots + \frac{T_n}{n+1}. \end{eqnarray*} Find, with proof, integers $0 < a, b,c, d < 1000000$ such that $T_{1988} = a S_{1989} - b$ and $U_{1988} = c S_{1989} - d$.
Prove that if m,n are nonnegative integers and 0<=x<=1 then
$(1-x^n)^m + (1-(1-x)^m)^n \ge 1$
A triangle $ABC$ is inscribed in a circle $\omega$.
A variable line $\ell$ chosen parallel to $BC$ meets segments $AB$, $AC$ at points $D$, $E$ respectively, and meets $\omega$ at points $K$, $L$ (where $D$ lies between $K$ and $E$).
Circle $\gamma_1$ is tangent to the segments $KD$ and $BD$ and also tangent to $\omega$, while circle $\gamma_2$ is tangent to the segments $LE$ and $CE$ and also tangent to $\omega$.
Determine the locus, as $\ell$ varies, of the meeting point of the common inner tangents to $\gamma_1$ and $\gamma_2$.
[i](Russia) Vasily Mokin and Fedor Ivlev[/i]
We have an $n \times n$ board, filled with $n$ rectangles aligned to the grid. The $n$ rectangles cover all the board and are never superposed. Find, in terms of $n$, the smallest value the sum of the $n$ diagonals of the rectangles can take.