Let $a_1,a_2,a_3,\ldots,a_n$ be a sequence of non-negative integers, where $n$ is a positive integer. Let \[ A_n={a_1+a_2+\cdots+a_n\over n}\ . \] Prove that \[ a_1!a_2!\ldots a_n!\ge\left(\lfloor A_n\rfloor !\right)^n \] where $\lfloor A_n\rfloor$ is the greatest integer less than or equal to $A_n$, and $a!=1\times 2\times\cdots\times a$ for $a\ge 1$(and $0!=1$). When does equality hold?

Ten women sit in $ 10$ seats in a line. All of the $ 10$ get up and then reseat themselves using all $ 10$ seats, each sitting in the seat she was in before or a seat next to the one she occupied before. In how many ways can the women be reseated? $ \textbf{(A)}\ 89\qquad \textbf{(B)}\ 90\qquad \textbf{(C)}\ 120\qquad \textbf{(D)}\ 2^{10}\qquad \textbf{(E)}\ 2^2 3^8$

If $x$ is a positive real number, and $n$ is a positive integer, prove that \[[ nx] > \frac{[ x]}1 + \frac{[ 2x]}2 +\frac{[ 3x]}3 + \cdots + \frac{[ nx]}n,\] where $[t]$ denotes the greatest integer less than or equal to $t$. For example, $[ \pi] = 3$ and $\left[\sqrt2\right] = 1$.

Determine the least possible value of the natural number $n$ such that $n!$ ends in exactly $1987$ zeros.

A polynomial $P$ of degree $2015$ satisfies the equation $P(n)=\frac{1}{n^2}$ for $n=1, 2, \dots, 2016$. Find $\lfloor 2017P(2017)\rfloor$.

A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula \[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0; \]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large. [i]Proposed by Harmel Nestra, Estionia[/i]

(a) Prove that for every positive integer $m$ there exists an integer $n\ge m$ such that $$\left \lfloor \frac{n}{1} \right \rfloor \cdot \left \lfloor \frac{n}{2} \right \rfloor \cdots \left \lfloor \frac{n}{m} \right \rfloor =\binom{n}{m} \\\\\\\\\\\\\\\ (*)$$ (b) Denote by $p(m)$ the smallest integer $n \geq m$ such that the equation $ (*)$ holds. Prove that $p(2018) = p(2019).$ Remark: For a real number $x,$ we denote by $\left \lfloor x \right \rfloor$ the largest integer not larger than $x.$

How many positive integers $n$ satisfy$$\dfrac{n+1000}{70} = \lfloor \sqrt{n} \rfloor?$$(Recall that $\lfloor x\rfloor$ is the greatest integer not exceeding $x$.) $\textbf{(A) } 2 \qquad\textbf{(B) } 4 \qquad\textbf{(C) } 6 \qquad\textbf{(D) } 30 \qquad\textbf{(E) } 32$

Is there a positive integer $n$ such that the fractional part of \[ \left(3+\sqrt{5}\right)^n >0.99 ? \]

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

$f(k) = k + \left[ \frac{n}{k}\right ] $,$k \in \{1,2,..., n\}$, $k_0 =\left[ \sqrt{n} \right] + 1$. Prove that $f(k_0) < f(k)$ if $k \in \{1,2,..., n\}$

Let $k$ be a positive integer congruent to $1$ modulo $4$ which is not a perfect square and let $a=\frac{1+\sqrt{k}}{2}$. Show that $\{\left \lfloor{a^2n}\right \rfloor-\left \lfloor{a\left \lfloor{an}\right \rfloor}\right \rfloor : n \in \mathbb{N}_{>0}\}=\{1 , 2 , \ldots ,\left \lfloor{a}\right \rfloor\}$.

Let $x_1=1$, $x_2$, $x_3$, $\ldots$ be a sequence of real numbers such that for all $n\geq 1$ we have \[ x_{n+1} = x_n + \frac 1{2x_n} . \] Prove that \[ \lfloor 25 x_{625} \rfloor = 625 . \]

Let be given the sequence $(x_n)$ defined by $x_1 = 1$ and $x_{n+1} = 3x_n + \lfloor x_n \sqrt5 \rfloor$ for all $n = 1,2,3,...,$ where $\lfloor x \rfloor$ denotes the greatest integer that does not exceed $x$. Prove that for any positive integer $n$ we have $$x_nx_{n+2} - x^2_{n+1} = 4^{n-1}$$ Trần Nam Dũng

Define $\lfloor x \rfloor$ as the largest integer less than or equal to $x$. Define $\{x \} = x - \lfloor x \rfloor$. For example, $\{ 3 \} = 3-3 = 0$, $\{ \pi \} = \pi - 3$, and $\{ - \pi \} = 4-\pi$. If $\{n\} + \{ 3n\} = 1.4$, then find the sum of all possible values of $100\{n\}$. [i]Proposed by Isabella Grabski [/i]

Find the largest natural number $ n$ for which there exist different sets $ S_1,S_2,\ldots,S_n$ such that: $ 1^\circ$ $ |S_i\cup S_j|\leq 2004$ for each two $ 1\leq i,j\le n$ and $ 2^\circ$ $ S_i\cup S_j\cup S_k\equal{}\{1,2,\ldots,2008\}$ for each three integers $ 1\le i<j<k\le n$.

For a finite set $E$ of cardinality $n \geq 3$, let $f(n)$ denote the maximum number of $3$-element subsets of $E$, any two of them having exactly one common element. Calculate $f(n)$.

We define an operation $\oplus$ on the set $\{0, 1\}$ by \[ 0 \oplus 0 = 0 \,, 0 \oplus 1 = 1 \,, 1 \oplus 0 = 1 \,, 1 \oplus 1 = 0 \,.\] For two natural numbers $a$ and $b$, which are written in base $2$ as $a = (a_1a_2 \ldots a_k)_2$ and $b = (b_1b_2 \ldots b_k)_2$ (possibly with leading 0's), we define $a \oplus b = c$ where $c$ written in base $2$ is $(c_1c_2 \ldots c_k)_2$ with $c_i = a_i \oplus b_i$, for $1 \le i \le k$. For example, we have $7 \oplus 3 = 4$ since $ 7 = (111)_2$ and $3 = (011)_2$. For a natural number $n$, let $f(n) = n \oplus \left[ n/2 \right]$, where $\left[ x \right]$ denotes the largest integer less than or equal to $x$. Prove that $f$ is a bijection on the set of natural numbers.

How many real roots of the equation \[x^2 - 18[x]+77=0\] are not integer, where $[x]$ denotes the greatest integer not exceeding the real number $x$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{None of the preceding} $

Solve in $\mathbb{R}$ the equation $$\frac{1}{x}+\frac{1}{\lfloor x\rfloor} + \frac{1}{\{x\}} = 0.$$ [i]Mathematical Gazette[/i]

The largest integer not exceeding $[(n+1)a]-[na]$ where $n$ is a natural number, $a=\frac{\sqrt{2013}}{\sqrt{2014}}$ is: (A): $1$, (B): $2$, (C): $3$, (D): $4$, (E) None of the above.

Prove that for any integer $n$ one can find integers $a$ and $b$ such that \[n=\left[ a\sqrt{2}\right]+\left[ b\sqrt{3}\right] \]

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

Prove that among the elements of the sequence $\left( \left\lfloor n \sqrt 2 \right\rfloor + \left\lfloor n \sqrt 3 \right\rfloor \right)_{n \geq 0}$ are an infinity of even numbers and an infinity of odd numbers.

Let $G$ be a connected simple graph. When we add an edge to $G$ (between two unconnected vertices), then using at most $17$ edges we can reach any vertex from any other vertex. Find the maximum number of edges to be used to reach any vertex from any other vertex in the original graph, i.e. in the graph before we add an edge.