Three boxes contain 600 balls each. The first box contains 600 identical red balls, the second box contains 600 identical white balls and the third box contains 600 identical blue balls. From these three boxes, 900 balls are chosen. In how many ways can the balls be chosen? For example, one can choose 250 red balls, 187 white balls and 463 balls, or one can choose 360 red balls and 540 blue balls.

We call a collection of weights (each weighing an integer value) basic if their total weight equals $500$ and each object of integer weight not greater than $500$ can be balanced exactly with a uniquely determined set of weights from the collection. (Uniquely means that we are not concerned with order or which weights of equal value are chosen to balance against a particular object, if in fact there is a choice.) (a) Find an example of a basic collection other than the collection of $500$ weights each of value $1$. (b) How many different basic collections are there? (D. Fomin, Leningrad)

Sir Alex plays the following game on a row of 9 cells. Initially, all cells are empty. In each move, Sir Alex is allowed to perform exactly one of the following two operations: [list=1] [*] Choose any number of the form $2^j$, where $j$ is a non-negative integer, and put it into an empty cell. [*] Choose two (not necessarily adjacent) cells with the same number in them; denote that number by $2^j$. Replace the number in one of the cells with $2^{j+1}$ and erase the number in the other cell. [/list] At the end of the game, one cell contains $2^n$, where $n$ is a given positive integer, while the other cells are empty. Determine the maximum number of moves that Sir Alex could have made, in terms of $n$. [i]Proposed by Warut Suksompong, Thailand[/i]

assume that k,n are two positive integer $k\leq n$count the number of permutation $\{\ 1,\dots ,n\}\ $ st for any $1\leq i,j\leq k$and any positive integer m we have $f^m(i)\neq j$ ($f^m$ meas iterarte function,)

The positive reals $a, b, c, x, y, z$ satisfy $$5a+4b+3c=5x+4y+3z.$$ Show that $$\frac{a^5}{x^4}+\frac{b^4}{y^3}+\frac{c^3}{z^2} \geq x+y+z.$$ [i]Proposed by Dominik Burek[/i]

Let $D$ be a point on side $[BC]$ of triangle $ABC$ such that $[AD]$ is an angle bisector, $|BD|=4$, and $|DC|=3$. Let $E$ be a point on side $[AB]$ and different than $A$ such that $m(\widehat{BED})=m(\widehat{DEC})$. If the perpendicular bisector of segment $[AE]$ meets the line $BC$ at $M$, what is $|CM|$? $ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ 9 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ \text { None of above} $

For each positive integer $n$, define $s(n) =\sum_{k=0}^n r_k$, where $r_k$ is the remainder when $n \choose k$ is divided by $3$. Find all positive integers $n$ such that $s(n) \ge n$. Malik Talbi

Let $r_1, \ldots , r_n$ be the radii of $n$ spheres. Call $S_1, S_2, \ldots , S_n$ the areas of the set of points of each sphere from which one cannot see any point of any other sphere. Prove that \[\frac{S_1}{r_1^2} + \frac{S_2}{r_2^2}+\cdots+\frac{S_n}{r_n^2} = 4 \pi.\]

In the set $A$ with $n$ elements, $[\sqrt{2n}]+2$ subsets are chosen such that the union of any three of them is equal to $A$. Prove that the union of any two of them is equal to $A$ as well.

There are real numbers $a, b, c, d$ such that for all $(x, y)$ satisfying $6y^2 = 2x^3 + 3x^2 + x$, if $x_1 = ax + b$ and $y_1 = cy + d$, then $y_1^2 = x_1^3 - 36x_1$. What is $a + b + c + d$?

A table with 1000 cards on a line, numbered from 1 to 1000, is considered. The cards are ordered in the usual way. Now, we proceed in the following way. The first card (which is 1) is put just before the last card (between 999 and 1000) and, after, the new first card (which is 2) is put after the last card (which was 1000). Show that after 1000 movements, the cards are ordered again in the usual way. Show that the analogous result ($n$ movements for $n$ cards) does not hold when $n$ is odd.

Let $x_0,\dots,x_{2017}$ are positive integers and $x_{2017}\geq\dots\geq x_0=1$ such that $A=\{x_1,\dots,x_{2017}\}$ consists of exactly $25$ different numbers. Prove that $\sum_{i=2}^{2017}(x_i-x_{i-2})x_i\geq 623$, and find the number of sequences that holds the case of equality.

For real numbers $a,\ b$ with $0\leq a\leq \pi,\ a<b$, let $I(a,\ b)=\int_{a}^{b} e^{-x} \sin x\ dx.$ Determine the value of $a$ such that $\lim_{b\rightarrow \infty} I(a,\ b)=0.$

Let $\phi(n)$ be the number of positive integers less than $n$ that are relatively prime to $n$, where $n$ is a positive integer. Find all pairs of positive integers $(m,n)$ such that \[2^n + (n-\phi(n)-1)! = n^m+1.\]

There are $2019$ coins on a table. Some are placed with head up and others tail up. A group of $2019$ persons perform the following operations: the first person chooses any one coin and then turns it over, the second person choses any two coins and turns them over and so on and the $2019$-th person turns over all the coins. Prove that no matter which sides the coins are up initially, the $2019$ persons can come up with a procedure for turning the coins such that all the coins have smae side up at the end of the operations.

A [i]transversal[/i] of an $n\times n$ matrix $A$ consists of $n$ entries of $A$, no two in the same row or column. Let $f(n)$ be the number of $n \times n$ matrices $A$ satisfying the following two conditions: (a) Each entry $\alpha_{i,j}$ of $A$ is in the set $\{-1,0,1\}$. (b) The sum of the $n$ entries of a transversal is the same for all transversals of $A$. An example of such a matrix $A$ is \[ A = \left( \begin{array}{ccc} -1 & 0 & -1 \\ 0 & 1 & 0 \\ 0 & 1 & 0 \end{array} \right). \] Determine with proof a formula for $f(n)$ of the form \[ f(n) = a_1 b_1^n + a_2 b_2^n + a_3 b_3^n + a_4, \] where the $a_i$'s and $b_i$'s are rational numbers.