Assuming that $f(x)$ is continuous in the interval $(0,1)$, prove that $$\int_{x=0}^{x=1} \int_{y=x}^{y=1} \int_{z=x}^{z=y} f(x)f(y)f(z)\;dz dy dx= \frac{1}{6}\left(\int_{0}^{1} f(t)\; dt\right)^{3}.$$

Let $ M $ denote the set of the primitives of a function $ f:\mathbb{R}\longrightarrow\mathbb{R} . $ [b]ii)[/b] Show that $ M $ along with the operation $ *:M^2\longrightarrow M $ defined as $ F*G=F+G(2007) $ form a commutative group. [b]iii)[/b] Show that $ M $ is isomorphic with the additive group of real numbers.

Consider equation I: $x+y+z=46$ where $x, y,$ and $z$ are positive integers, and equation II: $x+y+z+w=46$, where $x, y, z,$ and $w$ are positive integers. Then $ \textbf{(A)}\ \text{I can be solved in consecutive integers} \qquad$ $\textbf{(B)}\ \text{I can be solved in consecutive even integers} \qquad$ $\textbf{(C)}\ \text{II can be solved in consecutive integers} \qquad$ $\textbf{(D)}\ \text{II can be solved in consecutive even integers} \qquad$ $\textbf{(E)}\ \text{II can be solved in consecutive odd integers} $

Determine the highest power of $2$ that divides $2^n!$.

Japanese businessman Rui lives in America and makes a living from trading cows. On Black Thursday he was selling his cows for $2000$ dollars each (the cows were of the same price), but after the financial crash there were huge fluctuations in the market and Rui was forced to follow them with his pricing. Every day he doubled, halved, multiplied by five or divided by five the price from the previous day (even if it meant he had to give change in cents). At the same time he managed to follow the Japanese superstition, so that the integer part of the price in dollars never started with digit $4$. On the day when Billy visited him to buy some cows the price of each cow was $80$ dollars. What is the minimal number of days that could have passed since Black Thursday by then?

Let $ABC$ and $A_{1}B_{1}C_{1}$ be two triangles. Prove that $\frac{a}{a_{1}}+\frac{b}{b_{1}}+\frac{c}{c_{1}}\leq\frac{3R}{2r_{1}}$, where $a = BC$, $b = CA$, $c = AB$ are the sidelengths of triangle $ABC$, where $a_{1}=B_{1}C_{1}$, $b_{1}=C_{1}A_{1}$, $c_{1}=A_{1}B_{1}$ are the sidelengths of triangle $A_{1}B_{1}C_{1}$, where $R$ is the circumradius of triangle $ABC$ and $r_{1}$ is the inradius of triangle $A_{1}B_{1}C_{1}$.

Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.

Let $n$ be the answer to this problem. Box $B$ initially contains n balls, and Box $A$ contains half as many balls as Box $B$. After $80$ balls are moved from Box $A$ to Box $B$, the ratio of balls in Box $A$ to Box $B$ is now $\frac{p}{q}$ , where $p$, $q$ are positive integers with gcd$(p, q) = 1$. Find $100p + q$.

If all $x_k$ ($k = 1, 2, 3, 4, 5)$ are positive reals, and $\{a_1,a_2, a_3, a_4, a_5\} = \{1, 2,3 , 4, 5\}$, find the maximum of $$\frac{(\sqrt{s_1x_1} +\sqrt{s_2x_2}+\sqrt{s_3x_3}+\sqrt{s_4x_4}+\sqrt{s_5x_5})^2}{a_1x_1 + a_2x_2 + a_3x_3 + a_4x_4 + a_5x_5}$$ ($s_k = a_1 + a_2 +... + a_k$)

A circular game board is divided into $n \ge 3$ sectors. Each sector is either empty or occupied by a marker. In each step one chooses an occupied sector, removes its marker and then switches each of the two adjacent sectors from occupied to empty or vice-versa. Starting with a single occupied sector, for which $n$ is it possible to end up with all empty sectors after finitely many steps?

The area of the figure enclosed by the $x$-axis, $y$-axis, and line $7x + 8y = 15$ can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

The diagonals $AC$ and $CE$ of the regular hexagon $ABCDEF$ are divided by inner points $M$ and $N$ respectively, so that \[ {AM\over AC}={CN\over CE}=r. \] Determine $r$ if $B,M$ and $N$ are collinear.

For a distributive lattice $ L$, consider the following two statements: (A) Every ideal of $ L$ is the kernel of at least two different homomorphisms. (B) $ L$ contains no maximal ideal. Which one of these statements implies the other? (Every homomorphism $ \varphi$ of $ L$ induces an equivalence relation on $ L$: $ a \sim b$ if and only if $ a \varphi\equal{}b \varphi$. We do not consider two homomorphisms different if they imply the same equivalence relation.) [i]J. Varlet, E. Fried[/i]

Let $(a_{n})_{n=1}^{\infty}$ be a sequence of positive real numbers defined by $a_{1}=1$, $a_{2}=2$ and $$\frac{a_{n+1}^{4}}{a_{n}^3} = 2a_{n+2}-a_{n+1}.$$ Prove that the following inequality holds for every positive integer $N>1$: $$\sum_{k=1}^{N}\frac{a_{k}^{2}}{a_{k+1}}<3.$$ [i]Note: The bound is not sharp.[/i] [i]Authored by Nikola Velov[/i]

Let $ l_i,$ $ i \equal{} 1,2,3$ be three non-collinear straight lines in the plane, which build a triangle, and $ f_i$ the axial reflections in $ l_i$. Prove that for each point $ P$ in the plane there exists finite interconnections (compositions) of the reflections of $ f_i$ which carries $ P$ into the triangle built by the straight lines $ l_i,$ i.e. maps that point to a point interior to the triangle.

In a triangle with sides $a, b, c$ the side $a$ is the arithmetic mean of $b$ and $c$. Prove that: a) $0^o \le A \le 60^o$. b) The height relative to side $a$ is three times the inradius $r$. c) The distance from the circumcenter to side $a$ is $R - r$, where $R$ is the circumradius.

Given is a grid with $2$ rows and $120$ columns, such that each cell has a number from the set $1, 2, ..., 120$. It is known that in each column, the upper number in it is smaller than the lower number, and in each row, the numbers are in non-strict increasing order from left to right. Prove that the number of these tables is multiple of $239$.

If $\alpha$ and $\beta$ are the roots of the equation $3x^2+x-1=0$, where $\alpha>\beta$, find the value of $\frac{\alpha}{\beta}+\frac{\beta}{\alpha}$. $ \textbf{(A) }\frac{7}{9}\qquad\textbf{(B) }-\frac{7}{9}\qquad\textbf{(C) }\frac{7}{3}\qquad\textbf{(D) }-\frac{7}{3}\qquad\textbf{(E) }-\frac{1}{9} $

Given points $A, B, C, D, E$, and $F$ on a line (not necessarily in that order) with $AB = 2$, $BC = 6$, $CD = 8$, $DE = 10$, $EF = 20$, and $FA = 22$. Find the distance between the two furthest points on the line.

Some cards each have a pair of numbers written on them. There is just one card for each pair $(a,b)$ with $1 \leq a < b \leq 2003$. Two players play the following game. Each removes a card in turn and writes the product $ab$ of its numbers on the blackboard. The first player who causes the greatest common divisor of the numbers on the blackboard to fall to $1$ loses. Which player has a winning strategy?

The function $f(x)$ is defined on the reals such that $$f\left(\frac{1-4x}{4-x}\right) = 4-xf(x)$$ for all $x \ne 4$. There exists two distinct real numbers $a, b \ne 4$ such that $f(a) = f(b) = \frac{5}{2}$. $a+b$ can be represented as $\frac{p}{q}$ where $p, q$ are relatively prime positive integers. Find $10p + q$.

Three concentric circles have radii $3$, $4$, and $5$. An equilateral triangle with one vertex on each circle has side length $s$. The largest possible area of the triangle can be written as $a+\frac{b}{c}\sqrt{d}$, where $a,b,c$ and $d$ are positive integers, $b$ and $c$ are relatively prime, and $d$ is not divisible by the square of any prime. Find $a+b+c+d$.

Let $ABC$ be an acute triangle.The lines $l_1$ and $l_2$ are perpendicular to $AB$ at the points $A$ and $B$, respectively.The perpendicular lines from the midpoint $M$ of $AB$ to the lines $AC$ and $BC$ intersect $l_1$ and $l_2$ at the points $E$ and $F$, respectively.If $D$ is the intersection point of the lines $EF$ and $MC$, prove that \[\angle ADB = \angle EMF.\]

[u]Set 2[/u] [b]2.1[/b] What is the last digit of $2022 + 2022^{2022} + 2022^{(2022^{2022})}$? [b]2.2[/b] Let $T$ be the answer to the previous problem. CMIMC executive members are trying to arrange desks for CMWMC. If they arrange the desks into rows of $5$ desks, they end up with $1$ left over. If they instead arrange the desks into rows of $7$ desks, they also end up with $1$ left over. If they instead arrange the desks into rows of $11$ desks, they end up with $T$ left over. What is the smallest possible (non-negative) number of desks they could have? [b]2.3[/b] Let $T$ be the answer to the previous problem. Compute the largest value of $k$ such that $11^k$ divides $$T! = T(T - 1)(T - 2)...(2)(1).$$ PS. You should use hide for answers.

An isosceles right triangle with legs of length $8$ is partitioned into $16$ congruent triangles as shown. The shaded area is [asy] for (int a=0; a <= 3; ++a) { for (int b=0; b <= 3-a; ++b) { fill((a,b)--(a,b+1)--(a+1,b)--cycle,grey); } } for (int c=0; c <= 3; ++c) { draw((c,0)--(c,4-c),linewidth(1)); draw((0,c)--(4-c,c),linewidth(1)); draw((c+1,0)--(0,c+1),linewidth(1)); } label("$8$",(2,0),S); label("$8$",(0,2),W); [/asy] $\text{(A)}\ 10 \qquad \text{(B)}\ 20 \qquad \text{(C)}\ 32 \qquad \text{(D)}\ 40 \qquad \text{(E)}\ 64$