Let $ U \equal{} 2\times2004^{2005}$, $ V \equal{} 2004^{2005}$, $ W \equal{} 2003\times2004^{2004}$, $ X \equal{} 2\times2004^{2004}$, $ Y \equal{} 2004^{2004}$ and $ Z \equal{} 2004^{2003}$. Which of the following is the largest? $ \textbf{(A)}\ U \minus{} V \qquad \textbf{(B)}\ V \minus{} W \qquad \textbf{(C)}\ W \minus{} X \qquad \textbf{(D)}\ X \minus{} Y \qquad \textbf{(E)}\ Y \minus{} Z$

Let $0<f(1)<f(2)<f(3)<\ldots$ a sequence with all its terms positive$.$ The $n-th$ positive integer which doesn't belong to the sequence is $f(f(n))+1.$ Find $f(240).$

A man buys a house for $10000$ dollars and rents it. He puts $ 12\frac{1}{2}\%$ of each month's rent aside for repairs and upkeep; pays $325$ dollars a year taxes and realizes $ 5\frac{1}{2}\%$ on his investment. The monthly rent is: $\textbf{(A)}\ 64.82\text{ dollars} \qquad \textbf{(B)}\ 83.33\text{ dollars} \qquad \textbf{(C)}\ 72.08\text{ dollars} \qquad \textbf{(D)}\ 45.83\text{ dollars} \qquad \textbf{(E)}\ 177.08\text{ dollars}$

[b]p1.[/b] Give a fake proof that $0 = 1$ on the back of this page. The most convincing answer to this question at this test site will receive a point. [b]p2.[/b] It is often said that once you assume something false, anything can be derived from it. You may assume for this question that $0 = 1$, but you can only use other statements if they are generally accepted as true or if your prove them from this assumption and other generally acceptable mathematical statements. With this in mind, on the back of this page prove that every number is the same number. [b]p3.[/b] Suppose you write out all integers between $1$ and $1000$ inclusive. (The list would look something like $1$, $2$, $3$, $...$ , $10$, $11$, $...$ , $999$, $1000$.) Which digit occurs least frequently? [b]p4.[/b] Pick a real number between $0$ and $1$ inclusive. If your response is $r$ and the standard deviation of all responses at this site to this question is $\sigma$, you will receive $r(1 - (r - \sigma)^2)$ points. [b]p5.[/b] Find the sum of all possible values of $x$ that satisfy $243^{x+1} = 81^{x^2+2x}$. [b]p6.[/b] How many times during the day are the hour and minute hands of a clock aligned? [b]p7.[/b] A group of $N + 1$ students are at a math competition. All of them are wearing a single hat on their head. $N$ of the hats are red; one is blue. Anyone wearing a red hat can steal the blue hat, but in the process that person’s red hat disappears. In fact, someone can only steal the blue hat if they are wearing a red hat. After stealing it, they would wear the blue hat. Everyone prefers the blue hat over a red hat, but they would rather have a red hat than no hat at all. Assuming that everyone is perfectly rational, find the largest prime $N$ such that nobody will ever steal the blue hat. [b]p8.[/b] On the back of this page, prove there is no function f$(x)$ for which there exists a (finite degree) polynomial $p(x)$ such that $f(x) = p(x)(x + 3) + 8$ and $f(3x) = 2f(x)$. [b]p9.[/b] Given a cyclic quadrilateral $YALE$ with $Y A = 2$, $AL = 10$, $LE = 11$, $EY = 5$, what is the area of $YALE$? [b]p10.[/b] About how many pencils are made in the U.S. every year? If your answer to this question is $p$, and our (good) estimate is $\rho$, then you will receive $\max(0, 1 -\frac 12 | \log_{10}(p) - \log_{10}(\rho)|)$ points. [b]p11.[/b] The largest prime factor of $520, 302, 325$ has $5$ digits. What is this prime factor? [b]p12.[/b] The previous question was on the individual round from last year. It was one of the least frequently correctly answered questions. The first step to solving the problem and spotting the pattern is to divide $520, 302, 325$ by an appropriate integer. Unfortunately, when solving the problem many people divide it by $n$ instead, and then they fail to see the pattern. What is $n$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $x,y,z$ be positive real numbers satisfying $4x^2 - 2xy + y^2 = 64, y^2 - 3yz +3z^2 = 36,$ and $4x^2 +3z^2 = 49.$ If the maximum possible value of $2xy +yz -4zx$ can be expressed as $\sqrt{n}$ for some positive integer $n,$ find $n.$

On a sheet of paper, Isabella draws a circle of radius $2$, a circle of radius $3$, and all possible lines simultaneously tangent to both circles. Isabella notices that she has drawn exactly $k\geq 0$ lines. How many different values of $k$ are possible? $\textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }4\qquad\textbf{(D) }5\qquad\textbf{(E) }6$

Two vertices of the rectangle are located on side $BC$ of triangle $ABC$, and the other two are on sides $AB$ and $AC$. It is known that the midpoint of the altitude of this triangle, drawn on the side $BC$, lies on one of the diagonals of the rectangle, and the side of the rectangle located on $BC$ is three times less than $BC$. In what ratio does the altitude of the triangle divide the side $BC$ ?

Let $k$ be a natural number. Bijection $f:\mathbb{Z} \rightarrow \mathbb{Z}$ has the following property: for any integers $i$ and $j$, $|i-j|\leq k$ implies $|f(i) - f(j)|\leq k$. Prove that for every $i,j\in \mathbb{Z}$ it stands: \[|f(i)-f(j)|= |i-j|.\]

An infinite array of rational numbers $G(d, n)$ is defined for integers $d$ and $ n$ with $1\leq d \leq n$ as follows: $$G(1, n)= \frac{1}{n}, \;\;\; G(d,n)= \frac{d}{n} \sum_{i=d}^{n} G(d-1, i-1) \; \text{for} \; d>1.$$ For $1 < d < p$ and $p$ prime, prove that $G(d, p)$ is expressible as a quotient $s\slash t$ of integers $s$ and $t$ with $t$ not divisible by $p.$

$ABC$ is a triangle such that $AC<AB<BC$ and $D$ is a point on side $AB$ satisfying $AC=AD$. The circumcircle of $ABC$ meets with the bisector of angle $A$ again at $E$ and meets with $CD$ again at $F$. $K$ is an intersection point of $BC$ and $DE$. Prove that $CK=AC$ is a necessary and sufficient condition for $DK \cdot EF = AC \cdot DF$.

The function $g : [0, \infty) \to [0, \infty)$ satisfies the functional equation: $g(g(x)) = \frac{3x}{x + 3}$, for all $x \ge 0$. You are also told that for $2 \le x \le 3$: $g(x) = \frac{x + 1}{2}$. (a) Find $g(2021)$. (b) Find $g(1/2021)$.

Let $P_1, P_2, \ldots, P_6$ be points in the complex plane, which are also roots of the equation $x^6+6x^3-216=0$. Given that $P_1P_2P_3P_4P_5P_6$ is a convex hexagon, determine the area of this hexagon.

Let $ABCDE$ be a convex pentagon such that $BC=DE$. Assume that there is a point $T$ inside $ABCDE$ with $TB=TD,TC=TE$ and $\angle ABT = \angle TEA$. Let line $AB$ intersect lines $CD$ and $CT$ at points $P$ and $Q$, respectively. Assume that the points $P,B,A,Q$ occur on their line in that order. Let line $AE$ intersect $CD$ and $DT$ at points $R$ and $S$, respectively. Assume that the points $R,E,A,S$ occur on their line in that order. Prove that the points $P,S,Q,R$ lie on a circle.

Consider a triangle $ABC$ with $AB=AC$, and $D$ the foot of the altitude from the vertex $A$. The point $E$ lies on the side $AB$ such that $\angle ACE= \angle ECB=18^{\circ}$. If $AD=3$, find the length of the segment $CE$.

Let $\{a_n\}$ be the sequance with $a_0=0$, $a_n=\frac{1}{a_{n-1}-2}$ ($n\in N_+$). Select an arbitrary term $a_k$ in the sequence $\{a_n\}$ and construct the sequence $\{b_n\}$: $b_0=a_k$, $b_n=\frac{2b_{n-1}+1} {b_{n-1}}$ ($n\in N_+$) . Determine whether the sequence $\{b_n\}$ is a finite sequence or an infinite sequence and give proof.

Assume that every root of polynomial $P(x) = x^d - a_1x^{d-1} + ... + (-1)^{d-k}a_d$ is in $[0,1]$. Show that for every $k = 1,2,...,d$ the following inequality holds: $ a_k - a_{k+1} + ... + (-1)^{d-k}a_d \geq 0 $

What is the shortest distance between the plane $Ax + By + Cz + 1 = 0$ and the ellipsoid $\frac{x^2}{a^2} + \frac{y^2}{b^2} + \frac{z^2}{c^2} = 1.$ You may find it convenient to use the notation $h = (A^2 + B^2 + C^2)^{\frac{-1}{2}}, m = (a^2A^2 + b^2B^2 + c^2C^2)^{\frac{1}{2}}.$ What is the algebraic condition for the plane not to intersect the ellipsoid?

Compute all real values of $b$ such that, for $f(x) = x^2+bx-17, f(4)=f'(4)$.

Viktor and Natalia play a colouring game with a 3-dimensional cube taking turns alternatingly. Viktor goes first, and on each of his turns, he selects an unpainted edge, and paints it violet. On each of Natalia's turns, she selects an unpainted edge, or at most once during the game a face diagonal, and paints it neon green. If the player on turn cannot make a legal move, then the turn switches to the other player. The game ends when nobody can make any more legal moves. Natalia wins if at the end of the game every vertex of the cube can be reached from every other vertex by traveling only along neon green segments (edges or diagonal), otherwise Viktor wins. Who has a winning strategy? (Prove your answer.) [i]Authored by Viktor Simjanoski[/i]

From a point $C$, tangents $CA$ and $CB$ are drawn to a circle $O$. From an arbitrary point $N$ on the circle, perpendiculars $ND, NE, NF$ are drawn on $AB, CA$ and $CB$, respectively. Prove that the length of $ND$ is the mean proportional of the lengths of $NE$ and $NF$.

$6k+2$ people play in odd or even championship. In each odd or even match they participate exactly two people. Six rounds have been arranged so that in each round there are $3k + 1$ simultaneous matches, and no player participates in two games of the same round. It is known that two people do not play with each other more than one turn. Prove that there are $k + 1$ people where any two of them have not played each other. [hide=original wording] 6k+2 pessoas jogam em campeonato de par ou impar. Em cada partida de par ou impar participam exatamente duas pessoas. Seis rodadas foram organizadas, de modo que, em cada rodada, ha 3k + 1 partidas simultaneas, e nenhum jogador participa de dois jogos da mesma rodada. Sabe-se que duas pessoas nao jogam entre si mais de uma vez. Prove que existem k + 1 pessoas em que quaisquer duas delas nao jogaram entre si. [/quote]

Let $ABC$ be an equilateral triangle. From the vertex $A$ we draw a ray towards the interior of the triangle such that the ray reaches one of the sides of the triangle. When the ray reaches a side, it then bounces off following the law of reflection, that is, if it arrives with a directed angle $\alpha$, it leaves with a directed angle $180^{\circ}-\alpha$. After $n$ bounces, the ray returns to $A$ without ever landing on any of the other two vertices. Find all possible values of $n$.

Let $a,b$ be positive integers satisfying $$\sqrt{\dfrac{ab}{2b^2-a}}=\dfrac{a+2b}{4b}$$. Find $|10(a-5)(b-15)|+8$.

At each vertex of a $13$-sided polygon we write one of the numbers $1,2,3,…, 12,13$, without repeating. Then, on each side of the polygon we write the difference of the numbers of the vertices of its ends (the largest minus the smallest). For example, if two consecutive vertices of the polygon have the numbers $2$ and $11$, the number $9$ is written on the side they determine. a) Is it possible to number the vertices of the polygon so that only the numbers $3, 4$ and $5$ are written on the sides? b) Is it possible to number the vertices of the polygon so that only the numbers $3, 4$ and $6$ are written on the sides?

Find the greatest integer $n < 1000$ for which $4n^3 - 3n$ is the product of two consecutive odd integers.