On a circular table sit $\displaystyle {n> 2}$ students. First, each student has just one candy. At each step, each student chooses one of the following actions: (A) Gives a candy to the student sitting on his left or to the student sitting on his right. (B) Separates all its candies in two, possibly empty, sets and gives one set to the student sitting on his left and the other to the student sitting on his right. At each step, students perform the actions they have chosen at the same time. A distribution of candy is called legitimate if it can occur after a finite number of steps. Find the number of legitimate distributions. (Two distributions are different if there is a student who has a different number of candy in each of these distributions.) （Forgive my poor English）

For each positive integer $k$, we define the polynomial $S_k(x)=1+x+x^2+x^3+...+x^{k-1}$ Show that $n \choose 1$ $S_1(x) +$ $n \choose 2$ $S_2(x) +$ $n \choose 3$ $S_3(x)+...+$ $n \choose n$ $S_n(x) = 2^{n-1}S_n\left(\frac{1+x}{2}\right)$ for every positive integer $n$ and every real number $x$.

For each integer $n > 3$ find all quadruples $(n_1,n_2,n_3,n_4)$ of positive integers with $n_1 +n_2 +n_3 +n_4 = n$ which maximize the expression $$\frac{n!}{n_1!n_2!n_3!n_4!}2^{ {n_1 \choose 2}+{n_2 \choose 2}+{n_3 \choose 2}+{n_4 \choose 2}+n_1n_2+n_2n_3+n_3n_4}$$

Let $p$ be a prime, and $n > p$ be an integer. Prove that \[ \binom{n+p-1}{p} - \binom{n}{p} \] is divisible by $n$.

Prove that for any $n \ge 1$, $LCM _{0\le k\le n} \big \{$ $n \choose k$ $\big\} = \frac{1}{n + 1} LCM \{1, 2,3,...,n + 1\}$

Prove that there exist $ 2004 $ pairwise distinct numbers $ n_1,n_2,\ldots ,n_{2004} , $ all greater than $ 1, $ satisfying: $$ \binom{n_1}{2} +\binom{n_2}{2} +\cdots +\binom{n_{2003}}{2} =\binom{n_{2004}}{2} . $$

Find all positive integers $x$ and $y$ such that $${x \choose y} = 1432$$

For any positive integer n, evaluate $$\sum_{i=0}^{\lfloor \frac{n+1}{2} \rfloor} {n-i+1 \choose i}$$ , where $\lfloor n \rfloor$ is the greatest integer less than or equal to $n$ .

Let be given $a\in\{0,1,2, 3,..., 100\}.$ Find all $n \in\{1,2, 3,..., 2013\}$ such that $C_n^{2013} > C_a^{2013}$ , where $C_k^m=\frac{m!}{k!(m -k)!}$.

On a circular table sit $\displaystyle {n> 2}$ students. First, each student has just one candy. At each step, each student chooses one of the following actions: (A) Gives a candy to the student sitting on his left or to the student sitting on his right. (B) Separates all its candies in two, possibly empty, sets and gives one set to the student sitting on his left and the other to the student sitting on his right. At each step, students perform the actions they have chosen at the same time. A distribution of candy is called legitimate if it can occur after a finite number of steps. Find the number of legitimate distributions. (Two distributions are different if there is a student who has a different number of candy in each of these distributions.) （Forgive my poor English）

For a positive integer $n \ge 2$, define a sequence $a_1, a_2, \cdots ,a_n$ as the following. $$ a_1 = \frac{n(2n-1)(2n+1)}{3}$$ $$a_k = \frac{(n+k-1)(n-k+1)}{2(k-1)(2k+1)}a_{k-1}, \text{ } (k=2,3, \cdots n)$$ (a) Show that $a_1, a_2, \cdots a_n$ are all integers. (b) Prove that there are exactly one number out of $a_1, a_2, \cdots a_n$ which is not a multiple of $2n-1$ and exactly one number out of $a_1, a_2, \cdots a_n$ which is not a multiple of $2n+1$ if and only if $2n-1$ and $2n+1$ are all primes.

Let $N_0$ denote the set of nonnegative integers and $Z$ the set of all integers. Let a function $f : N_0 \times Z \to Z$ satisfy the conditions (i) $f(0, 0) = 1$, $f(0, 1) = 1$ (ii) for all $k, k \ne 0, k \ne 1$, $f(0, k) = 0$ and (iii) for all $n \ge 1$ and $k, f(n, k) = f(n -1, k) + f(n- 1, k - 2n)$. Find the value of $$\sum_{k=0}^{2009 \choose 2} f(2008, k)$$

How many integers are there in $\{0,1, 2,..., 2014\}$ such that $C^x_{2014} \ge C^{999}{2014}$ ? (A): $15$, (B): $16$, (C): $17$, (D): $18$, (E) None of the above. Note: $C^{m}_{n}$ stands for $\binom {m}{n}$

For what positive integers $n, k$ (with $k < n$) are the binomial coefficients $${n \choose k- 1} \,\,\, , \,\,\, {n \choose k} \,\,\, , \,\,\, {n \choose k + 1}$$ three successive terms of an arithmetic progression?

Show that there are infinitely many integers $m \ge 2$ such that $m \choose 2$ $= 3$ $n \choose 4$ holds for some integer $n \ge 4$. Give the general form of all such $m$.

Once in a restaurant [b][i]Dr. Strange[/i][/b] found out that there were 12 types of food items from 1 to 12 on the menu. He decided to visit the restaurant 12 days in a row and try a different food everyday. 1st day, he tries one of the items from the first two. On the 2nd day, he eats either item 3 or the item he didn’t tried on the 1st day. Similarly, on the 3rd day, he eats either item 4 or the item he didn’t tried on the 2nd day. If someday he's not able to choose items that way, he eats the item that remained uneaten from the menu. In how many ways can he eat the items for 12 days?

A positive integer $n \ge 2$ is called [i]peculiar [/i] if the number $n \choose i$ + $n \choose j $ $-i-j$ is even for all integers $i$ and $j$ such that $0 \le i \le j \le n$. Determine all peculiar numbers.

In the Jordan Building (the Olympiad building of High School Mandegar Alborz), Ali and Khosro are playing a game. First, Ali selects 2025 points on the plane such that no three points are collinear and no four points are concyclic. Then, Khosro selects a point, followed by Ali selecting another point, and then Khosro selects one more point. The circumcircle of these three points is drawn, and the number of points inside the circle is denoted by \( t \). If Khosro's goal is to maximize \( t \) and Ali's goal is to minimize \( t \), and both play optimally, determine the value of \( t \). Proposed by Reza Tahernejad Karizi

$k$ is an integer, there exists a triangulation for a regular polygon with $2024$ sides and $2024$ colored dots with $k$ different colors meeting $(1)$ each color will be used at least once $(2)$ every small triangle will have at least $2$ dots that will be in the same color. Try to find the maximum value of$k$

An Indian raga has two kinds of notes: a short note, which lasts for $1$ beat and a long note, which lasts for $2$ beats. For example, there are $3$ ragas which are $3$ beats long; $3$ short notes, a short note followed by a long note, and a long note followed by a short note. How many Indian ragas are 11 beats long?

An Indian raga has two kinds of notes: a short note, which lasts for $1$ beat and a long note, which lasts for $2$ beats. For example, there are $3$ ragas which are $3$ beats long; $3$ short notes, a short note followed by a long note, and a long note followed by a short note. How many Indian ragas are 11 beats long?

Is it possible to partition three-dimensional space into tetrahedra (not necessarily regular) such that there exists a plane that intersects the edges of each tetrahedron at exactly 4 or 0 points? Proposed by Arvin Taheri

Prove the identities: $$C_{n}^{1}+2C_{n}^{2}+3C_{n}^{3}+...+nC_{n}^{n}=n\cdot 2 ^{n-1}$$ $$C_{n}^{1}-2C_{n}^{2}+3C_{n}^{3}+...-(-1)^{n-1}nC_{n}^{n}=0$$

Let $a_1, a_2, ..., a_{n-1}$ be $n - 1$ consecutive positive integers in increasing order such that $k$ ${n \choose k}$ $\equiv 0$ (mod $a_k$), for all $k \in \{1, 2, ... , n - 1\}$. Find the possible values of $a_1$.

A set of 1990 persons is divided into non-intersecting subsets in such a way that 1. No one in a subset knows all the others in the subset, 2. Among any three persons in a subset, there are always at least two who do not know each other, and 3. For any two persons in a subset who do not know each other, there is exactly one person in the same subset knowing both of them. (a) Prove that within each subset, every person has the same number of acquaintances. (b) Determine the maximum possible number of subsets. Note: It is understood that if a person $A$ knows person $B$, then person $B$ will know person $A$; an acquaintance is someone who is known. Every person is assumed to know one's self.