Consider the set of continuous functions $f$, whose $n^{\text{th}}$ derivative exists for all positive integer $n$, satisfying $f(x)=\tfrac{\text{d}^3}{\text{dx}^3}f(x)$, $f(0)+f'(0)+f''(0)=0$, and $f(0)=f'(0)$. For each such function $f$, let $m(f)$ be the smallest nonnegative $x$ satisfying $f(x)=0$. Compute all possible values of $m(f)$.

Billy let his herd freely. Enjoying their time the horses started to jump on the squares of a lattice of meadow that is infinite in both directions. Each horse can jump as follows: horizontally or vertically moves three, then turn to left and moves two. Naturally, under the jump a horse don’t touch the ground. The horses are standing on squares that no two can meet by such a jump. How many horses does Billy have if their number is the maximum possible? [i]The figure below shows where a horse can jump to. Notice that there 4 places and not 8 like in chess.[/i] [img]https://cdn.artofproblemsolving.com/attachments/c/6/8b6f9ca4e0aad46a13e133d87bcd4dd4384e7a.png[/img]

There are $2014$ balls with $106$ different colors, $19$ of each color. Determine the least possible value of $n$ so that no matter how these balls are arranged around a circle, one can choose $n$ consecutive balls so that amongst them, there are $53$ balls with different colors.

A positive integer $n$ is called [i]good[/i] if for all positive integers $a$ which can be written as $a=n^2 \sum_{i=1}^n {x_i}^2$ where $x_1, x_2, \ldots ,x_n$ are integers, it is possible to express $a$ as $a=\sum_{i=1}^n {y_i}^2$ where $y_1, y_2, \ldots, y_n$ are integers with none of them is divisible by $n.$ Find all good numbers.

Points $A,B,C,D$ are on a circle with radius $R$. $|AC|=|AB|=500$, while the ratio between $|DC|, |DA|, |DB|$ is $1,5,7$. Find $R$.

Find all pairs of integers $(m,n)$ such that $m^6 = n^{n+1} + n -1$.

Consider solutions to the equation \[x^2-cx+1 = \dfrac{f(x)}{g(x)},\] where $f$ and $g$ are polynomials with nonnegative real coefficients. For each $c>0$, determine the minimum possible degree of $f$, or show that no such $f,g$ exist. [i]Proposed by Linus Hamilton and Calvin Deng[/i]

Let $p$ be a prime number and $a$ be an integer. Prove that if $2^p +3^p = a^n$ for some integer $n$, then $n = 1$.

The center of a square of side length $ 1$ is placed uniformly at random inside a circle of radius $ 1$. Given that we are allowed to rotate the square about its center, what is the probability that the entire square is contained within the circle for some orientation of the square?

A set $A$ of positive integers is called [i]uniform[/i] if, after any of its elements removed, the remaining ones can be partitioned into two subsets with equal sum of their elements. Find the least positive integer $n>1$ such that there exist a uniform set $A$ with $n$ elements.

Suppose the polynomial $P(x) \equiv x^3 + ax^2 + bx +c$ has only real zeroes and let $Q(x) \equiv 5x^2 - 16x + 2004$. Assume that $P(Q(x)) = 0$ has no real roots. Prove that $P(2004) > 2004$

We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n},\] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof. Prove that \[\sum_{k=1}^{n}[\alpha^{k}F_{k}+\frac{1}{2}]=F_{2n+1}\; \forall n>1.\]

Let $ABC$ be a scalene triangle with incenter $I$ and circumcircle $\omega$. The internal and external bisectors of angle $\angle BAC$ intersect $BC$ at $D$ and $E$, respectively. Let $M$ be the point on segment $AC$ such that $MC = MB$. The tangent to $\omega$ at $B$ meets $MD$ at $S$. The circumcircles of triangles $ADE$ and $BIC$ intersect each other at $P$ and $Q$. If $AS$ meets $\omega$ at a point $K$ other than $A$, prove that $K$ lies on $PQ$. [i]Proposed by Alexandru Lopotenco (Moldova)[/i]

If $a, b, c$ are non-zero reals, prove that $|\frac{b} {a}-\frac{b} {c}|+|\frac{c} {a}-\frac{c}{b}|+|bc+1|>1$.

Find the smallest positive integer $n$ for which there exist integers $x_{1} < x_{2} <...< x_{n}$ such that every integer from $1000$ to $2000$ can be written as a sum of some of the integers from $x_1,x_2,..,x_n$ without repetition.

A point $P$ is given on the curve $x^4+y^4=1$. Find the maximum distance from the point $P$ to the origin.

Show that the number $3$ can be written in a infinite number of different ways as the sum of the cubes of four integers.

The probability of drawing a red marble from a bag is $\frac{3}{5}$. After some red marbles are removed, the probability of drawing a red marble is $\frac{2}{7}$. What is the smallest number of marbles that could have originally been in the bag?

Regarding a natural number $n$, it is stated that the number $n^2$ has $7$ as the second to last digit. What is the last digit of $n^2$?

For each real number $k$, denote by $f(k)$ the larger of the two roots of the quadratic equation $$(k^2+1)x^2+10kx-6(9k^2+1)=0.$$Show that the function $f(k)$ attains a minimum and maximum and evaluate these two values.

In the triangle $ABC$ with circumcircle $\Gamma$, the incircle $\omega$ touches sides $BC, CA$, and $AB$ at $D, E$, and $F$, respectively. The line through $D$ perpendicular to $EF$ meets $\omega$ at $K\neq D$. Line $AK$ meets $\Gamma$ at $L\neq A$. Rays $KI$ and $IL$ meet the circumcircle of triangle $BIC$ at $Q\neq I$ and $P\neq I$, respectively. The circumcircles of triangles $KFB$ and $KEC$ meet $EF$ at $R\neq F$ and $S\neq E$, respectively. Prove that $PQRS$ is cyclic. [i]India, Anant Mugdal[/i]

In an acute-angled triangle $ABC$, the circle $S$ with the altitude $BK$ as the diameter intersects $AB$ at $E$ and $BC$ at $F$. Prove that the tangents to $S$ at $E$ and $F$ meet on the median from $B$.

Find the value of $ k\ (0<k<5)$ such that $ \int_0^{\infty} \frac{x^k}{2\plus{}4x\plus{}3x^2\plus{}5x^3\plus{}3x^4\plus{}4x^5\plus{}2x^6}\ dx$ is minimal.

$k(k>1)$ is an integer, and $a$ is a solution to the equation $x^2-kx+1=0$. For any integer $n(n>10)$, the last digit number of $a^{2^n}+a^{-2^n}$ is always $7$, then the last digit number of $k$ is________.

Alice is performing a magic trick. She has a standard deck of 52 cards, which she may order beforehand. She invites a volunteer to pick an integer \(0\le n\le 52\), and cuts the deck into a pile with the top \(n\) cards and a pile with the remaining \(52-n\). She then gives both piles to the volunteer, who riffles them together and hands the deck back to her face down. (Thus, in the resulting deck, the cards that were in the deck of size \(n\) appear in order, as do the cards that were in the deck of size \(52-n\).) Alice then flips the cards over one-by-one from the top. Before flipping over each card, she may choose to guess the color of the card she is about to flip over. She stops if she guesses incorrectly. What is the maximum number of correct guesses she can guarantee? [i]Proposed by Espen Slettnes[/i]