i) If $b^2+c^2=a^2, \,\,\,\, b\ne \pm c$ , calculate the expression $\frac{b^3+c^3}{b+c}+\frac{b^3-c^3}{b-c}$. ii) If $a+\frac{1}{a}=k, a\ne 0$, find the expression $a^4+\frac{1}{a^4}$ in terms of $k$.

Determine all integers $n>1$ whose positive divisors add up to a power of $3.$ [i]Andrei Bâra[/i]

Let $f:\mathbb{R}\to (0;+\infty )$ be a continuous function such that $\underset{x\to -\infty }{\mathop{\lim }}\,f(x)=\underset{x\to +\infty }{\mathop{\lim }}\,f(x)=0.$ a) Prove that $f(x)$ has the maximum value on $\mathbb{R}.$ b) Prove that there exist two sequeneces $({{x}_{n}}),({{y}_{n}})$ with ${{x}_{n}}<{{y}_{n}},\forall n=1,2,3,...$ such that they have the same limit when $n$ tends to infinity and $f({{x}_{n}})=f({{y}_{n}})$ for all $n.$

Let $f$ be any function that maps the set of real numbers into the set of real numbers. Prove that there exist real numbers $x$ and $y$ such that \[f\left(x-f(y)\right)>yf(x)+x\] [i]Proposed by Igor Voronovich, Belarus[/i]

The figure $ABCD$ is bounded by a semicircle $CDA$ and a quarter circle $ABC$. Given that the distance from $A$ to $C$ is $18$, find the area of the figure. [asy] size(200); defaultpen(linewidth(0.8)); pair A=(-9,0),B=(0,9*sqrt(2)-9),C=(9,0),D=(0,9); dot(A^^B^^C^^D); draw(arc(origin,9,0,180)^^arc((0,-9),9*sqrt(2),45,135)); label("$A$",A,S); label("$B$",B,N); label("$C$",C,S); label("$D$",D,N); [/asy]

Initially, the numbers $1$ and $2$ are written on the board. A move consists of choosing a positive real number $x$ and replacing $(a,b)$ on the board by $\left(a+\frac{x}{b},b+\frac{x}{a}\right)$. Is it possible to create in finitely many moves a situation where the numbers on the board are $2$ and $3$?

Given a $2n \times 2m$ table $(m,n \in \mathbb{N})$ with one of two signs ”+” or ”-” in each of its cells. A union of all the cells of some row and some column is called a cross. The cell on the intersectin of this row and this column is called the center of the cross. The following procedure we call a transformation of the table: we mark all cells which contain ”−” and then, in turn, we replace the signs in all cells of the crosses which centers are marked by the opposite signs. (It is easy to see that the order of the choice of the crosses doesn’t matter.) We call a table attainable if it can be obtained from some table applying such transformations one time. Find the number of all attainable tables.

For every integer $ a>1$ an infinite list of integers is constructed $ L(a)$, as follows: [list] $ a$ is the first number in the list $ L(a)$.[/list] [list] Given a number $ b$ in $ L(a)$, the next number in the list is $ b\plus{}c$, where $ c$ is the largest integer that divides $ b$ and is smaller than $ b$.[/list] Find all the integers $ a>1$ such that $ 2002$ is in the list $ L(a)$.

The expression $\sin2^\circ\sin4^\circ\sin6^\circ\cdots\sin90^\circ$ is equal to $p\sqrt{5}/2^{50}$, where $p$ is an integer. Find $p$.

Jonathan and Justin each flip a coin eight times. Jonathan and Justin get $m, n$ heads respectively. What is the probability that the difference of that $|m-n| \equiv 0 $ mod $4$? [i]Lightning 3.4[/i]

Squares of an $n \times n$ table ($n \ge 3$) are painted black and white as in a chessboard. A move allows one to choose any $2 \times 2$ square and change all of its squares to the opposite color. Find all such n that there is a finite number of the moves described after which all squares are the same color.

Jamal wants to store $ 30$ computer files on floppy disks, each of which has a capacity of $ 1.44$ megabytes (MB). Three of his files require $ 0.8$ MB of memory each, $ 12$ more require $ 0.7$ MB each, and the remaining $ 15$ require $ 0.4$ MB each. No file can be split between floppy disks. What is the minimal number of floppy disks that will hold all the files? $ \textbf{(A)}\ 12 \qquad \textbf{(B)}\ 13 \qquad \textbf{(C)}\ 14 \qquad \textbf{(D)}\ 15 \qquad \textbf{(E)}\ 16$

In each box of a $9\times 9$ grid we write a positive integer such that, between any $2$ boxes on the same row or column that have the same number $n$ written, there's at least $n$ boxes between them. What is the minimum sum possible for the numbers on the grid?

Let $$a_k = 0.\overbrace{0 \ldots 0}^{k - 1 \: 0's} 1 \overbrace{0 \ldots 0}^{k - 1 \: 0's} 1$$ The value of $\sum_{k = 1}^\infty a_k$ can be expressed as a rational number $\frac{p}{q}$ in simplest form. Find $p + q$.

Let $p$ be an odd prime integer and $k$ a positive integer not divisible by $p$, $1\le k<2(p+1)$, and let $N=2kp+1$. Prove that the following statements are equivalent: (i) $N$ is a prime number (ii) there exists a positive integer $a$, $2\le a<n$, such that $a^{kp}+1$ is divisible by $N$ and $\gcd\left(a^k+1,N\right)=1$.

An infinite road has traffic lights at intervals of 1500m. The lights are all synchronised and are alternately green for $\frac 32$ minutes and red for 1 minute. For which $v$ can a car travel at a constant speed of $v$m/s without ever going through a red light?

Let $a$, $b$, $c$ be positive real numbers. Determine the minimum value of the following expression $$ \frac{a^2+2b^2+4c^2}{b(a+2c)}$$

Let $ABC$ be a scalene, non-right triangle. Let $\omega$ be the incircle and let $\gamma$ be the nine-point circle (the circle through the feet of the altitudes) of $\triangle ABC$, with centers $I$ and $N$, respectively. Suppose $\omega$ and $\gamma$ are tangent at a point $F$. Let $D$ be the foot of the perpendicular from $A$ to line $BC$ and let $M$ be the midpoint of side $\overline{BC}$. The common tangent to $\omega$ and $\gamma$ at $F$ intersects lines $AB$ and $AC$ at points $P$ and $Q$, respectively. Let lines $DP$ and $DQ$ intersect $\gamma$ at points $P_1 \neq D$ and $Q_1 \neq D$, respectively. Suppose that point $Z$ lies on line $P_1Q_1$ such that $\angle MFZ=90^{\circ}$ and $MZ \perp DF$. Suppose that $\gamma$ has radius 11 and $\omega$ has radius 5. Then $DI=\frac{k\sqrt{m}}{n}$, where $k,m,$ and $n$ are positive integers such that $\gcd(k,n)=1$ and $m$ is not divisible by the square of any prime. Compute $100k+10m+n$. [i]Proposed by Luke Robitaille[/i]

Find all polynomyals $P(x)$ with real coefficients which satisfy the following equality for all real numbers $x$: \[ P(x^2)+x(3P(x)+P(-x))=(P(x))^2+2x^2 . \]

Mark $4 \cdot k$ points in a circle and number them arbitrarily with numbers from $1$ to $4 \cdot k$. The chords cannot share common endpoints, also, the endpoints of these chords should be among the $4 \cdot k$ points. [b]i.[/b] Prove that $2 \cdot k$ pairwisely non-intersecting chords can be drawn for each of whom its endpoints differ in at most $3 \cdot k - 1$. [b]ii.[/b] Prove that the $3 \cdot k - 1$ cannot be improved.

Given is an acute triangle $ABC$ $\left(AB<AC<BC\right)$,inscribed in circle $c(O,R)$.The perpendicular bisector of the angle bisector $AD$ $\left(D\in BC\right)$ intersects $c$ at $K,L$ ($K$ lies on the small arc $\overarc{AB}$).The circle $c_1(K,KA)$ intersects $c$ at $T$ and the circle $c_2(L,LA)$ intersects $c$ at $S$.Prove that $\angle{BAT}=\angle{CAS}$. [hide=Diagram][asy]import graph; size(10cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -6.94236331697463, xmax = 15.849400903703716, ymin = -5.002235438802758, ymax = 7.893104843949444; /* image dimensions */ pen aqaqaq = rgb(0.6274509803921569,0.6274509803921569,0.6274509803921569); pen uququq = rgb(0.25098039215686274,0.25098039215686274,0.25098039215686274); pen qqqqtt = rgb(0.,0.,0.2); draw((1.8318261909633622,3.572783369254345)--(0.,0.)--(6.,0.)--cycle, aqaqaq); draw(arc((1.8318261909633622,3.572783369254345),0.6426249310341638,-117.14497824050169,-101.88970202103212)--(1.8318261909633622,3.572783369254345)--cycle, qqqqtt); draw(arc((1.8318261909633622,3.572783369254345),0.6426249310341638,-55.85706977865775,-40.60179355918817)--(1.8318261909633622,3.572783369254345)--cycle, qqqqtt); /* draw figures */ draw((1.8318261909633622,3.572783369254345)--(0.,0.), uququq); draw((0.,0.)--(6.,0.), uququq); draw((6.,0.)--(1.8318261909633622,3.572783369254345), uququq); draw(circle((3.,0.7178452373968209), 3.0846882800136055)); draw((2.5345020274407277,0.)--(1.8318261909633622,3.572783369254345)); draw(circle((-0.01850947366601585,1.3533783539547308), 2.889550258039566)); draw(circle((5.553011501106743,2.4491551634556963), 3.887127532933951)); draw((-0.01850947366601585,1.3533783539547308)--(5.553011501106743,2.4491551634556963), linetype("2 2")); draw((1.8318261909633622,3.572783369254345)--(0.7798408954511686,-1.423695174396108)); draw((1.8318261909633622,3.572783369254345)--(5.22015910454883,-1.4236951743961088)); /* dots and labels */ dot((1.8318261909633622,3.572783369254345),linewidth(3.pt) + dotstyle); label("$A$", (1.5831274347452782,3.951671933606579), NE * labelscalefactor); dot((0.,0.),linewidth(3.pt) + dotstyle); label("$B$", (-0.6,0.05), NE * labelscalefactor); dot((6.,0.),linewidth(3.pt) + dotstyle); label("$C$", (6.188606107156787,0.07450151636712989), NE * labelscalefactor); dot((2.5345020274407277,0.),linewidth(3.pt) + dotstyle); label("$D$", (2.3,-0.7), NE * labelscalefactor); dot((-0.01850947366601585,1.3533783539547308),linewidth(3.pt) + dotstyle); label("$K$", (-0.3447473583572136,1.6382221818835927), NE * labelscalefactor); dot((5.553011501106743,2.4491551634556963),linewidth(3.pt) + dotstyle); label("$L$", (5.631664500260511,2.580738747400365), NE * labelscalefactor); dot((0.7798408954511686,-1.423695174396108),linewidth(3.pt) + dotstyle); label("$T$", (0.5977692071595602,-1.960477431907719), NE * labelscalefactor); dot((5.22015910454883,-1.4236951743961088),linewidth(3.pt) + dotstyle); label("$S$", (5.160406217502124,-1.8747941077698307), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy][/hide]

Let $ABC$ be a triangle with $\angle BAC=60$. Let $B_1$ and $C_1$ be the feet of the bisectors from $B$ and $C$. Let $A_1$ be the symmetrical of $A$ according to line $B_1C_1$. Prove that $A_1, B, C$ are colinear.

Which of these numbers is the largest? $\textbf{(A)} \sqrt{\sqrt[3]{5\cdot 6}}\qquad \textbf{(B)} \sqrt{6\sqrt[3]{5}}\qquad \textbf{(C)} \sqrt{5\sqrt[3]{6}}\qquad \textbf{(D)} \sqrt[3]{5\sqrt{6}}\qquad \textbf{(E)} \sqrt[3]{6\sqrt{5}}$

Six teams participate in a hockey tournament. Each team plays exactly once against each other team. A team is awarded $3$ points for each game they win, $1$ point for each draw, and $0$ points for each game they lose. After the tournament, a ranking is made. There are no ties in the list. Moreover, it turns out that each team (except the very last team) has exactly $2$ points more than the team ranking one place lower. Prove that the team that finished fourth won exactly two games.

A deck of forty cards consists of four 1's, four 2's,..., and four 10's. A matching pair (two cards with the same number) is removed from the deck. Given that these cards are not returned to the deck, let $m/n$ be the probability that two randomly selected cards also form a pair, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$