Find all positive integers $ n$ having the following properties:in two-dimensional Cartesian coordinates, there exists a convex $ n$ lattice polygon whose lengths of all sides are odd numbers, and unequal to each other. (where lattice polygon is defined as polygon whose coordinates of all vertices are integers in Cartesian coordinates.)

Given is a function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $|f(x+y)-f(x)-f(y)|\leq 1$. Prove the existence of an additive function $g:\mathbb{R}\rightarrow \mathbb{R}$ (that is $g(x+y)=g(x)+g(y)$) such that $|f(x)-g(x)|\leq 1$ for any $x \in \mathbb{R}$

A function $g$ defined for all positive integers $n$ satisfies [list][*]$g(1) = 1$; [*]for all $n\ge 1$, either $g(n+1)=g(n)+1$ or $g(n+1)=g(n)-1$; [*]for all $n\ge 1$, $g(3n) = g(n)$; and [*]$g(k)=2001$ for some positive integer $k$.[/list] Find, with proof, the smallest possible value of $k$.

Determine all finite nonempty sets $S$ of positive integers satisfying \[ {i+j\over (i,j)}\qquad\mbox{is an element of S for all i,j in S}, \] where $(i,j)$ is the greatest common divisor of $i$ and $j$.

Let $X \neq \varnothing$ be a finite set and let $f: X \to X$ be a function such that for every $x \in X$ and a fixed prime $p$ we have $f^p(x)=x.$ Let $Y=\{x \in X | f(x) \neq x\}.$ Prove that the number of the members of the set $Y$ is divisible by $p.$ [i]Note.[/i] ${f^p(x)=x = \underbrace{f(f(f(\cdots ((f}_{ p \text{ times}}(x) ) \cdots )))} .$

Given an integer $n\ge3$, prove that the set $X=\{1,2,3,\ldots,n^2-n\}$ can be divided into two non-intersecting subsets such that neither of them contains $n$ elements $a_1,a_2,\ldots,a_n$ with $a_1<a_2<\ldots<a_n$ and $a_k\le\frac{a_{k-1}+a_{k+1}}2$ for all $k=2,\ldots,n-1$.

Let $B$ be an integer greater than 10 such that everyone of its digits belongs to the set $\{1,3,7,9\}$. Show that $B$ has a [b]prime divisor[/b] greater than or equal to 11.

Find all functions $f: \mathbb{Z}^+\to \mathbb{R}$, which satisfies $f(n+1)\geq f(n)$ for all $n\geq 1$ and $f(mn)=f(m)f(n)$ for all $(m,n)=1$.

Let $ f(x) \equal{} c_m x^m \plus{} c_{m\minus{}1} x^{m\minus{}1} \plus{}...\plus{} c_1 x \plus{} c_0$, where each $ c_i$ is a non-zero integer. Define a sequence $ \{ a_n \}$ by $ a_1 \equal{} 0$ and $ a_{n\plus{}1} \equal{} f(a_n)$ for all positive integers $ n$. (a) Let $ i$ and $ j$ be positive integers with $ i<j$. Show that $ a_{j\plus{}1} \minus{} a_j$ is a multiple of $ a_{i\plus{}1} \minus{} a_i$. (b) Show that $ a_{2008} \neq 0$

A student wrote down the following sequence of numbers : the first number is 1, the second number is 2, and after that, each number is obtained by adding together all the previous numbers. Determine the 12th number in the sequence.

Let $k\geq 2$ and $n_1, \dots, n_k \in \mathbf{Z}^+$. If $n_2 | (2^{n_1} -1)$, $n_3 | (2^{n_2} -1)$, $\dots$, $n_k | (2^{n_{k-1}} -1)$, $n_1 | (2^{n_k} -1)$, show that $n_1 = \dots = n_k =1$.

Let positive numbers $a_1, a_2, ..., a_{3n}$ $(n \geq 2)$ constitute an arithmetic progression with common difference $d > 0$. Prove that among any $n + 2$ terms in this progression, there exist two terms $a_i, a_j$ $(i \neq j)$ satisfying $1 < \frac{|a_i - a_j|}{nd} < 2$.

There is a $2012\times 2012$ grid with rows numbered $1,2,\dots 2012$ and columns numbered $1,2,\dots, 2012$, and we place some rectangular napkins on it such that the sides of the napkins all lie on grid lines. Each napkin has a positive integer thickness. (in micrometers!) (a) Show that there exist $2012^2$ unique integers $a_{i,j}$ where $i,j \in [1,2012]$ such that for all $x,y\in [1,2012]$, the sum \[ \sum _{i=1}^{x} \sum_{j=1}^{y} a_{i,j} \] is equal to the sum of the thicknesses of all the napkins that cover the grid square in row $x$ and column $y$. (b) Show that if we use at most $500,000$ napkins, at least half of the $a_{i,j}$ will be $0$. [i]Proposed by Ray Li[/i]

A game of solitaire is played with $R$ red cards, $W$ white cards, and $B$ blue cards. A player plays all the cards one at a time. With each play he accumulates a penalty. If he plays a blue card, then he is charged a penalty which is the number of white cards still in his hand. If he plays a white card, then he is charged a penalty which is twice the number of red cards still in his hand. If he plays a red card, then he is charged a penalty which is three times the number of blue cards still in his hand. Find, as a function of $R, W,$ and $B,$ the minimal total penalty a player can amass and all the ways in which this minimum can be achieved.

Let $P(x)=x^3-\tfrac{3}{2}x^2+x+\tfrac{1}{4}$. Let $P^{[1]}(x)=P(x)$, and for $n\ge1$, let $P^{n+1}(x)=P^{[n]}(P(x))$. Evaluate: \[ \displaystyle\int_{0}^{1} P^{[2004]} (x) \ \mathrm{d}x. \]

Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ f(x^3\plus{}y^3)\equal{}xf(x^2)\plus{}yf(y^2)\] for all real numbers $ x$ and $ y$. [i]Hery Susanto, Malang[/i]

There are $ n\geq 5$ people in a party. Assume that among any three of them some two know each other. Show that one can select at least $ \frac{n}{2}$ people and arrange them at a round table so that each person sits between two of his/her acquaintances.

Let $ n$ and $ k$ be positive integers. Say that a permutation $ \sigma$ of $ \{1,2,\dots n\}$ is $ k$-[i]limited[/i] if $ |\sigma(i)\minus{}i|\le k$ for all $ i.$ Prove that the number of $ k$-limited permutations of $ \{1,2,\dots n\}$ is odd if and only if $ n\equiv 0$ or $ 1\pmod{2k\plus{}1}.$

It is known that $n$ is a positive integer and $n \le 144$. Ten questions of the type “Is $n$ smaller than $a$?” are allowed. Answers are given with a delay: for $i = 1, \ldots , 9$, the $i$-th question is answered only after the $(i + 1)$-th question is asked. The answer to the tenth question is given immediately. Find a strategy for identifying $n$.

Prove that for every $n\in \mathbb N$, there exists a set $S$ of $n$ positive integers such that for any two distinct $a,b\in S$, $a-b$ divides $a$ and $b$ but none of the other elements of $S$. [i]Proposed by Iurie Boreico[/i]

(a) Prove that, for any positive integers $m\le \ell$ given, there is a positive integer $n$ and positive integers $x_1,\cdots,x_n,y_1,\cdots,y_n$ such that the equality \[ \sum_{i=1}^nx_i^k=\sum_{i=1}^ny_i^k\] holds for every $k=1,2,\cdots,m-1,m+1,\cdots,\ell$, but does not hold for $k=m$. (b) Prove that there is a solution of the problem, where all numbers $x_1,\cdots,x_n,y_1,\cdots,y_n$ are distinct. [i]Proposed by Ilya Bogdanov and Géza Kós.[/i]

Let $a_1\in (0,1)$ and $(a_n)_{n\ge 1}$ a sequence of real numbers defined by $a_{n+1}=a_n(1-a_n^2),\ (\forall)n\ge 1$. Evaluate $\lim_{n\to \infty} a_n\sqrt{n}$.

In the following, a [i]word[/i] will mean a finite sequence of letters "$a$" and "$b$". The [i]length[/i] of a word will mean the number of the letters of the word. For instance, $abaab$ is a word of length $5$. There exists exactly one word of length $0$, namely the empty word. A word $w$ of length $\ell$ consisting of the letters $x_1$, $x_2$, ..., $x_{\ell}$ in this order is called a [i]palindrome[/i] if and only if $x_j=x_{\ell+1-j}$ holds for every $j$ such that $1\leq j\leq\ell$. For instance, $baaab$ is a palindrome; so is the empty word. For two words $w_1$ and $w_2$, let $w_1w_2$ denote the word formed by writing the word $w_2$ directly after the word $w_1$. For instance, if $w_1=baa$ and $w_2=bb$, then $w_1w_2=baabb$. Let $r$, $s$, $t$ be nonnegative integers satisfying $r + s = t + 2$. Prove that there exist palindromes $A$, $B$, $C$ with lengths $r$, $s$, $t$, respectively, such that $AB=Cab$, if and only if the integers $r + 2$ and $s - 2$ are coprime.

[b](a)[/b] Prove that $\frac{1}{n+1} \cdot \binom{2n}{n}$ is an integer for $n \geq 0.$ [b](b)[/b] Given a positive integer $k$, determine the smallest integer $C_k$ with the property that $\frac{C_k}{n+k+1} \cdot \binom{2n}{n}$ is an integer for all $n \geq k.$

Find all functions $f : \mathbb{Q} \to \mathbb{R}$ such that $f(x)f(y)f(x+y) = f(xy)(f(x) + f(y))$ for all $x,y\in\mathbb{Q}$. [i]Sammy Luo and Alex Zhu.[/i]