A positive integer $ n$ is called $ good$ if it can be uniquely written simultaneously as $ a_1\plus{}a_2\plus{}...\plus{}a_k$ and as $ a_1 a_2...a_k$, where $ a_i$ are positive integers and $ k \ge 2$. (For example, $ 10$ is good because $ 10\equal{}5\plus{}2\plus{}1\plus{}1\plus{}1\equal{}5 \cdot 2 \cdot 1 \cdot 1 \cdot 1$ is a unique expression of this form). Find, in terms of prime numbers, all good natural numbers.

A square of perimeter $20$ is inscribed in a square of perimeter $28$. What is the greatest distance between a vertex of the inner square and a vertex of the outer square? $ \textbf{(A)}\ \sqrt{58} \qquad\textbf{(B)}\ \frac{7\sqrt{5}}{2} \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\ \sqrt{65} \qquad\textbf{(E)}\ 5\sqrt{3} $

Let $a_1 < a_2 < \cdots < a_k$ denote the sequence of all positive integers between $1$ and $91$ which are relatively prime to $91$, and set $\omega = e^{2\pi i/91}$. Define \[S = \prod_{1\leq q < p\leq k}\left(\omega^{a_p} - \omega^{a_q}\right).\] Given that $S$ is a positive integer, compute the number of positive divisors of $S$.

Let us call a set of positive integers nice if the number of its elements equals to the average of its numbers. Call a positive integer $n$ an [i]amazing[/i] number if the set $\{1, 2 , . . . , n\}$ can be partitioned into nice subsets. a) Prove that every perfect square is amazing. b) Show that there are infinitely many positive integers which are not amazing.

13 LHS Students attend the LHS Math Team tryouts. The students are numbered $1, 2, .. 13$. Their scores are $s_1,s_2, ... s_{13}$, respectively. There are 5 problems on the tryout, each of which is given a weight, labeled $w_1, w_2, ... w_5$. Each score $s_i$ is equal to the sums of the weights of all problems solved by student $i$. On the other hand, each weight $w_j$ is assigned to be $\frac{1}{\sum_ {s_i} }$, where the sum is over all the scores of students who solved problem $j$. (If nobody solved a problem, the score doesn't matter). If the largest possible average score of the students can be expressed in the form $\frac{\sqrt{a}}{b}$, where $a$ is square-free, find $a+b$. [i]Proposed by Jeff Lin[/i]

There is a sequence of numbers $+1$ and $-1$ of length $n$. It is known that the sum of every $10$ neighbouring numbers in the sequence is $0$ and that the sum of every $12$ neighbouring numbers in the sequence is not zero. What is the maximal value of $n$?

Daniel has an unlimited supply of tiles labeled “$2$” and “$n$” where $n$ is an integer. Find (with proof) all the values of $n$ that allow Daniel to fill an $8 \times 10$ grid with these tiles such that the sum of the values of the tiles in each row or column is divisible by $11$.

Let $f(x)$ be a third-degree polynomial with real coefficients satisfying \[|f(1)|=|f(2)|=|f(3)|=|f(5)|=|f(6)|=|f(7)|=12.\] Find $|f(0)|$.

Inside a right circular cone with base radius $5$ and height $12$ are three congruent spheres each with radius $r$. Each sphere is tangent to the other two spheres and also tangent to the base and side of the cone. What is $r?$ $\textbf{(A) }\dfrac32\qquad\textbf{(B) }\dfrac{90 - 40\sqrt3}{11}\qquad\textbf{(C) }2\qquad\textbf{(D) }\dfrac{144 - 25\sqrt3}{44}\qquad\textbf{(E) }\dfrac52$

Do there exist infinitely many positive integers $a, b$ such that $$(a^2+1)(b^2+1)((a+b)^2+1)$$ is a perfect square? [i]Proposed Ivan Chan Guan Yu[/i]

([b]4[/b]) Let $ f(x) \equal{} \sin^6\left(\frac {x}{4}\right) \plus{} \cos^6\left(\frac {x}{4}\right)$ for all real numbers $ x$. Determine $ f^{(2008)}(0)$ (i.e., $ f$ differentiated $ 2008$ times and then evaluated at $ x \equal{} 0$).

A traffic light runs repeatedly through the following cycle: green for $ 30$ seconds, then yellow for $ 3$ seconds, and then red for $ 30$ seconds. Leah picks a random three-second time interval to watch the light. What is the probability that the color changes while she is watching? $ \textbf{(A)}\ \frac {1}{63}\qquad \textbf{(B)}\ \frac {1}{21}\qquad \textbf{(C)}\ \frac {1}{10}\qquad \textbf{(D)}\ \frac {1}{7}\qquad \textbf{(E)}\ \frac {1}{3}$

Two dice are thrown. What is the probability that the product of the two numbers is a multiple of 5? $ \text{(A)}\ \frac{1}{36}\qquad\text{(B)}\ \frac{1}{18}\qquad\text{(C)}\ \frac{1}{6}\qquad\text{(D)}\ \frac{11}{36}\qquad\text{(E)}\ \frac{1}{3} $

The circumcenter, circumradius and orthocenter of a triangle $ ABC $ satisfying $ AB<AC $ are notated with $ O,R,H, $ respectively. Prove that the middle of the segment $ OH $ belongs to the line $ BC $ if $$ AC^2-AB^2=2R\cdot BC. $$ [i]Marius Marchitan[/i]

Prove that there exist a set of $2010$ natural numbers such that product of any $1006 $ numbers is divisible by product of remaining $1004$ numbers.

Find all pairs of positive integers \((a, b)\) such that \[ \frac{a+1}{b} , \frac{b+1}{a} \] are both positive integers.

Andy has 2010 square tiles, each of which has a side length of one unit. He plans to arrange the tiles in an m x n rectangle, where mn = 2010. Compute the sum of the perimeters of all of the different possible rectangles he can make. Two rectangles are considered to be the same if one can be rotated to become the other, so, for instance, a 1 x 2010 rectangle is considered to be the same as a 2010 x 1 rectangle.

A positive integer is called [i]joli[/i] if it can be written as the arithmetic mean of two or more (not necessarily distinct) powers of two, and [i]superjoli[/i] if it can be written as the arithmetic mean of two or more distinct powers of two. For instance $7$ and $92$ are superjoli because $7=\frac{2^4+2^2+1}{3}$ and $92=\frac{2^8+2^4+2^2}{3}$. a) Prove that every positive integer is joli. b) Prove that no power of two is superjoli. c) Find the smallest positive integer different from a power of two that is not superjoli. [i]France Olympiad[/i]

Let $n > 3$ be a natural number, and let $x_1$, $x_2$, ..., $x_n$ be $n$ positive real numbers whose product is $1$. Prove the inequality \[ \frac {1}{1 + x_1 + x_1\cdot x_2} + \frac {1}{1 + x_2 + x_2\cdot x_3} + ... + \frac {1}{1 + x_n + x_n\cdot x_1} > 1. \]

A real function has been assigned to every cell of an $n \times n$ table. Prove that a function can be assigned to each row and each column of this table such that the function assigned to each cell is equivalent to the combination of functions assigned to the row and the column containing it.

[list=a] [*]Prove that for every real number $t$ such that $0 < t < \tfrac{1}{2}$ there exists a positive integer $n$ with the following property: for every set $S$ of $n$ positive integers there exist two different elements $x$ and $y$ of $S$, and a non-negative integer $m$ (i.e. $m \ge 0 $), such that \[ |x-my|\leq ty.\] [*]Determine whether for every real number $t$ such that $0 < t < \tfrac{1}{2} $ there exists an infinite set $S$ of positive integers such that \[|x-my| > ty\] for every pair of different elements $x$ and $y$ of $S$ and every positive integer $m$ (i.e. $m > 0$).

Let $A_1A_2\cdots A_{2002}$ be a regular 2002 sided polygon. Each vertex $A_i$ is associated with a positive integer $a_i$ such that the following condition is satisfied: If $j_1,j_2,\cdots, j_k$ are positive integers such that $k<500$ and $A_{j_1}, A_{j_2}, \cdots A_{j_k}$ is a regular $k$ sided polygon, then the values of $a_{j_1},A_{j_2}, \cdots A_{j_k}$ are all different. Find the smallest possible value of $a_1+a_2+\cdots a_{2002}$

Prove that if the natural numbers $ a $, $ b $, $ c $ satisfy the equation $$ a^2 + b^2 = c^2,$$ then: 1) at least one of the numbers $ a $ and $ b $ is divisible by $ 3 $, 2) at least one of the numbers $ a $ and $ b $ is divisible by $ 4 $, 3) at least one of the numbers $ a $, $ b $, $ c $ is divisible by $ 5 $.

$a_1, a_2, a_3, ...$ are positive reals such that $a_n^2 \ge a_1 + a_2 +... + a_{n-1}$. Show that for some $C > 0$ we have $a_n \ge C n$ for all $n$.

In a race among 5 snails, there is at most one tie, but that tie can involve any number of snails. For example, the result of the race might be that Dazzler is first; Abby, Cyrus, and Elroy are tied for second, and Bruna is fifth. How many different results of the race are possible? $ \textbf{(A) }180 \qquad \textbf{(B) }361 \qquad \textbf{(C) }420 \qquad \textbf{(D) }431 \qquad \textbf{(E) }720 \qquad $