Let $f(n)=n+\lfloor \sqrt{n}\rfloor$. Prove that, for every positive integer $m$, the sequence \[m, f(m), f(f(m)), f(f(f(m))), \cdots\] contains at least one square of an integer.

Find the least positive integer $k$ for which the equation $\lfloor \frac{2002}{n}\rfloor = k$ has no integer solutions for $n.$ (The notation $\lfloor x \rfloor$ means the greatest integer less than or equal to $x.$)

Find the positive integer $n$ for which \[ \lfloor \log_2{1}\rfloor+\lfloor\log_2{2}\rfloor+\lfloor\log_2{3}\rfloor+\cdots+\lfloor\log_2{n}\rfloor=1994. \] (For real $x$, $\lfloor x\rfloor$ is the greatest integer $\le x.$)

For a positive integer $ n,$ $ a_{n}\equal{}n\sqrt{5}\minus{} \lfloor n\sqrt{5}\rfloor$. Compute the maximum value and the minimum value of $ a_{1},a_{2},\ldots ,a_{2009}.$

Let $p,q$ be two distinct odd primes. Calculate $\displaystyle \sum_{j=1}^{\frac{p-1}{2}}\left \lfloor \frac{qj}{p}\right \rfloor +\sum_{j=1}^{\frac{q-1}{2}}\left \lfloor \frac{pj}{q}\right\rfloor$.

Find a nonzero polynomial $P(x,y)$ such that $P(\lfloor a\rfloor,\lfloor 2a\rfloor)=0$ for all real numbers $a.$ (Note: $\lfloor v\rfloor$ is the greatest integer less than or equal to $v.$)

Let $a_1$, $a_2$, $a_3$, $a_4$, $a_5$ be real numbers whose sum is $20$. Determine with proof the smallest possible value of \[ \displaystyle\sum_{1\le i \le j \le 5} \lfloor a_i + a_j \rfloor. \]

a) Prove that the function $F:\mathbb{R}\rightarrow \mathbb{R},\ F(x)=2\lfloor x\rfloor-\cos(3\pi\{x\})$ is continuous over $\mathbb{R}$ and for any $y\in \mathbb{R}$, the equation $F(x)=y$ has exactly three solutions. b) Let $k$ a positive even integer. Prove that there is no function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $f$ is continuous over $\mathbb{R}$ and that for any $y\in \text{Im}\ f$, the equation $f(x)=y$ has exactly $k$ solutions $(\text{Im}\ f=f(\mathbb{R}))$.

Hexagon $ABCDEF$ is divided into four rhombuses, $\mathcal{P, Q, R, S,}$ and $\mathcal{T,}$ as shown. Rhombuses $\mathcal{P, Q, R,}$ and $\mathcal{S}$ are congruent, and each has area $\sqrt{2006}$. Let $K$ be the area of rhombus $\mathcal{T}$. Given that $K$ is a positive integer, find the number of possible values for $K$. [asy] size(150);defaultpen(linewidth(0.7)+fontsize(10)); draw(rotate(45)*polygon(4)); pair F=(1+sqrt(2))*dir(180), C=(1+sqrt(2))*dir(0), A=F+sqrt(2)*dir(45), E=F+sqrt(2)*dir(-45), B=C+sqrt(2)*dir(180-45), D=C+sqrt(2)*dir(45-180); draw(F--(-1,0)^^C--(1,0)^^A--B--C--D--E--F--cycle); pair point=origin; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$\mathcal{P}$", intersectionpoint( A--(-1,0), F--(0,1) )); label("$\mathcal{S}$", intersectionpoint( E--(-1,0), F--(0,-1) )); label("$\mathcal{R}$", intersectionpoint( D--(1,0), C--(0,-1) )); label("$\mathcal{Q}$", intersectionpoint( B--(1,0), C--(0,1) )); label("$\mathcal{T}$", point); dot(A^^B^^C^^D^^E^^F);[/asy]

If $ n$ runs through all the positive integers, then $ f(n) \equal{} \left \lfloor n \plus{} \sqrt {3n} \plus{} \frac {1}{2} \right \rfloor$ runs through all positive integers skipping the terms of the sequence $ a_n \equal{} \left \lfloor \frac {n^2 \plus{} 2n}{3} \right \rfloor$.

Show that $\sum^{\infty}_{n=1}\frac{(-1)^{n-1}\sin(\log n)}{n^\alpha}$ converges iff $\alpha>0$.

Let $ S$ be a set with $ n$ elements, and $ F$ be a family of subsets of $ S$ with $ 2^{n\minus{}1}$ elements, such that for each $ A,B,C\in F$, $ A\cap B\cap C$ is not empty. Prove that the intersection of all of the elements of $ F$ is not empty.

Prove that there is no positive rational number $x$ such that \[x^{\lfloor x\rfloor }=\frac{9}{2}.\]

The number of postive integers less than $1000$ divisible by neither $5$ nor $7$ is: $\text{(A)}\ 688 \qquad \text{(B)}\ 686\qquad \text{(C)}\ 684 \qquad \text{(D)}\ 658\qquad \text{(E)}\ 630$

Prove the following inequality. \[n^ne^{-n+1}\leq n!\leq \frac 14(n+1)^{n+1}e^{-n+1}.\]

Find necessary and sufficient conditions on positive integers $m$ and $n$ so that \[\sum_{i=0}^{mn-1}(-1)^{\lfloor i/m\rfloor+\lfloor i/n\rfloor}=0.\]

Let $c$ be a positive integer. Consider the sequence $x_1,x_2,\ldots$ which satisfies $x_1=c$ and, for $n\ge 2$, \[x_n=x_{n-1}+\left\lfloor\frac{2x_{n-1}-(n+2)}{n}\right\rfloor+1\] where $\lfloor x\rfloor$ denotes the largest integer not greater than $x$. Determine an expression for $x_n$ in terms of $n$ and $c$. [i]Huang Yumin[/i]

For every natural number $n$ we define \[f(n)=\left\lfloor n+\sqrt{n}+\frac{1}{2}\right\rfloor\] Show that for every integer $k \geq 1$ the equation \[f(f(n))-f(n)=k\] has exactly $2k-1$ solutions.

Find all pairs $(a, b)$ of real numbers such that $a \cdot \lfloor b \cdot n\rfloor = b \cdot \lfloor a \cdot n \rfloor$ applies to all positive integers$ n$. (For a real number $x, \lfloor x\rfloor$ denotes the largest integer that is less than or equal to $x$.)

Let $\lfloor x\rfloor$ denote the greatest integer less than or equal to $x$. Let $m$ be a positive integer, $m\geq 3$. For every integer $i$ with $1\leq i\leq m$, let \[S_{m,i}=\left\{\left\lfloor\dfrac{2^m-1}{2^{i-1}}n-2^{m-i}+1\right\rfloor\,:\,n=1,2,3,\ldots\right\}.\] For example, for $m=3$, \begin{align*}S_{3,1}&=\{\lfloor 7n-3\rfloor\,:\,n=1,2,3,\ldots\} \\&=\{4,11,18,\ldots\}, \\S_{3,2}&=\left\{\left\lfloor\dfrac72n-1\right\rfloor\,:\,n=1,2,3,\ldots\right\} \\&=\{2,6,9,\ldots\}, \\S_{3,3}&=\left\{\left\lfloor\dfrac74n\right\rfloor\,:\,n=1,2,3,\ldots\right\} \\&=\{1,3,5,\ldots\}.\end{align*} Prove that for all $m\geq 3$, each positive integer occurs in exactly one of the sets $S_{m,i}$.

A ray of light originates from point $A$ and and travels in a plane, being reflected $n$ times between lines $AD$ and $CD$, before striking a point $B$ (which may be on $AD$ or $CD$) perpendicularly and retracing its path to $A$. (At each point of reflection the light makes two equal angles as indicated in the adjoining figure. The figure shows the light path for $n = 3.$) If $\measuredangle CDA = 8^\circ$, what is the largest value $n$ can have? $\text{(A)} \ 6 \qquad \text{(B)} \ 10 \qquad \text{(C)} \ 38 \qquad \text{(D)} \ 98 \qquad \text{(E)} \ \text{There is no largest value.}$

What is the largest possible number of subsets of the set $\{1, 2, \dots , 2n+1\}$ such that the intersection of any two subsets consists of one or several consecutive integers?

Find all integers $n$ such that $\left[\frac{n}{1!}\right] + \left[\frac{n}{2!}\right] + ... + \left[\frac{n}{10!}\right] = 1001$.

Given a positive integer $ n>3$, prove that the least common multiple of the products $ x_1x_2\cdots x_k$ ($ k\geq 1$) whose factors $ x_i$ are positive integers with $ x_1\plus{}x_2\plus{}\cdots\plus{}x_k\le n$, is less than $ n!$.

Determine whether it's possible to cover a $K_{2012}$ with a) 1000 $K_{1006}$'s; b) 1000 $K_{1006,1006}$'s. [i]David Yang.[/i]