Let $f$ be a real function on the real line with continuous third derivative. Prove that there exists a point $a$ such that \[f(a)\cdot f^\prime(a)\cdot f^{\prime\prime}(a)\cdot f^{\prime\prime\prime}(a)\geq 0.\]

Find all functions $f : \mathbb{R} \to\mathbb{R}$ such that $f(0)\neq 0$ and \[f(f(x)) + f(f(y)) = f(x + y)f(xy),\] for all $x, y \in\mathbb{R}$.

Solve the following system of equations for real $x,y$ and $z$: \begin{eqnarray*} x &=& \sqrt{2y+3}\\ y &=& \sqrt{2z+3}\\ z &=& \sqrt{2x+3}. \end{eqnarray*}

A finite number of stones are [i]good[/i] when the weight of each of these stones is less than the total weight of the rest. It is known that arbitrary $n-1$ of the given $n$ stones is [i]good[/i]. Prove that it is possible to choose a [i]good[/i] triple from these stones.

Alice and Bob play a game where on each turn, Alice rolls a die and Bob flips a coin. Bob wins the game if he flips $3$ heads before Alice rolls a $6$. What is the probability that Bob wins? Note that Bob does not in if he flips his third head the same turn Alice rolls her first $6$.

[b]p1.[/b] Find all positive integers $n$ such that $n^3 - 14n^2 + 64n - 93$ is prime. [b]p2.[/b] Let $a, b, c$ be real numbers such that $0 \le a, b, c \le 1$. Find the maximum value of $$\frac{a}{1 + bc}+\frac{b}{1 + ac}+\frac{c}{1 + ab}$$ [b]p3.[/b] Find the maximum value of the function $f(x, y, z) = 4x + 3y + 2z$ on the ellipsoid $16x^2 + 9y^2 + 4z^2 = 1$ [b]p4.[/b] Let $x_1,..., x_n$ be numbers such that $x_1+...+x_n = 2009$. Find the minimum value of $x^2_1+...+x^2_n$ (in term of $n$). [b]p5.[/b] Find the number of odd integers between $1000$ and $9999$ that have at least 3 distinct digits. [b]p6.[/b] Let $A_1,A_2,...,A_{2^n-1}$ be all the possible nonempty subsets of $\{1, 2, 3,..., n\}$. Find the maximum value of $a_1 + a_2 + ... + a_{2^n-1}$ where $a_i \in A_i$ for each $i = 1, 2,..., 2^n - 1$. [b]p7.[/b] Find the rightmost digit when $41^{2009}$ is written in base $7$. [b]p8.[/b] How many integral ordered triples $(x, y, z)$ satisfy the equation $x+y+z = 2009$, where $10 \le x < 31$, $100 < z < 310$ and $y \ge 0$. [b]p9.[/b] Scooby has a fair six-sided die, labeled $1$ to $6$, and Shaggy has a fair twenty-sided die, labeled $1$ to $20$. During each turn, they both roll their own dice at the same time. They keep rolling the die until one of them rolls a 5. Find the probability that Scooby rolls a $5$ before Shaggy does. [b]p10.[/b] Let $N = 1A323492110877$ where $A$ is a digit in the decimal expansion of $N$. Suppose $N$ is divisible by $7$. Find $A$. [b]p11.[/b] Find all solutions $(x, y)$ of the equation $\tan^4(x+y)+\cot^4(x+y) = 1-2x-x^2$, where $-\frac{\pi}{2} \le x; y \le \frac{\pi}{2}$ [b]p12.[/b] Find the remainder when $\sum^{50}_{k=1}k!(k^2 + k - 1)$ is divided by $1008$. [b]p13.[/b] The devil set of a positive integer $n$, denoted $D(n)$, is defined as follows: (1) For every positive integer $n$, $n \in D(n)$. (2) If $n$ is divisible by $m$ and $m < n$, then for every element $a \in D(m)$, $a^3$ must be in $D(n)$. Furthermore, call a set $S$ scary if for any $a, b \in S$, $a < b$ implies that $b$ is divisible by $a$. What is the least positive integer $n$ such that $D(n)$ is scary and has at least $2009$ elements? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $I$ be the incenter, $A_1$ and $B_1$ midpoints of sides $BC$ and $AC$ of a triangle $\Delta ABC$. Denote by $M$ and $N$ the midpoints of the arcs $AC$ and $BC$ of circumcircle of $\Delta ABC$ which do contain the other vertex of the triangle. If points $M$, $I$ and $N$ are collinear prove that: \begin{align*} \angle AIB_1=\angle BIA_1=90^{\circ} \end{align*}

Let $p > 2$ be a prime and let $a,b,c,d$ be integers not divisible by $p$, such that \[ \left\{ \dfrac{ra}{p} \right\} + \left\{ \dfrac{rb}{p} \right\} + \left\{ \dfrac{rc}{p} \right\} + \left\{ \dfrac{rd}{p} \right\} = 2 \] for any integer $r$ not divisible by $p$. Prove that at least two of the numbers $a+b$, $a+c$, $a+d$, $b+c$, $b+d$, $c+d$ are divisible by $p$. (Note: $\{x\} = x - \lfloor x \rfloor$ denotes the fractional part of $x$.)

Let $H$ be the orthocenter of a given triangle $ABC$. Let $BH$ and $AC$ meet at a point $E$, and $CH$ and $AB$ meet at $F$. Suppose that $X$ is a point on the line $BC$. Also suppose that the circumcircle of triangle $BEX$ and the line $AB$ intersect again at $Y$, and the circumcircle of triangle $CFX$ and the line $AC$ intersect again at $Z$. Show that the circumcircle of triangle $AYZ$ is tangent to the line $AH$. [i]Proposed by usjl[/i]

On the numerical line, arrange a system of closed segments of length $1$ without common points (endpoints included) so that any infinite arithmetic progression with any non zero difference and any first term has a common point with a segment of the system.

Cut the $9 \times 10$ grid rectangle along the grid lines into several squares so that there are exactly two of them with odd sidelengths.

In $ xyz$ space, find the volume of the solid expressed by the sytem of inequality: $ 0\leqq x\leqq 1,\ 0\leqq y\leqq 1,\ 0\leqq z\leqq 1$ $ x^2 \plus{} y^2 \plus{} z^2 \minus{} 2xy \minus{} 1\geqq 0$

At the junction of some countably infinite number of roads sits a greyhound. On one of the roads a hare runs, away from the junction. The only thing known is that the (maximal) speed of the hare is strictly less than the (maximal) speed of the greyhound (but not their precise ratio). Does the greyhound have a strategy for catching the hare in a finite amount of time? ([i]Dan Schwarz[/i])

$BE$ is the altitude of acute triangle $ABC$. The line $\ell$ touches the circumscribed circle of the triangle $ABC$ at point $B$. A perpendicular $CF$ is drawn from $C$ on line $\ell$. Prove that the lines $EF$ and $AB$ are parallel.

In a grid of dimensions $n \times n$, a part of the squares is marked with crosses such that in each at least half of the $4 \times 4$ squares are marked. Find the least possible the total number of marked squares in the grid.

For an ordered pair $(m,n)$ of distinct positive integers, suppose, for some nonempty subset $S$ of $\mathbb R$, that a function $f:S \rightarrow S$ satisfies the property that $f^m(x) + f^n(y) = x+y$ for all $x,y\in S$. (Here $f^k(z)$ means the result when $f$ is applied $k$ times to $z$; for example, $f^1(z)=f(z)$ and $f^3(z)=f(f(f(z)))$.) Then $f$ is called \emph{$(m,n)$-splendid}. Furthermore, $f$ is called \emph{$(m,n)$-primitive} if $f$ is $(m,n)$-splendid and there do not exist positive integers $a\le m$ and $b\le n$ with $(a,b)\neq (m,n)$ and $a \neq b$ such that $f$ is also $(a,b)$-splendid. Compute the number of ordered pairs $(m,n)$ of distinct positive integers less than $10000$ such that there exists a nonempty subset $S$ of $\mathbb R$ such that there exists an $(m,n)$-primitive function $f: S \rightarrow S$. [i]Proposed by Vincent Huang[/i]

Two runners start running along a circular track of unit length from the same starting point and int he same sense, with constant speeds $v_1$ and $v_2$ respectively, where $v_1$ and $v_2$ are two distinct relatively prime natural numbers. They continue running till they simultneously reach the starting point. Prove that (a) at any given time $t$, at least one of the runners is at a distance not more than $\frac{[\frac{v_1 + v_2}{2}]}{v_1 + v_2}$ units from the starting point. (b) there is a time $t$ such that both the runners are at least $\frac{[\frac{v_1 + v_2}{2}]}{v_1 + v_2}$ units away from the starting point. (All disstances are measured along the track). $[x]$ is the greatest integer function.

Let $N$ be the set of positive integers. If $A,B,C \ne \emptyset$, $A \cap B = B \cap C = C \cap A = \emptyset$ and $A \cup B \cup C = N$, we say that $A,B,C$ are partitions of $N$. Prove that there are no partitions of $N, A,B,C$, that satisfy the following: (i) $\forall a \in A, b \in B$, we have $a + b + 1 \in C$ (ii) $\forall b \in B, c \in C$, we have $b + c + 1 \in A$ (iii) $\forall c \in C, a \in A$, we have $c + a + 1 \in B$

Santa Claus wants to wrap presents. These are available in $n$ sizes $A_1 <A_2 <...<A_n$, and analogously, there are $n$ packaging sizes $B_1 <B_2 <...<B_n$, where $B_i$ is enough to all gift sizes $A_j$ can be grouped with $j\le i$, but too small for those with $j> i$. On the shelf to the right of Santa Claus are the gifts sorted by size, where the smallest are on the right, of course there can be several gifts of the same size, or none of a size at all. To his left is a shelf with packaging, and also these are sorted from small to large in the same direction. He's brooding in what way he should wrap the gifts and sees two methods for doing this, which depend on his thinking and laziness of movement have been optimized: a) He takes the present closest to him and puts it in the closest packaging, in which it fits in. b) He takes the packaging closest to him and packs in it the closest thing to him gift. In both cases he then does the same again, although of course the one he was using the gift and its packaging are missing, and so on. Once it is not large enough if the packaging or the present is not small enough, he / she will provide the present or the packaging back to its place on the shelf and takes the next-closest. Prove that both methods lead to the same result in the end, they are considered to be exactly the same gifts packed in the same packaging.

Define $f(x,y,z)=\frac{(xy+yz+zx)(x+y+z)}{(x+y)(y+z)(z+x)}$. Determine the set of real numbers $r$ for which there exists a triplet of positive real numbers satisfying $f(x,y,z)=r$.

Let $O$ be the circumcentre, and $\Omega$ be the circumcircle of an acute-angled triangle $ABC$. Let $P$ be an arbitrary point on $\Omega$, distinct from $A$, $B$, $C$, and their antipodes in $\Omega$. Denote the circumcentres of the triangles $AOP$, $BOP$, and $COP$ by $O_A$, $O_B$, and $O_C$, respectively. The lines $\ell_A$, $\ell_B$, $\ell_C$ perpendicular to $BC$, $CA$, and $AB$ pass through $O_A$, $O_B$, and $O_C$, respectively. Prove that the circumcircle of triangle formed by $\ell_A$, $\ell_B$, and $\ell_C$ is tangent to the line $OP$.

Let $a(n)$ be the number of representations of the positive integer $n$ as an ordered sum of $1$'s and $2$'s. Let $b(n)$ be the number of representations of the positive integer $n$ as an ordered sum of integers greater than $1.$ Show that $a(n)=b(n+2)$ for each $n$.

Evaluate $ \int_{0}^{1}e^{\sqrt{e^{x}}}\ dx\plus{}2\int_{e}^{e^{\sqrt{e}}}\ln (\ln x)\ dx$.

One side of a square in on line $y=2x-17$, and two other points are on parabola $y=x^2$, then the minumum value of the area of the square is________.

Given are sheets and the numbers $00, 01, \ldots, 99$ are written on them. We must put them in boxes $000, 001, \ldots, 999$ so that the number on the sheet is the number on the box with one digit erased. What is the minimum number of boxes we need in order to put all the sheets?