Let $n$ be a positive integer. Find the number of all polynomials $P$ with coefficients from the set $\{0,1,2,3\}$ and for which $P(2)=n$.

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)}.$

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

Let $x_1,x_2,\ldots,x_n $ be real numbers, where $n\ge 2$ is a given integer, and let $\lfloor{x_1}\rfloor,\lfloor{x_2}\rfloor,\ldots,\lfloor{x_n}\rfloor $ be a permutation of $1,2,\ldots,n$. Find the maximum and minimum of $\sum\limits_{i=1}^{n-1}\lfloor{x_{i+1}-x_i}\rfloor$ (here $\lfloor x\rfloor $ is the largest integer not greater than $x$).

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

Compute the sum of the real solutions to $\lfloor x \rfloor \{x\} = 2020x$. Here, $\lfloor x \rfloor$ is defined as the greatest integer less than or equal to $x$, and$ \{x\} = x -\lfloor x \rfloor$.

Compute the sum of all real solutions $\alpha$ (in radians) to the equation \[ |\sin\alpha|=\left\lfloor \frac{\alpha}{20} \right\rfloor. \]

Let $n$ be a natural number and $f(n) = 2n - 1995 \lfloor \frac{n}{1000} \rfloor$($\lfloor$ $\rfloor$ denotes the floor function). 1. Show that if for some integer $r$: $f(f(f...f(n)...))=1995$ (where the function $f$ is applied $r$ times), then $n$ is multiple of $1995$. 2. Show that if $n$ is multiple of 1995, then there exists r such that:$f(f(f...f(n)...))=1995$ (where the function $f$ is applied $r$ times). Determine $r$ if $n=1995.500=997500$

The numerical value of the following integral $$\int^1_0 (-x^2 + x)^{2017} \lfloor 2017x \rfloor dx$$ can be expressed in the form $a\frac{m!^2}{ n!}$ where a is minimized. Find $a + m + n$. (Note $\lfloor x\rfloor$ is the largest integer less than or equal to x.)

A $ 3 \times n$ grid is filled as follows. The first row consists of the numbers from $ 1$ to $ n$ arranged in ascending order. The second row is a cyclic shift of the top row: $ i,i\plus{}1,...,n,1,2,...,i\minus{}1$ for some $ i$. The third row has the numbers $ 1$ to $ n$ in some order so that in each of the $ n$ columns, the sum of the three numbers is the same. For which values of $ n$ is it possible to fill the grid in this way? For all such $ n$, determine the number of different ways of filling the grid.

Prove that $\lfloor{\sqrt{9n+7}}\rfloor=\lfloor{\sqrt{n}+\sqrt{n+1}+\sqrt{n+2}}\rfloor$ for all postive integer $n$.

Define $ n!!$ to be $ n(n\minus{}2)(n\minus{}4)\ldots3\cdot1$ for $ n$ odd and $ n(n\minus{}2)(n\minus{}4)\ldots4\cdot2$ for $ n$ even. When $ \displaystyle \sum_{i\equal{}1}^{2009} \frac{(2i\minus{}1)!!}{(2i)!!}$ is expressed as a fraction in lowest terms, its denominator is $ 2^ab$ with $ b$ odd. Find $ \displaystyle \frac{ab}{10}$.

Let $\lfloor \bullet \rfloor$ denote the floor function. For nonnegative integers $a$ and $b$, their [i]bitwise xor[/i], denoted $a \oplus b$, is the unique nonnegative integer such that $$ \left \lfloor \frac{a}{2^k} \right \rfloor+ \left\lfloor\frac{b}{2^k} \right\rfloor - \left\lfloor \frac{a\oplus b}{2^k}\right\rfloor$$ is even for every $k \ge 0$. Find all positive integers $a$ such that for any integers $x>y\ge 0$, we have \[ x\oplus ax \neq y \oplus ay. \] [i]Carl Schildkraut[/i]

Let $n$ be a positive integer. Let $P_n=\{2^n,2^{n-1}\cdot 3, 2^{n-2}\cdot 3^2, \dots, 3^n \}.$ For each subset $X$ of $P_n$, we write $S_X$ for the sum of all elements of $X$, with the convention that $S_{\emptyset}=0$ where $\emptyset$ is the empty set. Suppose that $y$ is a real number with $0 \leq y \leq 3^{n+1}-2^{n+1}.$ Prove that there is a subset $Y$ of $P_n$ such that $0 \leq y-S_Y < 2^n$

Prove that for any positive integers $k$ and $N$, \[\left(\frac{1}{N}\sum\limits_{n=1}^{N}(\omega (n))^k\right)^{\frac{1}{k}}\leq k+\sum\limits_{q\leq N}\frac{1}{q},\] where $\sum\limits_{q\leq N}\frac{1}{q}$ is the summation over of prime powers $q\leq N$ (including $q=1$). Note: For integer $n>1$, $\omega (n)$ denotes number of distinct prime factors of $n$, and $\omega (1)=0$.

For a positive integer $k$, define the $k$-[i]pop[/i] of a positive integer $n$ as the infinite sequence of integers $a_1, a_2, ...$ such that $a_1 = n$ and $$a_{i+1}= \left\lfloor \frac{a_i}{k} \right\rfloor , i = 1, 2, ..$$ where $ \lfloor x\rfloor $ denotes the greatest integer less than or equal to $x$. Furthermore, define a positive integer $m$ to be $k$-[i]pop avoiding[/i] if $k$ does not divide any nonzero term in the $k$-pop of $m$. For example, $14$ is 3-pop avoiding because $3$ does not divide any nonzero term in the $3$-pop of $14$, which is $14, 4, 1, 0, 0, ....$ Suppose that the number of positive integers less than $13^{2018}$ which are $13$-pop avoiding is equal to N. What is the remainder when $N$ is divided by $1000$?

Let $p$ and $n$ be positive integers, with $p\geq2$, and let $a$ be a real number such that $1\leq a<a+n\leq p$. Prove that the set \[ \mathcal {S}=\left\{\left\lfloor \log_{2}x\right\rfloor +\left\lfloor \log_{3}x\right\rfloor +\cdots+\left\lfloor \log_{p}x\right\rfloor\mid x\in\mathbb{R},a\leq x\leq a+n\right\} \] has exactly $n+1$ elements.

Let $M$ be the set of palindromic integers of the form $5n+4$ where $n\ge 0$ is an integer. [list=a] [*]If we write the elements of $M$ in increasing order, what is the $50^{\text{th}}$ number? [*]Among all numbers in $M$ with nonzero digits which sum up to $2014$ which is the largest and smallest one?[/list]

An infinite sequence $(x_{n})$ is defined by its first term $x_{1}>1$, which is a rational number, and the relation $x_{n+1}=x_{n}+\frac{1}{\lfloor x_{n}\rfloor}$ for all positive integers $n$. Prove that this sequence contains an integer. [i]A. Golovanov[/i]

Find the number of positive integers $x$ such that \[ \left[ \frac{x}{99} \right] = \left[ \frac{x}{101} \right] . \]

The remainder can be defined for all real numbers $x$ and $y$ with $y \neq 0$ by $$\text{rem} (x ,y)=x-y\left \lfloor \frac{x}{y} \right \rfloor$$ where $\left \lfloor \tfrac{x}{y} \right \rfloor$ denotes the greatest integer less than or equal to $\tfrac{x}{y}$. What is the value of $\text{rem} (\tfrac{3}{8}, -\tfrac{2}{5} )$? $\textbf{(A) } -\frac{3}{8} \qquad \textbf{(B) } -\frac{1}{40} \qquad \textbf{(C) } 0 \qquad \textbf{(D) } \frac{3}{8} \qquad \textbf{(E) } \frac{31}{40}$

Given that \[ \frac 1{2!17!}+\frac 1{3!16!}+\frac 1{4!15!}+\frac 1{5!14!}+\frac 1{6!13!}+\frac 1{7!12!}+\frac 1{8!11!}+\frac 1{9!10!}=\frac N{1!18!} \] find the greatest integer that is less than $\frac N{100}.$

Let $B = (20, 14)$ and $C = (18, 0)$ be two points in the plane. For every line $\ell$ passing through $B$, we color red the foot of the perpendicular from $C$ to $\ell$. The set of red points enclose a bounded region of area $\mathcal{A}$. Find $\lfloor \mathcal{A} \rfloor$ (that is, find the greatest integer not exceeding $\mathcal A$). [i]Proposed by Yang Liu[/i]

Prove that the set $S=\{\lfloor n\pi\rfloor \mid n=0,1,2,3,\ldots\}$ contains arithmetic progressions of any finite length, but no infinite arithmetic progressions. [i]Vasile Pop[/i]

Find the number of ending zeros of $2014!$ in base 9. Give your answer in base 9.