Prove that: there exists a positive constant $K$, and an integer series $\{a_n\}$, satisfying: $(1)$ $0<a_1<a_2<\cdots <a_n<\cdots $; $(2)$ For any positive integer $n$, $a_n<1.01^n K$; $(3)$ For any finite number of distinct terms in $\{a_n\}$, their sum is not a perfect square.

Let $\mathbb R$ be the set of real numbers. We denote by $\mathcal F$ the set of all functions $f\colon\mathbb R\to\mathbb R$ such that $$f(x + f(y)) = f(x) + f(y)$$ for every $x,y\in\mathbb R$ Find all rational numbers $q$ such that for every function $f\in\mathcal F$, there exists some $z\in\mathbb R$ satisfying $f(z)=qz$.

Distinct points $P$, $Q$, $R$, $S$ lie on the circle $x^2+y^2=25$ and have integer coordinates. The distances $PQ$ and $RS$ are irrational numbers. What is the greatest possible value of the ratio $\frac{PQ}{RS }$? $\textbf{(A)}\ 3\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 3\sqrt{5}\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 5\sqrt{2}$

Find all values of $a$ for which the inequality $$a^2x^2 + y^2 + z^2 \ge ayz+xy+xz$$ holds for all $x$, $y$ and $z$.

One hundred points are marked in the plane, with no three in a line. Is it always possible to connect the points in pairs such that all fifty segments intersect one another?

The sequence of polynomials $(a_n)$ is defined by $a_0=0$, $ a_1=x+2$ and $a_n=a_{n-1}+3a_{n-1}a_{n-2} +a_{n-2}$ for $n>1$. (a) Show for all positive integers $k,m$: if $k$ divides $m$ then $a_k$ divides $a_m$. (b) Find all positive integers $n$ such that the sum of the roots of polynomial $a_n$ is an integer.

Evaluate \[ \int_e^{e^{2009}} \frac{1}{x}\left\{1\plus{}\frac{1\minus{}\ln x}{\ln x\cdot \ln \frac{x}{\ln (\ln x)}}\right\}\ dx\]

I've come across a challenging graph theory problem. Roughly translated, it goes something like this: There are n lines drawn on a plane; no two lines are parallel to each other, and no three lines meet at a single point. Those lines would partition the plane down into many 'area's. Suppose we select one point from each area. Also, should two areas share a common side, we connect the two points belonging to the respective areas with a line. A graph consisted of points and lines will have been made. Find all possible 'n' that will make a hamiltonian circuit exist for the given graph

Find x, y, z $\in Z$\\$x^2+y^2+z^2=2^n(x+y+z)$\\$n\in N$

Evaluate $$\lim_{x\to0}\frac{\sin2x}{e^{3x}-e^{-3x}}$$

Let $ \prod_{n=1}^{1996}{(1+nx^{3^n})}= 1+ a_{1}x^{k_{1}}+ a_{2}x^{k_{2}}+...+ a_{m}x^{k_{m}}$ where $a_{1}, a_{1}, . . . , a_{m}$ are nonzero and $k_{1} < k_{2} <...< k_{m}$. Find $a_{1996}$.

Let $ABC$ be a triangle such that $\angle C=2\angle B$ and $\omega$ be its circumcircle. a tangent from $A$ to $\omega$ intersect $BC$ at $E$. $\Omega$ is a circle passing throw $B$ that is tangent to $AC$ at $C$. Let $\Omega\cap AB=F$. $K$ is a point on $\Omega$ such that $EK$ is tangent to $\Omega$ ($A,K$ aren't in one side of $BC$). Let $M$ be the midpoint of arc $BC$ of $\omega$ (not containing $A$). Prove that $AFMK$ is a cyclic quadrilateral. [asy] import graph; size(15.424606256655986cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ real xmin = -7.905629294221492, xmax = 11.618976962434495, ymin = -5.154837585051625, ymax = 4.0091473316396895; /* image dimensions */ pen uuuuuu = rgb(0.26666666666666666,0.26666666666666666,0.26666666666666666); /* draw figures */ draw(circle((1.4210145017438194,0.18096629151696939), 2.581514123077079)); draw(circle((1.4210145017438194,-1.3302878964546825), 2.8984706754484924)); draw(circle((-0.7076932767793396,-0.4161825262831505), 2.9101722408015513), linetype("4 4") + red); draw((3.996177869179178,0.)--(-3.839514259733819,0.)); draw((3.996177869179178,0.)--(0.07833180472267817,2.385828723227042)); draw((0.07833180472267817,2.385828723227042)--(-1.154148865691539,0.)); draw((-3.839514259733819,0.)--(-0.6807342461448075,-3.3262298939043657)); draw((0.07833180472267817,2.385828723227042)--(-3.839514259733819,0.)); /* dots and labels */ dot((3.996177869179178,0.),blue); label("$B$", (4.040279615036859,0.10218054796102663), NE * labelscalefactor,blue); dot((-1.154148865691539,0.),blue); label("$C$", (-1.3803811057738653,-0.14328333373606214), NE * labelscalefactor,blue); dot((1.4210145017438194,1.5681827789938092),linewidth(4.pt)); label("$F$", (1.4629088572174203,1.6465574703052102), NE * labelscalefactor); dot((0.07833180472267817,2.385828723227042),linewidth(3.pt) + blue); label("$A$", (-0.04055741817725232,2.5568193649319144), NE * labelscalefactor,blue); dot((-3.839514259733819,0.),linewidth(3.pt)); label("$E$", (-4.049800819229713,-0.06146203983703255), NE * labelscalefactor); dot((1.4210145017438194,-2.40054783156011),linewidth(4.pt) + uuuuuu); label("$M$", (1.4117705485305265,-2.6490604593938434), NE * labelscalefactor,uuuuuu); dot((-0.6807342461448075,-3.3262298939043657),linewidth(4.pt)); label("$K$", (-0.7871767250058992,-3.5490946922831688), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy]

Let $X$ be a point on the segment $[BC]$ of an equilateral triangle $ABC$ and let $Y$ and $Z$ be points on the rays $[BA$ and $[CA$ such that the lines $AX, BZ, CY$ are parallel. If the intersection of $XY$ and $AC$ is $M$ and the intersection of $XZ$ and $AB$ is $N$, prove that $MN$ is tangent to the incenter of $ABC$.

A point $P$ lies on side $AB$ of a convex quadrilateral $ABCD$. Let $\omega$ be the inscribed circumference of triangle $CPD$ and $I$ the centre of $\omega$. It is known that $\omega$ is tangent to the inscribed circumferences of triangles $APD$ and $BPC$ at points $K$ and $L$ respectively. Let $E$ be the point where the lines $AC$ and $BD$ intersect, and $F$ the point where the lines $AK$ and $BL$ intersect. Prove that the points $E, I, F$ are collinear.

Let $a,b$ be positive real numbers.Prove that $(1+a)^{8}+(1+b)^{8}\geq 128ab(a+b)^{2}$.

A positive integer $n$ is called [i]smooth[/i] if there exist integers $a_1,a_2,\dotsc,a_n$ satisfying \[a_1+a_2+\dotsc+a_n=a_1 \cdot a_2 \cdot \dotsc \cdot a_n=n.\] Find all smooth numbers.

Prove that if the product $1\cdot 2\cdot ...\cdot n$ ($n> 3$) is not divisible by $n + 1$, then $n + 1$ is prime.

The internal bisectors of angles $\angle DAB$ and $\angle BCD$ of a quadrilateral $ABCD$ intersect at the point $X_1$, and the external bisectors of these angles intersect at the point $X_2$. The internal bisectors of angles $\angle ABC$ and $\angle CDA$ intersect at the point $Y_1$, and the external bisectors of these angles intersect at the point $Y_2$. Prove that the angle between the lines $X_1X_2$ and $Y_1Y_2$ equals the angle between the diagonals $AC$ and $BD$. [i](A. Voidelevich)[/i]

Unit cubes are made into beads by drilling a hole through them along a diagonal. The beads are put on a string in such a way that they can move freely in space under the restriction that the vertices of two neighboring cubes are touching. Let $ A$ be the beginning vertex and $ B$ be the end vertex. Let there be $ p \times q \times r$ cubes on the string $ (p, q, r \geq 1).$ [i](a)[/i] Determine for which values of $ p, q,$ and $ r$ it is possible to build a block with dimensions $ p, q,$ and $ r.$ Give reasons for your answers. [i](b)[/i] The same question as (a) with the extra condition that $ A \equal{} B.$

Find all positive integer number $n$ such that $[\sqrt{n}]-2$ divides $n-4$ and $[\sqrt{n}]+2$ divides $n+4$. Note: $[r]$ denotes the integer part of $r$.

Let $P(x)$ be the unique polynomial of degree four for which $P(165) = 20$, and \[ P(42) = P(69) = P(96) = P(123) = 13. \] Compute $P(1) - P(2) + P(3) - P(4) + \dots + P(165)$. [i]Proposed by Evan Chen[/i]

Let $ABC$ be a triangle and let $Q$ be a point such that $\overline{AB} \perp \overline{QB}$ and $\overline{AC} \perp \overline{QC}$. A circle with center $I$ is inscribed in $\triangle ABC$, and is tangent to $\overline{BC}$, $\overline{CA}$ and $\overline{AB}$ at points $D$, $E$, and $F$, respectively. If ray $QI$ intersects $\overline{EF}$ at $P$, prove that $\overline{DP} \perp \overline{EF}$. [i]Proposed by Aaron Lin[/i]

Two different circles $\omega_1$ ,$\omega_2$, with centers $O_1, O_2$ respectively intersect at the points $A, B$. The line $O_1B$ intersects $\omega_2$ at the point $F (F \ne B)$, and the line $O_2B$ intersects $\omega_1$ at the point $E (E\ne B)$. A line was drawn through the point $B$, parallel to the $EF$, which intersects $\omega_1$ at the point $M (M \ne B)$, and $\omega_2$ at the point $N (N\ne B)$. Prove that the lines $ME, AB$ and $NF$ intersect at one point.

Two players play a game as follows. The first player chooses two non-zero integers A and B. The second player forms a quadratic with A, B and 1998 as coefficients (in any order). The first player wins iff the equation has two distinct rational roots. Show that the first player can always win.

Anumber of schools took part in a tennis tournament. No two players from the same school played against each other. Every two players from different schools played exactly one match against each other. A match between two boys or between two girls was called a [i]single[/i] and that between a boy and a girl was called a [i]mixed single[/i]. The total number of boys differed from the total number of girls by at most 1. The total number of singles differed from the total number of mixed singles by at most 1. At most how many schools were represented by an odd number of players?