Determine the number of subset $S$ of the set $T = {1, 2,..., 2005}$ such that the sum of elements in $s$ is congruent to 2006 modulo 2048.

Show that there is no continuous function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for every real number $x$ \[f(x-f(x)) = \dfrac x2.\]

Eddy is traveling to England and needs to exchange USD to GBP (US dollars to British pounds). The current exchange rate is $1.3$ USD for $1$ GBP. He exchanges $x$ USD to GBP and while in England, uses $\tfrac{x}{2}$ GBP. When he returns, the value of the British pound has changed so that $1$ GBP equals $\alpha$ USD. After exchanging all his remaining GBP, he notes that he has $\tfrac{x}{2}$ USD left. What is $\alpha$?

You are given a positive integer $n > 1$. What is the largest possible number of integers that can be chosen from the set $\{1, 2, 3, \ldots, 2^n\}$ so that for any two different chosen integers $a, b$, the value $a^k + b^k$ is not divisible by $2^n$ for any positive integer $k$? [i]Proposed by Oleksii Masalitin[/i]

The cells of an $n \times n$ chessboard are coloured in several colours so that no $2\times 2$ square contains four cells of the same colour. A [i]proper path [/i] of length $m$ is a sequence $a_1,a_2,..., a_m$ of distinct cells in which the cells $a_i$ and $a_{i+1}$ have a common side and are coloured in different colours for all $1 \le i < m$. Show that there exists a proper path of length $n$.

Let $a,b,c$ be positive integers such that $a|b^2, b|c^2$ and $c|a^2$. Prove that $abc|(a+b+c)^{7}$

Each square in a $3 \times 3$ grid is randomly filled with one of the $4$ gray-and-white tiles shown below on the right.[asy] size(5.663333333cm); draw((0,0)--(3,0)--(3,3)--(0,3)--cycle,gray); draw((1,0)--(1,3)--(2,3)--(2,0),gray); draw((0,1)--(3,1)--(3,2)--(0,2),gray); fill((6,.33)--(7,.33)--(7,1.33)--cycle,mediumgray); draw((6,.33)--(7,.33)--(7,1.33)--(6,1.33)--cycle,gray); fill((6,1.67)--(7,2.67)--(6,2.67)--cycle,mediumgray); draw((6,1.67)--(7,1.67)--(7,2.67)--(6,2.67)--cycle,gray); fill((7.33,.33)--(8.33,.33)--(7.33,1.33)--cycle,mediumgray); draw((7.33,.33)--(8.33,.33)--(8.33,1.33)--(7.33,1.33)--cycle,gray); fill((8.33,1.67)--(8.33,2.67)--(7.33,2.67)--cycle,mediumgray); draw((7.33,1.67)--(8.33,1.67)--(8.33,2.67)--(7.33,2.67)--cycle,gray); [/asy] What is the probability that the tiling will contain a large gray diamond in one of the smaller $2\times 2$ grids? Below is an example of one such tiling. [asy] size(2cm); fill((1,0)--(0,1)--(0,2)--(1,1)--cycle,mediumgray); fill((2,0)--(3,1)--(2,2)--(1,1)--cycle,mediumgray); fill((1,2)--(1,3)--(0,3)--cycle,mediumgray); fill((1,2)--(2,2)--(2,3)--cycle,mediumgray); fill((3,2)--(3,3)--(2,3)--cycle,mediumgray); draw((0,0)--(3,0)--(3,3)--(0,3)--cycle,gray); draw((1,0)--(1,3)--(2,3)--(2,0),gray); draw((0,1)--(3,1)--(3,2)--(0,2),gray); [/asy] $\textbf{(A) } \frac{1}{1024} \qquad \textbf{(B) } \frac{1}{256} \qquad \textbf{(C) } \frac{1}{64} \qquad \textbf{(D) } \frac{1}{16} \qquad \textbf{(E) } \frac{1}{4}$

Prove that any integer greater than or equal to $7$ can be written as a sum of two relatively prime integers, both greater than 1. (Two integers are relatively prime if they share no common positive divisor other than $1$. For example, $22$ and 15 are relatively prime, and thus $37 = 22+15$ represents the number 37 in the desired way.)

Let $ x$, $ y$, and $ z$ be non-negative real numbers satisfying $ x \plus{} y \plus{} z \equal{} 1$. Show that \[ x^2 y \plus{} y^2 z \plus{} z^2 x \leq \frac {4}{27} \] and find when equality occurs.

Given a triangle $ \triangle{ABC} $ with orthocenter $ H $. On its circumcenter, choose an arbitrary point $ P $ (other than $ A,B,C $) and let $ M $ be the mid-point of $ HP $. Now, we find three points $ D,E,F $ on the line $ BC, CA, AB $, respectively, such that $ AP \parallel HD, BP \parallel HE, CP \parallel HF $. Show that $ D, E, F, M $ are colinear.

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

Find the smallest positive integer $n$ such that \[0< \sqrt[4]{n}-\lfloor \sqrt[4]{n}\rfloor < 0.00001.\]

Let $k$ be a positive integer, and let $a,b$ and $c$ be positive real numbers. Show that \[a(1-a^k)+b(1-(a+b)^k)+c(1-(a+b+c)^k)<\frac{k}{k+1}.\] [i]* * *[/i]

Given positive integers $m$, $a$, $b$, $(a,b)=1$. $A$ is a non-empty subset of the set of all positive integers, so that for every positive integer $n$ there is $an \in A$ and $bn \in A$. For all $A$ that satisfy the above condition, find the minimum of the value of $\left| A \cap \{ 1,2, \cdots,m \} \right|$

In triangle $ABC$, $P$ is a point on altitude $AD$. $Q,R$ are the feet of the perpendiculars from $P$ to $AB,AC$, and $QP,RP$ meet $BC$ at $S$ and $T$ respectively. the circumcircles of $BQS$ and $CRT$ meet $QR$ at $X,Y$. a) Prove $SX,TY, AD$ are concurrent at a point $Z$. b) Prove $Z$ is on $QR$ iff $Z=H$, where $H$ is the orthocenter of $ABC$. [i]Ray Li.[/i]

In the right triangle $ABC$ with hypotenuse $AB$, the incircle touches $BC$ and $AC$ at points ${{A}_{1}}$ and ${{B}_{1}}$ respectively. The straight line containing the midline of $\Delta ABC$ , parallel to $AB$, intersects its circumcircle at points $P$ and $T$. Prove that points $P,T,{{A}_{1}}$ and ${{B}_{1}}$ lie on one circle.

All possible vertical lines $x = k$ and horizontal lines $y = m$ are drawn on the coordinate plane, where $k$ and $m$ are integers. Let's imagine that all these straight lines are black. A red straight line is also drawn, the equation of which is $19x+96y= c$. Let us denote by $M$ the number of segments of different lengths formed on the red line when intersecting with the black ones.(The ends of each segment are the intersection points of the red and black lines. There are no such intersection points inside the segment.) What values can $M$ take when $c$ changes?

On the bisector of the angle $ BAC $ of the triangle $ ABC $ we choose the points $ {{B} _ {1}}, \, \, {{C} _ {1}} $ for which $ B {{B} _ {1 }}\perp AB $, $ C {{C} _ {1}} \perp AC $. The point $ M $ is the midpoint of the segment $ {{B} _ {1}} {{C} _ {1}} $. Prove that $ MB = MC $.

Let $AB$ be a diameter of a circle and let $C$ be a point on the segement $AB$ such that $AC : CB = 6 : 7$. Let $D$ be a point on the circle such that $DC$ is perpendicular to $AB$. Let $DE$ be the diameter through $D$. If $[XYZ]$ denotes the area of the triangle $XYZ$, find $[ABD]/[CDE]$ to the nearest integer.

(Game) At the beginning of the game the organisers place $4$ piles of paper disks onto the table. The player who is in turn takes away a pile, then divides one of the remaining piles into two nonempty piles. Whoever is unable to move, loses. [i]Defeat the organisers in this game twice in a row! A starting position will be given and then you can decide whether you want to go first or second.[/i]

For any two positive integers $n>m$ prove the following inequality: $$[m,n]+[m+1,n+1]\geq \dfrac{2nm}{\sqrt{m-n}}$$ As always, $[x,y]$ means the least common multiply of $x,y$. [I]Proposed by A. Golovanov[/i]

Let $ABC$ be an acute triangle inscribed in a circle centered at $O$. Let $M$ be a point on the small arc $AB$ of the triangle's circumcircle. The perpendicular dropped from $M$ on the ray $OA$ intersects the sides $AB$ and $AC$ at the points $K$ and $L$, respectively. Similarly, the perpendicular dropped from $M$ on the ray $OB$ intersects the sides $AB$ and $BC$ at $N$ and $P$, respectively. Assume that $KL=MN$. Find the size of the angle $\angle{MLP}$ in terms of the angles of the triangle $ABC$.

Given an acute triangle $ABC$ ($AC\ne AB$) and let $(C)$ be its circumcircle. The excircle $(C_1)$ corresponding to the vertex $A$, of center $I_a$, tangents to the side $BC$ at the point $D$ and to the extensions of the sides $AB,AC$ at the points $E,Z$ respectively. Let $I$ and $L$ are the intersection points of the circles $(C)$ and $(C_1)$, $H$ the orthocenter of the triangle $EDZ$ and $N$ the midpoint of segment $EZ$. The parallel line through the point $l_a$ to the line $HL$ meets the line $HI$ at the point $G$. Prove that the perpendicular line $(e)$ through the point $N$ to the line $BC$ and the parallel line $(\delta)$ through the point $G$ to the line $IL$ meet each other on the line $HI_a$.

[b]p1.[/b] What is the smallest positive integer $x$ such that $\frac{1}{x} <\sqrt{12011} - \sqrt{12006}$? [b]p2. [/b] Two soccer players run a drill on a $100$ foot by $300$ foot rectangular soccer eld. The two players start on two different corners of the rectangle separated by $100$ feet, then run parallel along the long edges of the eld, passing a soccer ball back and forth between them. Assume that the ball travels at a constant speed of $50$ feet per second, both players run at a constant speed of $30$ feet per second, and the players lead each other perfectly and pass the ball as soon as they receive it, how far has the ball travelled by the time it reaches the other end of the eld? [b]p3.[/b] A trapezoid $ABCD$ has $AB$ and $CD$ both perpendicular to $AD$ and $BC =AB + AD$. If $AB = 26$, what is $\frac{CD^2}{AD+CD}$ ? [b]p4.[/b] A hydrophobic, hungry, and lazy mouse is at $(0, 0)$, a piece of cheese at $(26, 26)$, and a circular lake of radius $5\sqrt2$ is centered at $(13, 13)$. What is the length of the shortest path that the mouse can take to reach the cheese that also does not also pass through the lake? [b]p5.[/b] Let $a, b$, and $c$ be real numbers such that $a + b + c = 0$ and $a^2 + b^2 + c^2 = 3$. If $a^5 + b^5 + c^5\ne 0$, compute $\frac{(a^3+b^3+c^3)(a^4+b^4+c^4)}{a^5+b^5+c^5}$. [b]p6. [/b] Let $S$ be the number of points with integer coordinates that lie on the line segment with endpoints $\left( 2^{2^2}, 4^{4^4}\right)$ and $\left(4^{4^4}, 0\right)$. Compute $\log_2 (S - 1)$. [b]p7.[/b] For a positive integer $n$ let $f(n)$ be the sum of the digits of $n$. Calculate $$f(f(f(2^{2006})))$$ [b]p8.[/b] If $a_1, a_2, a_3, a_4$ are roots of $x^4 - 2006x^3 + 11x + 11 = 0$, find $|a^3_1 + a^3_2 + a^3_3 + a^3_4|$. [b]p9.[/b] A triangle $ABC$ has $M$ and $N$ on sides $BC$ and $AC$, respectively, such that $AM$ and $BN$ intersect at $P$ and the areas of triangles $ANP$, $APB$, and $PMB$ are $5$, $10$, and $8$ respectively. If $R$ and $S$ are the midpoints of $MC$ and $NC$, respectively, compute the area of triangle $CRS$. [b]p10.[/b] Jack's calculator has a strange button labelled ''PS.'' If Jack's calculator is displaying the positive integer $n$, pressing PS will cause the calculator to divide $n$ by the largest power of $2$ that evenly divides $n$, and then adding 1 to the result and displaying that number. If Jack randomly chooses an integer $k$ between $ 1$ and $1023$, inclusive, and enters it on his calculator, then presses the PS button twice, what is the probability that the number that is displayed is a power of $2$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Two types of pieces, bishops and rooks, are to be placed on a $10\times 10$ chessboard (without necessarily filling it) such that each piece occupies exactly one square of the board. A bishop $B$ is said to [i]attack[/i] a piece $P$ if $B$ and $P$ are on the same diagonal and there are no pieces between $B$ and $P$ on that diagonal; a rook $R$ is said to attack a piece $P$ if $R$ and $P$ are on the same row or column and there are no pieces between $R$ and $P$ on that row or column. A piece $P$ is [i]chocolate[/i] if no other piece $Q$ attacks $P$. What is the maximum number of chocolate pieces there may be, after placing some pieces on the chessboard? [i]Proposed by José Alejandro Reyes González[/i]