Sequence {$x_n$} satisfies: $x_1=1$ , ${x_n=\sqrt{x_{n-1}^2+x_{n-1}}+x_{n-1}}$ ( ${n>=2}$ ) Find the general term of {$x_n$}

In an acute triangle $ABC$ , $AB>AC$ , $ \cos B+ \cos C=1$ , $E,F$ are on the extend line of $AB,AC$ such that $\angle ABF = \angle ACE = 90$ . (1) Prove :$BE+CF=EF$ ; (2) Assume the bisector of $\angle EBC$ meet $EF$ at $P$ , prove that $CP$ is the bisector of $\angle BCF$.

Given $26$ different positive integers , in any six numbers of the $26$ integers , there are at least two numbers , one can be devided by another. Then prove : There exists six numbers , one of them can be devided by the other five numbers .

The captain and his three sailors get $2009$ golden coins with the same value . The four people decided to divide these coins by the following rules : sailor $1$,sailor $2$,sailor $3$ everyone write down an integer $b_1,b_2,b_3$ , satisfies $b_1\ge b_2\ge b_3$ , and ${b_1+b_2+b_3=2009}$; the captain dosen't know what the numbers the sailors have written . He divides $2009$ coins into $3$ piles , with number of coins: $a_1,a_2,a_3$ , and $a_1\ge a_2\ge a_3$ . For sailor $k$ ($k=1,2,3$) , if $b_k<a_k$ , then he can take $b_k$ coins from the $k$th pile ; if $b_k\ge a_k$ , then he can't take any coins away . At last , the captain own the rest of the coins .If no matter what the numbers the sailors write , the captain can make sure that he always gets $n$ coins . Find the largest possible value of $n$ and prove your conclusion .

Assume : $x,y,z>0$ , $ x^2+y^2+z^2 = 3 $ . Prove the following inequality : $${\frac{x^{2009}-2008(x-1)}{y+z}+\frac{y^{2009}-2008(y-1)}{x+z}+\frac{z^{2009}-2008(z-1)}{x+y}\ge\frac{1}{2}(x+y+z)}$$

Given a minor sector $AOB$ (Here minor means that $ \angle AOB <90$). $O$ is the centre , chose a point $C$ on arc $AB$ ,Let $P$ be a point on segment $OC$ , join $AP$ , $BP$ , draw a line through $B$ parallel to $AP$ , the line meet $OC$ at point $Q$ ,join $AQ$ . Prove that the area of polygon $AQPBO$ does not change when points $P,C$ move .

Let $\lfloor m \rfloor$ be the largest integer smaller than $m$ . Assume $x,y \in \mathbb{R+}$ , For all positive integer $n$ , $\lfloor x \lfloor ny \rfloor \rfloor =n-1$ . Prove : $xy=1$ , $y$ is an irrational number larger than $ 1 $ .

Find the smallest positive integer $N$ satisfies : 1 . $209$│$N$ 2 . $ S (N) = 209 $ ( # Here $S(m)$ means the sum of digits of number $m$ )