The number $5^{867}$ is between $2^{2013}$ and $2^{2014}$. How many pairs of integers $(m,n)$ are there such that $1\leq m\leq 2012$ and \[5^n<2^m<2^{m+2}<5^{n+1}?\] $\textbf{(A) }278\qquad \textbf{(B) }279\qquad \textbf{(C) }280\qquad \textbf{(D) }281\qquad \textbf{(E) }282\qquad$

Let $k\geq 0$ an integer. The sequence $a_0,\ a_1,\ a_2, \ a_3, \ldots$ is defined as follows: [LIST] [*] $a_0=k$ [/*] [*] For $n\geq 1$, we have that $a_n$ is the smallest integer greater than $a_{n-1}$ so that $a_n+a_{n-1}$ is a perfect square. [/*] [/LIST] Prove that there are exactly $\left \lfloor{\sqrt{2k}} \right \rfloor$ positive integers that cannot be written as the difference of two elements of such a sequence. [i]Note.[/i] If $x$ is a real number, $\left \lfloor{x} \right \rfloor$ denotes the greatest integer smaller or equal than $x$.

If $a, b, c$ are real numbers such that $a+b+c=6$ and $ab+bc+ca = 9$, find the sum of all possible values of the expression $\lfloor a \rfloor + \lfloor b \rfloor + \lfloor c \rfloor$.

[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$.

Find all polynomials with real coefficients such that one can find an integer valued series $a_0, a_1, \dots$ satisfying $\lfloor P(x) \rfloor = a_{ \lfloor x^2 \rfloor}$ for all $x$ real numbers.

Within the real numbers, solve the equation $$x^5 + \lfloor x \rfloor = 20$$ where $\lfloor x \rfloor$ denotes the largest whole number less than or equal to $x$.

A positive integer $n$ is [i]magical[/i] if $\lfloor \sqrt{\lceil \sqrt{n} \rceil} \rfloor=\lceil \sqrt{\lfloor \sqrt{n} \rfloor} \rceil$. Find the number of magical integers between $1$ and $10,000$ inclusive.

let $x,y,z$ be positive reals , such that $x+y+z=1399$ find the $$\max( [x]y + [y]z + [z]x ) $$ ( $[a]$ is the biggest integer not exceeding $a$)

For any real number $x$, let $\lfloor x \rfloor$ denote the integer part of $x$; $\{ x \}$ be the fractional part of $x$ ($\{x\}$ $=$ $x-$ $\lfloor x \rfloor$). Let $A$ denote the set of all real numbers $x$ satisfying $$\{x\} =\frac{x+\lfloor x \rfloor +\lfloor x + (1/2) \rfloor }{20}$$ If $S$ is the sume of all numbers in $A$, find $\lfloor S \rfloor$

For each positive real number $\alpha$, define $$\lfloor \alpha \mathbb{N}\rfloor :=\{\lfloor \alpha m \rfloor\; |\; m\in \mathbb{N}\}.$$ Let $n$ be a positive integer. A set $S\subseteq \{1,2,\ldots,n\}$ has the property that: for each real $\beta >0$, $$ \text{if}\; S\subseteq \lfloor \beta \mathbb{N} \rfloor, \text{then}\; \{1,2,\ldots,n\} \subseteq \lfloor \beta\mathbb{N}\rfloor.$$ Determine, with proof, the smallest positive size of $S$.

(a) Show that the equation \[\lfloor x \rfloor (x^2 + 1) = x^3,\] where $\lfloor x \rfloor$ denotes the largest integer not larger than $x$, has exactly one real solution in each interval between consecutive positive integers. (b) Show that none of the positive real solutions of this equation is rational.

Let $a_1,a_2,\ldots,a_n,\ldots$ be any permutation of all positive integers. Prove that there exist infinitely many positive integers $i$ such that $\gcd(a_i,a_{i+1})\leq \frac{3}{4} i$.

Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.

Determine all real numbers $x>1$ such that \[ \left\lfloor\frac{n+1}{x}\right\rfloor = n - \left\lfloor \frac{n}{x} \right\rfloor + \left \lfloor \frac{\left \lfloor \frac{n}{x} \right\rfloor}{x}\right \rfloor - \left \lfloor \frac{\left \lfloor \frac{\left\lfloor \frac{n}{x} \right\rfloor}{x} \right\rfloor}{x}\right \rfloor + \cdots \] for any positive integer $n$.

The infinite sequence of 2's and 3's \[\begin{array}{l}2,3,3,2,3,3,3,2,3,3,3,2,3,3,2,3,3, \\ 3,2,3,3,3,2,3,3,3,2,3,3,2,3,3,3,2,\cdots \end{array}\] has the property that, if one forms a second sequence that records the number of 3's between successive 2's, the result is identical to the given sequence. Show that there exists a real number $r$ such that, for any $n$, the $n$th term of the sequence is 2 if and only if $n = 1+\lfloor rm \rfloor$ for some nonnegative integer $m$.

Let $j$ and $k$ be integers. Prove that the inequality $$\lfloor(j+k)\alpha\rfloor+\lfloor(j+k)\beta\rfloor\ge\lfloor j\alpha\rfloor+\lfloor j\beta\rfloor+\lfloor k(\alpha+\beta)\rfloor$$holds for all real numbers $\alpha,\beta$ if and only if $j=k$.

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

In an island, there exist 7 towns and a railway system which connected some of the towns. Every railway segment connects 2 towns, and in every town there exists at least 3 railway segments that connects the town to another towns. Prove that there exists a route that visits 4 different towns once and go back to the original town. (Example: $ A\minus{}B\minus{}C\minus{}D\minus{}A$)

Let $D$ be the set of all pairs $(i,j)$, $1\le i,j\le n$. Prove there exists a subset $S \subset D$, with $|S|\ge\left \lfloor\frac{3n(n+1)}{5}\right \rfloor$, such that for any $(x_1,y_1), (x_2,y_2) \in S$ we have $(x_1+x_2,y_1+y_2) \not \in S$. (Peter Cameron)

$f(x) = [x] + [2x] + [3x] + [4x] + [5x] + [6x]$. What values does $f$ take?

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.

Determine all real-coefficient polynomials $P(x)$ such that \[ P(\lfloor x \rfloor) = \lfloor P(x) \rfloor \]for every real numbers $x$.

In a checked $ 17\times 17$ table, $ n$ squares are colored in black. We call a line any of rows, columns, or any of two diagonals of the table. In one step, if at least $ 6$ of the squares in some line are black, then one can paint all the squares of this line in black. Find the minimal value of $ n$ such that for some initial arrangement of $ n$ black squares one can paint all squares of the table in black in some steps.

Given a positive integer $k$, find the least integer $n_k$ for which there exist five sets $S_1, S_2, S_3, S_4, S_5$ with the following properties: \[|S_j|=k \text{ for } j=1, \cdots , 5 , \quad |\bigcup_{j=1}^{5} S_j | = n_k ;\] \[|S_i \cap S_{i+1}| = 0 = |S_5 \cap S_1|, \quad \text{for } i=1,\cdots ,4 \]

Suppose a function $f : \mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ satisfies $f(f(n)) + f(n+1) = n+2$ for all positive integer $n$. Prove that $f(f(n)+n) = n+1$ for all positive integer $n$.