The numbers $1, 2, \ldots, n$ are written on a blackboard. Each minute, a student goes up to the board, chooses two numbers $x$ and $y$, erases them, and writes the number $2x+2y$ on the board. This continues until only one number remains. Prove that this number is at least $\frac{4}{9}n^3$. [i]Brian Hamrick.[/i]

Brianna is using part of the money she earned on her weekend job to buy several equally-priced CDs. She used one fifth of her money to buy one third of the CDs. What fraction of her money will she have left after she buys all the CDs? $ \textbf{(A)}\ \frac{1}{5} \qquad \textbf{(B)}\ \frac{1}{3} \qquad \textbf{(C)}\ \frac{2}{5} \qquad \textbf{(D)}\ \frac{2}{3} \qquad \textbf{(E)}\ \frac{4}{5}$

The four circumcircles of the four faces of a tetrahedron have equal radii. Prove that the four faces of the tetrahedron are congruent triangles.

Once upon a time, there was a tribe called the Goblin Tribe, and their regular game was ''The ATM Game (Level Giveaway)'' . The game stats with a number of Goblin standing in a circle. Then the Chieftain assigns a Level to each Goblin, which can be the same or different (Level is a number which is a non-negative integer). Start play by selecting a Goblin with Level $k$ ($k \not=). 0$) comes up. Let's assume Goblin $A$. Goblin $A$ explodes itself. Goblin A's Level becomes $0$. After that, Level of Goblin $k$ next to Goblin $A$ clockwise gets Level $1$. Prove that: 1.) If after that Goblin $k$ next to Goblin $A$ explodes itself and keep doing this, $k'$ next to that Goblin clockwise explodes itself. Prove that the level of each Goblin will be the same again. 2) 2.) If after that we can choose any Goblin whose level is not $0$ to explode itself. And keep doing this. Prove that no matter what the initial level is, we can make each level the way we want. But there is a condition that the sum of all Goblin's levels must be equal to the beginning. [i](gools)[/i]

Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps. [list=1] [*]select a $2\times 2$ square in the grid; [*]flip the coins in the top-left and bottom-right unit squares; [*]flip the coin in either the top-right or bottom-left unit square. [/list] Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. [i]Thanasin Nampaisarn, Thailand[/i]

Let $ABC$ be a triangle with circumcircle $\omega$. Let $l_B$ and $l_C$ be two lines through the points $B$ and $C$, respectively, such that $l_B \parallel l_C$. The second intersections of $l_B$ and $l_C$ with $\omega$ are $D$ and $E$, respectively. Assume that $D$ and $E$ are on the same side of $BC$ as $A$. Let $DA$ intersect $l_C$ at $F$ and let $EA$ intersect $l_B$ at $G$. If $O$, $O_1$ and $O_2$ are circumcenters of the triangles $ABC$, $ADG$ and $AEF$, respectively, and $P$ is the circumcenter of the triangle $OO_1O_2$, prove that $l_B \parallel OP \parallel l_C$. [i]Proposed by Stefan Lozanovski, Macedonia[/i]

Given is a triangle $ABC$ and points $D$ and $E$, respectively on $] BC [$ and $] AB [$. $F$ it is intersection of lines $AD$ and $CE$. We denote as $| CD | = a, | BD | = b, | DF | = c$ and $| AF | = d$. Determine the ratio $\frac{| BE |}{|AE |}$ in terms of $a, b, c$ and $d$ [img]https://cdn.artofproblemsolving.com/attachments/5/7/856c97045db2d9a26841ad00996a2b809addaa.png[/img]

For each positive integer $n$, let $s(n)$ be the sum of the squares of the digits of $n$. For example, $s(15)=1^2+5^2=26$. Determine all integers $n\geq 1$ such that $s(n)=n$.

the edges of triangle $ABC$ are $a,b,c$ respectively,$b<c$,$AD$ is the bisector of $\angle A$,point $D$ is on segment $BC$. (1)find the property $\angle A$,$\angle B$,$\angle C$ have,so that there exists point $E,F$ on $AB,AC$ satisfy $BE=CF$,and $\angle NDE=\angle CDF$ (2)when such $E,F$ exist,express $BE$ with $a,b,c$

Find the least value of the expression $(x+y)(y+z)$, under the conditionthat $x,y,z$ are positive numbers satisfying the equation $xyz(x + y + z) = 1$.

Find $A=x^5+y^5+z^5$ if $x+y+z=1$, $x^2+y^2+z^2=2$ and $x^3+y^3+z^3=3$.

Let $A_1$, $A_2$, $A_3$ be three points in the plane, and for convenience, let $A_4= A_1$, $A_5 = A_2$. For $n = 1$, $2$, and $3$, suppose that $B_n$ is the midpoint of $A_n A_{n+1}$, and suppose that $C_n$ is the midpoint of $A_n B_n$. Suppose that $A_n C_{n+1}$ and $B_n A_{n+2}$ meet at $D_n$, and that $A_n B_{n+1}$ and $C_n A_{n+2}$ meet at $E_n$. Calculate the ratio of the area of triangle $D_1 D_2 D_3$ to the area of triangle $E_1 E_2 E_3$.

Decide if exists a convex hexagon with all sides longer than $1$ and all nine of its diagonals are less than $2$ in length.

Circles $O_1$ and $O_2$ intersects at two points $B$ and $C$, and $BC$ is the diameter of circle $O_1$. Construct a tangent line of circle $O_1$ at $C$ and intersecting circle $O_2$ at another point $A$. We join $AB$ to intersect $O_1$ at point $E$, then join $CE$ and extend it to intersect circle $O_2$ at point $F$. Assume that $H$ is an arbitrary point on the line segment $AF$. We join $HE$ and extend it to intersect circle $O_1$ at point $G$, and join $BG$ and extend it to intersect the extended line of $AC$ at point $D$. Prove that $\frac{AH}{HF}=\frac{AC}{CD}$.

Let $SP_1P_2P_3EP_4P_5$ be a heptagon. A frog starts jumping at vertex $S$. From any vertex of the heptagon except $E$, the frog may jump to either of the two adjacent vertices. When it reaches vertex $E$, the frog stops and stays there. Find the number of distinct sequences of jumps of no more than $12$ jumps that end at $E$.

Define a function $g :\mathbb{N} \rightarrow \mathbb{R}$ Such that $g(x)=\sqrt{4^x+\sqrt {4^{x+1}+\sqrt{4^{x+2}+...}}}$. Find the last 2 digits in the decimal representation of $g(2021)$.

Let $$N = {2^{2012} \choose 0} {2^{2012} \choose 1} {2^{2012} \choose 2} {2^{2012} \choose 3}... {2^{2012} \choose 2^{2012}}.$$ Let M be the number of $0$’s when $N$ is written in binary. How many $0$’s does $M$ have when written in binary? (Warning: this question is very hard.)

Let $S(n)$ denote the sum of digits of an integer $n$ (For example, $S(17) = 1 + 7 = 8$). If a positive two digit integer is randomly selected, what is the probability $S(S(n)) \ge 8$? $\textbf{(A) }0\qquad\textbf{(B) }\dfrac19\qquad\textbf{(C) }\dfrac29\qquad\textbf{(D) }\dfrac{11}{45}\qquad\textbf{(E) }\dfrac{13}{45}$

Prove that for any odd number $a$ there exists an integer $b$ such that $2^b-1$ is divisible by $a$.

Let $\{a_n\}_{n \geq 1}$ be a bounded sequence satisfying \[a_n < \displaystyle\sum_{k=a}^{2n+2006} \frac{a_k}{k+1} + \frac{1}{2n+2007} \quad \forall \quad n = 1, 2, 3, \ldots \] Show that \[a_n < \frac{1}{n} \quad \forall \quad n = 1, 2, 3, \ldots\]

An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that \[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1 \] for every pair of distinct nonnegative integers $ i, j$.

There are $n$ people, any two of them have called each other at most once. In any group of $n-2$ of them, anyone of the group has called with other people in this group for $3^k$ times, where $k$ is a non-negative integer (the value of $k$ is fixed). Find all possible integers $n$.

Six bags of marbles contain $ 18$, $ 19$, $ 21$, $ 23$, $ 25$, and $ 34$ marbles, respectively. One bag contains chipped marbles only. The other $ 5$ bags contain no chipped marbles. Jane takes three of the bags and George takes two of the others. Only the bag of chipped marbles remains. If Jane gets twice as many marbles as George, how many chipped marbles are there? $ \textbf{(A)}\ 18 \qquad \textbf{(B)}\ 19 \qquad \textbf{(C)}\ 21 \qquad \textbf{(D)}\ 23 \qquad \textbf{(E)}\ 25$

On a $50 \times 50$ chessboard, we put, in the lower left corner, a die whose faces are numbered from $1$ to $6$. By convention, the sum of digits on two opposite side of the die equals $7$. Adama wants to move the die to the diagonally opposite corner using the following rule: at each step, Adama can roll the die only on to its right side, or to its top side. We suppose that whenever the die lands on a square, the number on its bottom face is printed on the square. By the end of these operations, Adama wants to find the sum of the $99$ numbers appearing on the chessboard. What are the maximum and minimum possible values of this sum?

Let $ a, b, c $ be positive real numbers such that $ ab+bc+ca=1 $. Prove that \[ \sqrt{ a^2 + b^2 + \frac{1}{c^2}} + \sqrt{ b^2 + c^2 + \frac{1}{a^2}} + \sqrt{ c^2 + a^2 + \frac{1}{b^2}} \ge \sqrt{33} \]