In the plane we consider rectangles whose sides are parallel to the coordinate axes and have positive length. Such a rectangle will be called a [i]box[/i]. Two boxes [i]intersect[/i] if they have a common point in their interior or on their boundary. Find the largest $ n$ for which there exist $ n$ boxes $ B_1$, $ \ldots$, $ B_n$ such that $ B_i$ and $ B_j$ intersect if and only if $ i\not\equiv j\pm 1\pmod n$. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Let $x_1=a, x_2=a^{x_1}, ..., x_n=a^{x_{n-1}}$ where $a>1$. What is the maximum value of $a$ for which lim exists $\lim_{n\to \infty} x_n$ and what is this limit?

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]

The teacher writes a $2002$-digit number consisting only of digits $9$ on the blackboard. The first student factors this number as $ab$ with $a > 1$ and $b > 1$ and replaces it on the blackboard by two numbers $a'$ and $b'$ with $|a-a'| = |b-b'| = 2$. The second student chooses one of the numbers on the blackboard, factors it as $cd$ with $c > 1$ and $d > 1$ and replaces the chosen number by two numbers $c'$ and $d'$ with $|c-c'| = |d-d'| = 2$, etc. Is it possible that after a certain number of students have been to the blackboard all numbers written there are equal to $9$?

Let $p$ be a prime number greater than $2$. Patricia wants $7$ not-necessarily different numbers from $\{1, 2, . . . , p\}$ to the black dots in the figure below, on such a way that the product of three numbers on a line or circle always has the same remainder when divided by $p$. [img]https://cdn.artofproblemsolving.com/attachments/3/1/ef0d63b8ff5341ffc340de0cc75b24c7229e23.png[/img] (a) Suppose Patricia uses the number $p$ at least once. How many times does she have the number $p$ then a minimum sum needed? (b) Suppose Patricia does not use the number $p$. In how many ways can she assign numbers? (Two ways are different if there is at least one black one dot different numbers are assigned. The figure is not rotated or mirrored.)

For each $ x$ in $ [0,1]$, define \[ f(x)=\begin{cases}2x, &\text { if } 0 \leq x \leq \frac {1}{2}; \\ 2 - 2x, &\text { if } \frac {1}{2} < x \leq 1. \end{cases} \]Let $ f^{[2]}(x) = f(f(x))$, and $ f^{[n + 1]}(x) = f^{[n]}(f(x))$ for each integer $ n \geq 2$. For how many values of $ x$ in $ [0,1]$ is $ f^{[2005]}(x) = \frac {1}{2}$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 2005 \qquad \textbf{(C)}\ 4010 \qquad \textbf{(D)}\ 2005^2 \qquad \textbf{(E)}\ 2^{2005}$

Given two positive integers $m$ and $n$, find the largest $k$ in terms of $m$ and $n$ such that the following condition holds: Any tree graph $G$ with $k$ vertices has two (possibly equal) vertices $u$ and $v$ such that for any other vertex $w$ in $G$, either there is a path of length at most $m$ from $u$ to $w$, or there is a path of length at most $n$ from $v$ to $w$. [i]Proposed by Ivan Chan Kai Chin[/i]

Five distinct points $A,B,C,D$ and $E$ lie on a line with $|AB|=|BC|=|CD|=|DE|$. The point $F$ lies outside the line. Let $G$ be the circumcentre of the triangle $ADF$ and $H$ the circumcentre of the triangle $BEF$. Show that the lines $GH$ and $FC$ are perpendicular.

Each of 100 students sends messages to 50 different students. What is the least number of pairs of students who send messages to each other? $\textbf{(A)}\ 100 \qquad\textbf{(B)}\ 75 \qquad\textbf{(C)}\ 50 \qquad\textbf{(D)}\ 25 \qquad\textbf{(E)}\ \text{None}$

Compute \[\sum_{k=0}^{100}\left\lfloor\dfrac{2^{100}}{2^{50}+2^k}\right\rfloor.\] (Here, if $x$ is a real number, then $\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$.)

There are $12$ acrobats who are assigned a distinct number ($1, 2, \cdots , 12$) respectively. Half of them stand around forming a circle (called circle A); the rest form another circle (called circle B) by standing on the shoulders of every two adjacent acrobats in circle A respectively. Then circle A and circle B make up a formation. We call a formation a “[i]tower[/i]” if the number of any acrobat in circle B is equal to the sum of the numbers of the two acrobats whom he stands on. How many heterogeneous [i]towers[/i] are there? (Note: two [i]towers[/i] are homogeneous if either they are symmetrical or one may become the other one by rotation. We present an example of $8$ acrobats (see attachment). Numbers inside the circle represent the circle A; numbers outside the circle represent the circle B. All these three formations are “[i]towers[/i]”, however they are homogeneous [i]towers[/i].)

Let $A=\{-2562,-2561,...,2561,2562\}$. Prove that for any bijection (1-1, onto function) $f:A\to A$, $$\sum_{k=1}^{2562}\left\lvert f(k)-f(-k)\right\rvert\text{ is maximized if and only if } f(k)f(-k)<0\text{ for any } k=1,2,...,2562.$$

Let $n$ be a positive integer. For any $k$, denote by $a_k$ the number of permutations of $\{1,2,\dots,n\}$ with exactly $k$ disjoint cycles. (For example, if $n=3$ then $a_2=3$ since $(1)(23)$, $(2)(31)$, $(3)(12)$ are the only such permutations.) Evaluate \[ a_n n^n + a_{n-1} n^{n-1} + \dots + a_1 n. \][i]Proposed by Sammy Luo[/i]

Prove that $(2m)!(2n)!$ is a multiple of $m!n!(m+n)!$ for any non-negative integers $m$ and $n$.

Find all prime numbers $p, q, r$ satisfying the equation \[ p^4+2p+q^4+q^2=r^2+4q^3+1 \]

The edge lengths of a tetrahedron are a, b, c, d, e, f, the areas of its faces are S1, S2, S3, S4, and its volume is V . Prove that 2 [S1 S2 S3 S4](1/2) > 3V [abcdef](1/6) this problem comes from: http://www.imomath.com/othercomp/jkasfvgkusa/MonMO99.pdf I was just wondering if someone could write it in LATEX form. [color=red]_____________________________________ EDIT by moderator: If you type[/color] [code]The edge lengths of a tetrahedron are $a, b, c, d, e, f,$ the areas of its faces are $S_1, S_2, S_3, S_4,$ and its volume is $V.$ Prove that $2 \sqrt{S_1 S_2 S_3 S_4} > 3V \sqrt[6]{abcdef}$[/code] [color=red]it shows up as:[/color] The edge lengths of a tetrahedron are $ a, b, c, d, e, f,$ the areas of its faces are $ S_1, S_2, S_3, S_4,$ and its volume is $ V.$ Prove that $ 2 \sqrt{S_1 S_2 S_3 S_4} > 3V \sqrt[6]{abcdef}$

Let $S$ be a set of $6$ positive real numbers such that $\left(a,b \in S \right) \left(a>b \right) \Rightarrow a+b \in S$ or $a-b \in S$ Prove that if we sort these numbers in ascending order, then they form an arithmetic progression

Given six points on a circle, $A, a, B, b, C, c$, show that the Pascal lines of the hexagrams $AaBbCc, AbBcCa, AcBaCb$ are concurrent.

Let $ABC$ be an arbitrary triangle. A regular $n$-gon is constructed outward on the three sides of $\triangle ABC$. Find all $n$ such that the triangle formed by the three centres of the $n$-gons is equilateral.

A box contains 900 cards numbered from 100 to 999. Cards are drawn randomly, one at a time, without replacement, and the sum of their digits is recorded. What is the minimum number of cards that must be drawn to guarantee that at least three of these sums are the same?

In acute triangle $ABC$, let $\odot O$ be its circumcircle, $\odot I$ be its incircle. Tangents at $B,C$ to $\odot O$ meet at $L$, $\odot I$ touches $BC$ at $D$. $AY$ is perpendicular to $BC$ at $Y$, $AO$ meets $BC$ at $X$, and $OI$ meets $\odot O$ at $P,Q$. Prove that $P,Q,X,Y$ are concyclic if and only if $A,D,L$ are collinear.

The radii of the circumcircle and the incircle of a right triangle are given. Cconstruct that triangle with compass and ruler, describe the construction and justify why it is correct.

Let $n \ge 1$ be a positive integer. An $n \times n$ matrix is called [i]good[/i] if each entry is a non-negative integer, the sum of entries in each row and each column is equal. A [i]permutation[/i] matrix is an $n \times n$ matrix consisting of $n$ ones and $n(n-1)$ zeroes such that each row and each column has exactly one non-zero entry. Prove that any [i]good[/i] matrix is a sum of finitely many [i]permutation[/i] matrices.

Restore a bicentral quadrilateral $ABCD$ if the midpoints of the arcs $AB,BC,CD$ of its circumcircle are given.

Prove that $102^{1991} + 103^{1991}$ is not a proper power of an integer.