The first number in the following sequence is $1$. It is followed by two $1$'s and two $2$'s. This is followed by three $1$'s, three $2$'s, and three $3$'s. The sequence continues in this fashion. \[1,1,1,2,2,1,1,1,2,2,2,3,3,3,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,\dots.\] Find the $2014$th number in this sequence.

Let $[z]$ denote the greatest integer not exceeding $z$. Let $x$ and $y$ satisfy the simultaneous equations \[ \begin{array}{c} y=2[x]+3, \\ y=3[x-2]+5. \end{array} \]If $x$ is not an integer, then $x+y$ is $\textbf {(A) } \text{an integer} \qquad \textbf {(B) } \text{between 4 and 5} \qquad \textbf {(C) } \text{between -4 and 4} \qquad \textbf {(D) } \text{between 15 and 16} \qquad \textbf {(E) } 16.5$

For a positive integer $n$, two payers $A$ and $B$ play the following game: Given a pile of $s$ stones, the players take turn alternatively with $A$ going first. On each turn the player is allowed to take either one stone, or a prime number of stones, or a positive multiple of $n$ stones. The winner is the one who takes the last stone. Assuming both $A$ and $B$ play perfectly, for how many values of $s$ the player $A$ cannot win?

How many four-digit multiples of $8$ are greater than $2008$?

Find all positive numbers $x$ such that $20\{x\}+0.5\lfloor x\rfloor = 2005$.

Let $a, b$ and $c$ be real numbers such that $$\lceil a \rceil + \lceil b \rceil + \lceil c \rceil + \lfloor a + b \rfloor + \lfloor b + c \rfloor + \lfloor c + a \rfloor = 2020$$ Prove that $$\lfloor a \rfloor + \lfloor b \rfloor + \lfloor c \rfloor + \lceil a + b + c \rceil \ge 1346$$ Note: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$, and $\lceil x \rceil$ is the smallest integer greater than or equal to $x$. That is, $\lfloor x \rfloor$ is the unique integer satisfying $\lfloor x \rfloor \le x < \lfloor x \rfloor + 1$, and $\lceil x \rceil$ is the unique integer satisfying $\lceil x \rceil - 1 < x \le \lceil x \rceil$. [i]Proposed by Ariel García[/i]

Let $P$ be the number of ways to partition $2013$ into an ordered tuple of prime numbers. What is $\log_2 (P)$? If your answer is $A$ and the correct answer is $C$, then your score on this problem will be $\left\lfloor\frac{125}2\left(\min\left(\frac CA,\frac AC\right)-\frac35\right)\right\rfloor$ or zero, whichever is larger.

Let be a natural number $ n\ge 3. $ Solve the equation $ \lfloor x/n \rfloor =\lfloor x-n \rfloor $ in $ \mathbb{R} . $ [i]Constantin Nicolau[/i]

Find all pairs $(x,y)$ of positive real numbers such that $xy$ is an integer and $x+y = \lfloor x^2 - y^2 \rfloor$.

Let $n \geq 2$ be a positive integer. Consider the following equation: \[ \{x\}+\{2x\}+ \dots + \{nx\} = \lfloor x \rfloor + \lfloor 2x \rfloor + \dots + \lfloor 2nx \rfloor\] a) For $n=2$, solve the given equation in $\mathbb{R}$. b) Prove that, for any $n \geq 2$, the equation has at most $2$ real solutions.

Let $X$ be a non-empty set of positive integers which satisfies the following: [list] [*] if $x \in X$, then $4x \in X$, [*] if $x \in X$, then $\lfloor \sqrt{x}\rfloor \in X$. [/list] Prove that $X=\mathbb{N}$.

Find all real solutions $x$ of the equation $$\lfloor x^2-2 \rfloor +2 \lfloor x \rfloor = \lfloor x \rfloor ^2. $$ .

Let $(a_k)^{\infty}_{k=0}$ be a sequence of real numbers such that if $k$ is a non-negative integer, then $$a_{k+1} = 3a_k - \lfloor 2a_k \rfloor - \lfloor a_k \rfloor.$$ Definitely all positive integers $n$ such that if $a_0 = 1/n$, then this sequence is constant after a certain term.

Prove that if $a$ and $b$ are positive integers and $ab>1$, then \[\left\lfloor\frac{(a-b)^2-1}{ab}\right\rfloor=\left\lfloor\frac{(a-b)^2-1}{ab-1}\right\rfloor.\]Here $\lfloor x\rfloor$ denotes the greatest integer not exceeding $x$. [i]Calvin Deng.[/i]

In rectangle $ ABCD$, $ AB\equal{}100$. Let $ E$ be the midpoint of $ \overline{AD}$. Given that line $ AC$ and line $ BE$ are perpendicular, find the greatest integer less than $ AD$.

[b](a)[/b] Let $n$ be a positive integer, prove that \[ \sqrt{n+1} - \sqrt{n} < \frac{1}{2 \sqrt n}\] [b](b)[/b] Find a positive integer $n$ for which \[ \bigg\lfloor 1 +\frac{1}{\sqrt 2} +\frac{1}{\sqrt 3} +\frac{1}{\sqrt 4} + \cdots +\frac{1}{\sqrt n} \bigg\rfloor =12\]

Given a square-free integer $n>2$, evaluate the sum $\sum_{k=1}^{(n-2)(n-1)} \lfloor ({kn})^{1/3} \rfloor$.

An integer sequence $\{a_{n}\}_{n \ge 1}$ is defined by \[a_{1}=1, \; a_{n+1}=a_{n}+\lfloor \sqrt{a_{n}}\rfloor.\] Show that $a_{n}$ is a square if and only if $n=2^{k}+k-2$ for some $k \in \mathbb{N}$.

[i]The Algorithm.[/i] There are thirteen broken computers situated at the following set $S$ of thirteen points in the plane: \[\begin{array}{ccc}A=(1,10)&B=(976,9)&C=(666,87)\\D=(377,422)&E=(535,488)&F=(775,488) \\ G=(941,500) & H=(225,583)&I=(388,696)\\J=(3,713)&K=(504,872)&L=(560,934)\\&M=(22,997)&\end{array}\] At time $t=0$, a repairman begins moving from one computer to the next, traveling continuously in straight lines at unit speed. Assuming the repairman begins and $A$ and fixes computers instantly, what path does he take to minimize the [i]total downtime[/i] of the computers? List the points he visits in order. Your score will be $\left\lfloor \dfrac{N}{40}\right\rfloor$, where \[N=1000+\lfloor\text{the optimal downtime}\rfloor - \lfloor \text{your downtime}\rfloor ,\] or $0$, whichever is greater. By total downtime we mean the sum \[\sum_{P\in S}t_P,\] where $t_P$ is the time at which the repairman reaches $P$.

Let $a, b, n \in \mathbb{N}$, with $a, b \geq 2.$ Also, let $I_{1}(n)=\int_{0}^{1} \left \lfloor{a^n x} \right \rfloor dx $ and $I_{2} (n) = \int_{0}^{1} \left \lfloor{b^n x} \right \rfloor dx.$ Find $\lim_{n \to \infty} \dfrac{I_1(n)}{I_{2}(n)}.$

There are $ 2009$ pebbles in some points $ (x,y)$ with both coordinates integer. A operation consists in choosing a point $ (a,b)$ with four or more pebbles, removing four pebbles from $ (a,b)$ and putting one pebble in each of the points \[ (a,b\minus{}1),\ (a,b\plus{}1),\ (a\minus{}1,b),\ (a\plus{}1,b)\] Show that after a finite number of operations each point will necessarily have at most three pebbles. Prove that the final configuration doesn't depend on the order of the operations.

Let $N$ be a natural number. Find (with prove) the number of solutions in the segment $[1,N]$ of the equation $x^2-[x^2]=(x-[x])^2$, where $[x]$ means the floor function of $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$ be a prime such that $p \equiv 1 (\text {mod}4)$. Evaluate \[\sum_{k=1}^{p-1} \left( \left \lfloor \frac{2k^2}{p}\right \rfloor - 2 \left \lfloor {\frac{k^2}{p}}\right \rfloor \right)\]

Prove that there is an infinite number of such numbers $B$ that the equation $\lfloor x^3/2\rfloor + \lfloor y^3/2 \rfloor = B$ has at least $1980$ integer solutions $(x,y)$. ($\lfloor z\rfloor$ denotes the greatest integer not exceeding $z$.)