Given that $\log_{10}(4) = 0.6021$ to the nearest ten-thousandth, find $\log_{10}(5)$ to the nearest thousandth. [i]Lightning 3.3[/i]

Find all triples $(x,y, z)$ of integers such that $$\begin{cases} x^2y + y^2z + z^2x= 2010^2 \\ xy^2 + yz^2 + zx^2= -2010 \end{cases}$$

Prove that for any natural numbers$a,b$ there exist infinity many prime numbers $p$ so that $Ord_p(a)=Ord_p(b)$(Proving that there exist infinity prime numbers $p$ so that $Ord_p(a) \ge Ord_p(b)$ will get a partial mark)

Mr. Lopez has a choice of two routes to get to work. Route A is $6$ miles long, and his average speed along this route is $30$ miles per hour. Route B is $5$ miles long, and his average speed along this route is $40$ miles per hour, except for a $\frac{1}{2}$-mile stretch in a school zone where his average speed is $20$ miles per hour. By how many minutes is Route B quicker than Route A? $\textbf{(A)}\ 2 \frac{3}{4} \qquad\textbf{(B)}\ 3 \frac{3}{4} \qquad\textbf{(C)}\ 4 \frac{1}{2} \qquad\textbf{(D)}\ 5 \frac{1}{2} \qquad\textbf{(E)}\ 6 \frac{3}{4}$

For which integers $0 \le k \le 9$ do there exist positive integers $m$ and $n$ so that the number $3^m + 3^n + k$ is a perfect square?

Denote $X,Y$ two convex polygons, such that $X$ is contained inside $Y$. Denote $S (X)$, $P (X)$, $S (Y)$, $P (Y)$ the area and perimeter of the first and second polygons, respectively. Prove that $$ \frac{S(X)}{P(X)}<2 \frac{S(Y)}{P(Y)}.$$

Let $ABCD$ be a fixed convex quadrilateral with $BC=DA$ and $BC$ not parallel with $DA$. Let two variable points $E$ and $F$ lie of the sides $BC$ and $DA$, respectively and satisfy $BE=DF$. The lines $AC$ and $BD$ meet at $P$, the lines $BD$ and $EF$ meet at $Q$, the lines $EF$ and $AC$ meet at $R$. Prove that the circumcircles of the triangles $PQR$, as $E$ and $F$ vary, have a common point other than $P$.

Two ants crawl along the sides of the $49$ squares of a $7 * 7$ board. Each ant passes through all $64$ vertices exactly once and returns to its starting point. What is the smallest possible number of sides covered by both ants?

Five points are given in space, no four of which are coplanar. Each of the segments connecting two of them is painted in white, green or red, so that all the colors are used and no three segments of the same color form a triangle. Prove that among these five points there is one at which segments of all the three colors meet.

Given triangle $ABC$ with $AB<AC$ and its circumcircle $\Omega$. Let $I$ be the incenter of $ABC$, and the feet from $I$ to $BC$ is $D$. The circle with center $A$ and radius $AI$ intersects $\Omega$ at $E$ and $F$. $P$ is a point on $EF$ such that $DP$ is parallel to $AI$. Prove that $AP$ and $MI$ intersects on $\Omega$ where $M$ is the midpoint of arc $BAC$. [hide = Remark] In the test, the incenter called $O$ and the circumcircle called $Luna$ $Cabrera$ You have to prove $AP \cap MO \in Luna$ $Cabrera$ [/hide] [i]Proposed by BlessingOfHeaven[/i]

Find all functions $f$ from the reals to the reals such that \[f\left(f(x)+y\right)=2x+f\left(f(y)-x\right)\] for all real $x,y$.

Let $C$ be the curve expressed by $x=\sin t,\ y=\sin 2t\ \left(0\leq t\leq \frac{\pi}{2}\right).$ (1) Express $y$ in terms of $x$. (2) Find the area of the figure $D$ enclosed by the $x$-axis and $C$. (3) Find the volume of the solid generated by a rotation of $D$ about the $y$-axis.

Let $b$ be a number with $-2 < b < 0$. Prove that there exists a positive integer $n$ such that all the coefficients of the polynomial $(x + 1)^n(x^2 + bx + 1)$ are positive.

Let $D$ be the midpoint of the hypotenuse $AB$ of a right triangle $ABC$. Let $O_1$ and $O_2$ be the circumcenters of the $ADC$ and $DBC$ triangles, respectively. a) Prove that $\angle O_1DO_2$ is right. b) Prove that $AB$ is tangent to the circle of diameter $O_1O_2$ .

Describe how to place the vertices of a triangle in the faces of a cube in such a way that the shortest side of the triangle is the biggest possible.

Given $n>4$ points in the plane, no three collinear. Prove that there are at least $\frac{(n-3)(n-4)}{2}$ convex quadrilaterals with vertices amongst the $n$ points.

Let $A_{11}$ denote the answer to problem $11$. Determine the smallest prime $p$ such that the arithmetic sequence $p,p+A_{11},p+2A_{11},\cdots$ begins with the largest number of primes. There is just one triple of possible $(A_{10},A_{11},A_{12})$ of answers to these three problems. Your team will receive credit only for answers matching these. (So, for example, submitting a wrong answer for problem $11$ will not alter the correctness of your answer to problem $12$.)

Let $ABCD$ be a rhombus of sides $AB = BC = CD= DA = 13$. On the side $AB$ construct the rhombus $BAFE$ outside $ABCD$ and such that the side $AF$ is parallel to the diagonal $BD$ of $ABCD$. If the area of $BAFE$ is equal to $65$, calculate the area of $ABCD$.

On a circle are arranged $100$ baskets, each containing at least one candy. The total number of candies is $780$. Asad and Sevinch make moves alternatingly, with Asad going first. On one move, Asad takes all the candies from $9$ consecutive non-empty baskets, while Sevinch takes all the candies from a single non-empty basket that has at least one empty neighboring basket. Prove that Asad can take overall at least $700$ candies, regardless of the initial distribution of candies and Sevinch's actions. [i] Shubin Yakov, Russia [/i]

Let $ f: \mathbb{R}^2\to\mathbb{R}$ be a function such that $ f(x,y)\plus{}f(y,z)\plus{}f(z,x)\equal{}0$ for real numbers $ x,y,$ and $ z.$ Prove that there exists a function $ g: \mathbb{R}\to\mathbb{R}$ such that $ f(x,y)\equal{}g(x)\minus{}g(y)$ for all real numbers $ x$ and $ y.$

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Let $ABC$ be a triangle and let $BB_1,CC_1$ be respectively the bisectors of $\angle{B},\angle{C}$ with $B_1$ on $AC$ and $C_1$ on $AB$, Let $E,F$ be the feet of perpendiculars drawn from $A$ onto $BB_1,CC_1$ respectively. Suppose $D$ is the point at which the incircle of $ABC$ touches $AB$. Prove that $AD=EF$

Prove that the second last digit of each power of three is even . (V . I . Plachkos)

Let $a>0$. Evaluate $\int_0^a x^2\left(1-\frac{x}{a}\right)^adx$. [i]2011 Keio University entrance exam/Science and Technology[/i]

In a family there are four children of different ages, each age being a positive integer not less than $2$ and not greater than $16$. A year ago the square of the age of the eldest child was equal to the sum of the squares of the ages of the remaining children. One year from now the sum of the squares of the youngest and the oldest will be equal to the sum of the squares of the other two. How old is each child?