For which integers $ n>1$ do there exist natural numbers $ b_1,b_2,\ldots,b_n$ not all equal such that the number $ (b_1\plus{}k)(b_2\plus{}k)\cdots(b_n\plus{}k)$ is a power of an integer for each natural number $ k$? (The exponents may depend on $ k$, but must be greater than $ 1$)

Chords $BC$ and $DE$ of circle $\omega$ meet at point $A$. The line through $D$ parallel to $BC$ meets $\omega$ again at $F$, and $FA$ meets $\omega$ again at $T$. Let $M = ET \cap BC$ and let $N$ be the reflection of $A$ over $M$. Show that $(DEN)$ passes through the midpoint of $BC$.

A [i]stick[/i] is defined as a $1 \times k$ or $k\times 1$ rectangle for any integer $k \ge 1$. We wish to partition the cells of a $2022 \times 2022$ chessboard into $m$ non-overlapping sticks, such that any two of these $m$ sticks share at most one unit of perimeter. Determine the smallest $m$ for which this is possible. [i]Holden Mui[/i]

Let $ABCD$ be the regular tetrahedron, and $M, N$ points in space. Prove that: $AM \cdot AN + BM \cdot BN + CM \cdot CN \geq DM \cdot DN$

For $ \frac {1}{e} < t < 1$, find the minimum value of $ \int_0^1 |xe^{ \minus{} x} \minus{} tx|dx$.

There are $10$ cups, each having $10$ pebbles in them. Two players $A$ and $B$ play a game, repeating the following in order each move: $\bullet$ $B$ takes one pebble from each cup and redistributes them as $A$ wishes. $\bullet$ After $B$ distributes the pebbles, he tells how many pebbles are in each cup to $A$. Then $B$ destroys all the cups having no pebbles. $\bullet$ $B$ switches the places of two cups without telling $A$. After finitely many moves, $A$ can guarantee that $n$ cups are destroyed. Find the maximum possible value of $n$. (Note that $A$ doesn't see the cups while playing.) [i]Proposed by Emre Osman[/i]

Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that $2f(x^2+y^2)=(x+f(y))^2+f(x-f(y))^2$ for all $x,y\in\mathbb{R}$.

Let $a=1111\dots1111$ and $b=1111\dots1111$ where $a$ has forty ones and $b$ has twelve ones. Determine the greatest common divisor of $a$ and $b$.

Two circles intersect at points $A\neq B$. A line passing through $A{}$ intersects the circles again at $C$ and $D$. Let $E$ and $F$ be the midpoints of the arcs $\overarc{BC}$ and $\overarc{BD}$ which do not contain $A{}$ and let $M$ be the midpoint of the segment $CD$. Prove that $ME$ and $MF$ are perpendicular.

Suppose $P (x)$ is a polynomial with real coefficients such that $P (t) = P (1)t^2 + P (P (1))t + P (P (P (1)))$ for all real numbers $t$. Compute the largest possible value of $P(P(P(P(1))))$.

Let $P(x)$ be a nonzero quadratic polynomial such that $P(1) = P(2) = 0$. Given that $P(3)^2 = P(4)+P(5)$, find $P(6)$. [i]Proposed by Andy Xu[/i]

For a positive integer $n$, $S_n$ is the set of positive integer $n$-tuples $(a_1,a_2, \cdots ,a_n)$ which satisfies the following. (i). $a_1=1$. (ii). $a_{i+1} \le a_i+1$. For $k \le n$, define $N_k$ as the number of $n$-tuples $(a_1, a_2, \cdots a_n) \in S_n$ such that $a_k=1, a_{k+1}=2$. Find the sum $N_1 + N_2+ \cdots N_{k-1}$.

Prove that there are infinite many positive integers $ n$ such that $ n^2\plus{}1\mid n!$, and infinite many of those for which $ n^2\plus{}1 \nmid n!$.

Let $ f:[0,2]\longrightarrow \mathbb{R} $ a differentiable function having a continuous derivative and satisfying $ f(0)=f(2)=1 $ and $ |f’|\le 1. $ Show that $$ \left| \int_0^2 f(t) dt\right| >1. $$

Find all couples of positive integers $m$ and $n$ such that $$n!+5=m^3$$

Suppose we have a necklace of $n$ beads. Each bead is labelled with an integer and the sum of all these labels is $n-1$. Prove that we can cut the necklace to form a string whose consecutive labels $x_1, x_2,\cdots , x_n$ satisfy \[ \sum_{i=1}^{k}x_i\le k-1\quad \forall \;\;1\le k\le n \]

Find, with proof, all integers $n$ such that there is a solution in nonnegative real numbers $(x,y,z)$ to the system of equations \[2x^2+3y^2+6z^2=n\text{ and }3x+4y+5z=23.\]

Prove that there are at least $666$ positive composite numbers with $2006$ digits, having a digit equal to $7$ and all the rest equal to $1$.

Find all positive integers $ n$ for which the numbers in the set $ S \equal{} \{1,2, \ldots,n \}$ can be colored red and blue, with the following condition being satisfied: The set $ S \times S \times S$ contains exactly $ 2007$ ordered triples $ \left(x, y, z\right)$ such that: [b](i)[/b] the numbers $ x$, $ y$, $ z$ are of the same color, and [b](ii)[/b] the number $ x \plus{} y \plus{} z$ is divisible by $ n$. [i]Author: Gerhard Wöginger, Netherlands[/i]

Using the letters $ A$, $ M$, $ O$, $ S$, and $ U$, we can form $ 120$ five-letter "words". If these "words" are arranged in alphabetical order, then the "word" $ USAMO$ occupies position $ \textbf{(A)}\ 112 \qquad \textbf{(B)}\ 113 \qquad \textbf{(C)}\ 114 \qquad \textbf{(D)}\ 115 \qquad \textbf{(E)}\ 116$

Is it possible that a set consisting of $23$ real numbers has a property that the number of the nonempty subsets whose product of the elements is rational number is exactly $2422$?

Isabella has a sheet of paper in the shape of a right triangle with sides of length 3, 4, and 5. She cuts the paper into two pieces along the altitude to the hypotenuse, and randomly picks one of the two pieces to discard. She then repeats the process with the other piece (since it is also in the shape of a right triangle), cutting it along the altitude to its hypotenuse and randomly discarding one of the two pieces once again, and continues doing this forever. As the number of iterations of this process approaches infinity, the total length of the cuts made in the paper approaches a real number $l$. Compute $[\mathbb{E}(l)]^2$, that is, the square of the expected value of $l$. [i]Proposed by Matthew Kroesche[/i]

From a two-digit number $ N$ we subtract the number with the digits reversed and find that the result is a positive perfect cube. Then: $ \textbf{(A)}\ {N}\text{ cannot end in 5}\qquad\\ \textbf{(B)}\ {N}\text{ can end in any digit other than 5}\qquad \\ \textbf{(C)}\ {N}\text{ does not exist}\qquad \\ \textbf{(D)}\ \text{there are exactly 7 values for }{N}\qquad \\ \textbf{(E)}\ \text{there are exactly 10 values for }{N}$

Find all functions $f : R\to R$ satisfying $xf(x + xy) = xf(x) + f(x^2)f(y)$ for all $x, y \in R$.

For how many positive integers $ n$ less than or equal to $ 24$ is $ n!$ evenly divisible by $ 1 \plus{} 2 \plus{} \dots \plus{} n$? $ \textbf{(A)}\ 8\qquad \textbf{(B)}\ 12\qquad \textbf{(C)}\ 16\qquad \textbf{(D)}\ 17\qquad \textbf{(E)}\ 21$