Found problems: 85335
Let $ABC$ be an acute-angled triangle with $AC>AB$, and $\Omega$ is your circumcircle. Let $P$ be the midpoint of the arc $BC$ of $\Omega$ (not containing $A$) and $Q$ be the midpoint of the arc $BC$ of $\Omega$(containing the point $A$). Let $M$ be the foot of perpendicular of $Q$ on the line $AC$. Prove that the circumcircle of $\triangle AMB$ cut the segment $AP$ in your midpoint.
There are $99$ space stations. Each pair of space stations is connected by a tunnel. There are $99$ two-way main tunnels, and all the other tunnels are strictly one-way tunnels. A group of $4$ space stations is called [i]connected[/i] if one can reach each station in the group from every other station in the group without using any tunnels other than the $6$ tunnels which connect them. Determine the maximum number of connected groups.
Which element is a liquid at $25^\circ\text{C}$ and $1.0 \text{ atm}$?
$\textbf{(A)}\hspace{.05in}\text{bromine} \qquad\textbf{(B)}\hspace{.05in}\text{krypton} \qquad\textbf{(C)}\hspace{.05in}\text{phosphorus} \qquad\textbf{(D)}\hspace{.05in}\text{xenon} \qquad$
The altitudes through the vertices $A,B,C$ of an acute-angled triangle $ABC$ meet the opposite sides at $D,E,F,$ respectively. The line through $D$ parallel to $EF$ meets the lines $AC$ and $AB$ at $Q$ and $R$, respectively. The line $EF$ meets $BC$ at $P$. Prove that the circumcircle of the triangle $PQR$ passes through the midpoint of $BC$.
A triangle $ABC$ has side lengths $AB=8$ and $BC=10.$ Given that the altitude to side $BC$ has length $4,$ what is the length of the altitude to side $AB?$
In each cell of the table $4 \times 4$, in which the lines are labeled with numbers $1,2,3,4$, and columns with letters $a,b,c,d$, one number is written: $0$ or $1$ . Such a table is called [i]valid [/i] if there are exactly two units in each of its rows and in each column. Determine the number of [i]valid [/i] tables.
All the species of plants existing in Russia are catalogued (numbered by integers from $2$ to $2000$ ; one after another, without omissions or repetitions). For any pair of species the gcd of their catalogue numbers was calculated and recorded but the catalogue numbers themselves were lost. Is it possible to restore the catalogue numbers from the data in hand?
There are $30$ teams in NBA and every team play $82$ games in the year. Bosses of NBA want to divide all teams on Western and Eastern Conferences (not necessary equally), such that number of games between teams from different conferences is half of number of all games. Can they do it?
Prove that for any natural number $ n $ there are $ n $ consecutive numbers, each one of these numbers having the following property: the sum of the positive divisors of a number $ x $ is greater than $ 2x. $
Find all pairs of positive integers $m$, $n$ such that the $(m+n)$-digit number \[\underbrace{33\ldots3}_{m}\underbrace{66\ldots 6}_{n}\] is a perfect square.
Let $ABCDEF$ be a regular hexagon with side length $1$. Denote by $X, Y,$ and $Z$ the midpoints of $\overline{AB}$, $\overline{CD}$, and $\overline{EF}$, respectively. What is the area of the convex hexagon whose interior is the intersection of the interiors of $\triangle ACE$ and $\triangle XYZ$?
$\textbf{(A) }\dfrac{3}{8}\sqrt{3}\qquad\textbf{(B) }\dfrac{7}{16}\sqrt{3}\qquad\textbf{(C) }\dfrac{15}{32}\sqrt{3}\qquad\textbf{(D) }\dfrac{1}{2}\sqrt{3}\qquad\textbf{(E) }\dfrac{9}{16}\sqrt{3}$
100 volleyball teams played a one-round tournament. No two matches held at the same time. It turned out that before each match the teams playing against each other had the same number of wins. Find all possible number of wins for the winner of this tournament.
Let $x,y,z$ be positive reals for which:
$\sum (xy)^{2}=6xyz$
Prove that:
$\sum \sqrt{\frac{x}{x+yz}}\geq \sqrt{3}$.
Let $q(n)$ denote the sum of the digits of a natural number $n$. Determine $q(q(q(2000^{2000})))$.
"KING-THE SUICIDER"
Given a chess-board $1000\times 1000$, $499$ white castles and a black king. Prove that it does not matter neither the initial situation nor the way white plays, but the king can always enter under the check in a finite number of moves.
A serpentine is a sequence of points $P_1 , ..., P_m$ in a plane, not necessarily all different, such that the distance between $P_i$ and $P_{i+1}$ is at least 1, and the segments $P_i P_{i +1}$ are alternately horizontal and vertical. Construct a compact set in which there is a sequence of serpentines with arbitrary long lengths but there is no closed serpentine ($P_m = P_i$ for some i < m).
On every square of a chessboard, there are as many grains as shown on the picture. Starting from an arbitrary square, a knight starts a journey over the chessboard. After every move it eats up all the grains from the square it arrived to, but when it leaves, the same number of grains is put back on the square. After some time the knight returns to its initial square. Prove that the total number of grains the knight has eaten up during the journey is divisible by $3$.
[img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvZC8xL2IwOGZlODYxMDg1MWMwMWUwMjFkOGJkMWQ2MjA4YzIzZmQ5YTc5LnBuZw==&rn=U2NyZWVuIFNob3QgMjAyMS0wNC0yOCBhdCA3LjIzLjA3IEFNLnBuZw==[/img]
If $ x$,$ y$, and $ z$ are real numbers such that \[(x \minus{} 3)^2 \plus{} (y \minus{} 4)^2 \plus{} (z \minus{} 5)^2 \equal{} 0,\] then $ x \plus{} y \plus{} z \equal{}$
$ \textbf{(A)}\ \minus{}12\qquad
\textbf{(B)}\ 0\qquad
\textbf{(C)}\ 8\qquad
\textbf{(D)}\ 12\qquad
\textbf{(E)}\ 50$
Which natural numbers cannot be presented in that way: $[n+\sqrt{n}+\frac{1}{2}]$, $n\in\mathbb{N}$
$[y]$ is the greatest integer function.
We are given $n$ circles which have the same center. Two lines $D_1,D_2$ are concurent in $P$, a point inside all circles. The rays determined by $P$ on the line $D_i$ meet the circles in points $A_1,A_2,...,A_n$ and $A'_1, A'_2,..., A'_n$ respectively and the rays on $D_2$ meet the circles at points $B_1,B_2, ... ,B_n$ and $B'_2, B'_2 ..., B'_n$ (points with the same indices lie on the same circle). Prove that if the arcs $A_1B_1$ and $A_2B_2$ are equal then the arcs $A_iB_i$ and $A'_iB'_i$ are equal, for all $i = 1,2,... n$.
Let $ABCDE$ be a pentagon with right angles at vertices $B$ and $E$ and such that $AB = AE$ and $BC = CD = DE$. The diagonals $BD$ and $CE$ meet at point $F$. Prove that $FA = AB$.
Let $ ABC$ be an equilateral triangle with side length 2, and let $ \Gamma$ be a circle with radius $ \frac {1}{2}$ centered at the center of the equilateral triangle. Determine the length of the shortest path that starts somewhere on $ \Gamma$, visits all three sides of $ ABC$, and ends somewhere on $ \Gamma$ (not necessarily at the starting point). Express your answer in the form of $ \sqrt p \minus{} q$, where $ p$ and $ q$ are rational numbers written as reduced fractions.
In the cyclic quadrilateral $ABCD$, the sides $AB, DC$ meet at $Q$, the sides $AD,BC$ meet at $P, M$ is the midpoint of $BD$, If $\angle APQ=90^o$, prove that $PM$ is perpendicular to $AB$.
For each positive integer $n$ let \[x_n=p_1+\cdots+p_n\] where $p_1,\ldots,p_n$ are the first $n$ primes. Prove that for each positive integer $n$, there is an integer $k_n$ such that $x_n<k_n^2<x_{n+1}$
In convex hexagon $ABCDEF$, $\angle A \cong \angle B$, $\angle C \cong \angle D$, and $\angle E \cong \angle F$. Prove that the perpendicular bisectors of $\overline{AB}$, $\overline{CD}$, and $\overline{EF}$ pass through a common point.
[i]Proposed by Lewis Chen[/i]