Given a positive integer $n\ge 3$, colour each cell of an $n\times n$ square array with one of $\lfloor (n+2)^2/3\rfloor$ colours, each colour being used at least once. Prove that there is some $1\times 3$ or $3\times 1$ rectangular subarray whose three cells are coloured with three different colours. [i](Russia) Ilya Bogdanov, Grigory Chelnokov, Dmitry Khramtsov[/i]

Find the largest positive integer $N$ so that the number of integers in the set $\{1,2,\dots,N\}$ which are divisible by 3 is equal to the number of integers which are divisible by 5 or 7 (or both).

For any real number $t$, denote by $[t]$ the greatest integer which is less than or equal to $t$. For example: $[8] = 8$, $[\pi] = 3$, and $[-5/2] = -3$. Show that the equation \[[x] + [2x] + [4x] + [8x] + [16x] + [32x] = 12345\] has no real solution.

Evaluate the sum $\left\lfloor\log_21\right\rfloor+\left\lfloor\log_22\right\rfloor+\left\lfloor\log_23\right\rfloor+\ldots+\left\lfloor\log_2256\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.$)

Find an integral solution of the equation \[ \left \lfloor \frac{x}{1!} \right \rfloor + \left \lfloor \frac{x}{2!} \right \rfloor + \left \lfloor \frac{x}{3!} \right \rfloor + \dots + \left \lfloor \frac{x}{10!} \right \rfloor = 2019. \] (Note $\lfloor u \rfloor$ stands for the greatest integer less than or equal to $u$.)

Some of $n$ towns are connected by two-way airlines. There are $m$ airlines in total. For $i = 1, 2, \cdots, n$, let $d_i$ be the number of airlines going from town $i$. If $1\le d_i \le 2010$ for each $i = 1, 2,\cdots, 2010$, prove that \[\displaystyle\sum_{i=1}^n d_i^2\le 4022m- 2010n\] Find all $n$ for which equality can be attained. [i]Proposed by Aleksandar Ilic[/i]

Given a positive integer $n$, we say that a polynomial $P$ with real coefficients is $n$-pretty if the equation $P(\lfloor x \rfloor)=\lfloor P(x) \rfloor$ has exactly $n$ real solutions. Show that for each positive integer $n$ [list=a] [*] there exists an n-pretty polynomial; [*] any $n$-pretty polynomial has a degree of at least $\tfrac{2n+1}{3}$. [/list] ([i]Remark.[/i] For a real number $x$, we denote by $\lfloor x \rfloor$ the largest integer smaller than or equal to $x$.)

For every positive integer $k$ let $a(k)$ be the largest integer such that $2^{a(k)}$ divides $k$. For every positive integer $n$ determine $a(1)+a(2)+\cdots+a(2^n)$.

A rectangular table $ 9$ rows $ \times$ $ 2008$ columns is fulfilled with numbers $ 1$, $ 2$, ...,$ 2008$ in a such way that each number appears exactly $ 9$ times in table and difference between any two numbers from same column is not greater than $ 3$. What is maximum value of minimum sum in column (with minimal sum)?

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.

In order to complete a large job, 1000 workers were hired, just enough to complete the job on schedule. All the workers stayed on the job while the first quarter of the work was done, so the first quarter of the work was completed on schedule. Then 100 workers were laid off, so the second quarter of the work was completed behind schedule. Then an additional 100 workers were laid off, so the third quarter of the work was completed still further behind schedule. Given that all workers work at the same rate, what is the minimum number of additional workers, beyond the 800 workers still on the job at the end of the third quarter, that must be hired after three-quarters of the work has been completed so that the entire project can be completed on schedule or before?

Find all positive numbers $x$ such that:$$\frac{1}{[x]}-\frac{1}{[2x]}=\frac{1}{6\{x\}}$$ where $[x]$ represents the integer part of $x$ and $\{x\}=x-[x]$.

Suppose $ a, b,$ and $ c$ are positive integers with $ a \plus{} b \plus{} c \equal{} 2006$, and $ a!b!c! \equal{} m\cdot10^n$, where $ m$ and $ n$ are integers and $ m$ is not divisible by 10. What is the smallest possible value of $ n$? $ \textbf{(A) } 489 \qquad \textbf{(B) } 492 \qquad \textbf{(C) } 495 \qquad \textbf{(D) } 498 \qquad \textbf{(E) } 501$

Prove that there exist infinitely many positive integers $n$ such that $\sqrt{n}$ is not an integer and $n$ is divisible by $[\sqrt{n}] $.