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]

Find all real $x$ such that $$\lfloor x \lceil x \rceil \rfloor = 2022.$$ Express your answer in interval notation.

In chess tournament participates $n$ participants ($n >1$). In tournament each of participants plays with each other exactly $1$ game. For each game participant have $1$ point if he wins game, $0,5$ point if game is drow and $0$ points if he lose game. If after ending of tournament participant have at least $ 75 % $ of maximum possible points he called $winner$ $of$ $tournament$. Find maximum possible numbers of $winners$ $of$ $tournament$.

Show that for all prime numbers $p$, \[Q(p)=\prod^{p-1}_{k=1}k^{2k-p-1}\] is an integer.

Evaluate the sum \[ \dfrac {1}{2 \lfloor \sqrt {1} \rfloor + 1} + \dfrac {1}{2 \lfloor \sqrt {2} \rfloor + 1} + \dfrac {1}{2 \lfloor \sqrt {3} \rfloor + 1} + \cdots + \dfrac {1}{2 \lfloor \sqrt {100} \rfloor + 1} \]

Find the number of triples $(x,a,b)$ where $x$ is a real number and $a,b$ belong to the set $\{1,2,3,4,5,6,7,8,9\}$ such that $$x^2-a\{x\}+b=0.$$ where $\{x\}$ denotes the fractional part of the real number $x$.

Find all possible values of $$ \lfloor \frac{x - p}{p} \rfloor + \lfloor \frac{-x-1}{p} \rfloor $$ where $x$ is a real number and $p$ is a nonzero integer. Here $\lfloor z \rfloor$ denotes the greatest integer less than or equal to $z$.

For each positive integer, define a function \[ f(n)=\begin{cases}0, &\text{if n is the square of an integer}\\ \\ \left\lfloor\frac{1}{\{\sqrt{n}\}}\right\rfloor, &\text{if n is not the square of an integer}\end{cases}. \] Find the value of $\sum_{k=1}^{200} f(k)$.

It's known that there is always a prime between $n$ and $2n-7$ for all $n \ge 10$. Prove that, with the exception of $1$, $4$, and $6$, every natural number can be written as the sum of distinct primes.

Calculate $\displaystyle{\sum_{n=1}^\infty\left(\lfloor\sqrt[n]{2010}\rfloor-1\right)}$ where $\lfloor x\rfloor$ is the largest integer less than or equal to $x$.

Prove that for every composite number $ n>4$, numbers $ kn$ divides $ (n\minus{}1)!$ for every integer $ k$ such that $ 1\le k\le \lfloor \sqrt{n\minus{}1} \rfloor$.

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.

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$

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.

Let $f:[-1,1]\rightarrow\mathbb{R}$ be a continuous function. Show that: a) if $\int_0^1 f(\sin (x+\alpha ))\, dx=0$, for every $\alpha\in\mathbb{R}$, then $f(x)=0,\ \forall x\in [-1,1]$. b) if $\int_0^1 f(\sin (nx))\, dx=0$, for every $n\in\mathbb{Z}$, then $f(x)=0,\ \forall x\in [-1,1]$.

Prove that for all $n\in\mathbb{Z}^+$, we have \[ \sum\limits_{p=1}^n\sum\limits_{q=1}^p\left\lfloor -\frac{1+\sqrt{8q+(2p-1)^2}}{2}\right\rfloor =-\frac{n(n+1)(n+2)}{3} \]

At a competition with $N$ players, the number of players given elite status is equal to \[2^{1+\lfloor\log_2{(N-1)}\rfloor} - N. \] Suppose that $19$ players are given elite status. What is the sum of the two smallest possible values of $N$? $ \textbf{(A)}\ 38\qquad \textbf{(B)}\ 90 \qquad \textbf{(C)}\ 154 \qquad \textbf{(D)}\ 406 \qquad \textbf{(E)}\ 1024$

Prove that for any natural number $n$, the number $\dbinom{2n}{n}$ divides the least common multiple of the numbers $1, 2,\cdots, 2n -1, 2n$.

Let $A=\{1,2,3,\ldots,40\}$. Find the least positive integer $k$ for which it is possible to partition $A$ into $k$ disjoint subsets with the property that if $a,b,c$ (not necessarily distinct) are in the same subset, then $a\ne b+c$.

Let \[N= \sum_{k=1}^{1000}k(\lceil \log_{\sqrt{2}}k\rceil-\lfloor \log_{\sqrt{2}}k \rfloor).\] Find the remainder when N is divided by 1000. (Here $\lfloor x \rfloor$ denotes the greatest integer that is less than or equal to x, and $\lceil x \rceil$ denotes the least integer that is greater than or equal to x.)

For every integer $n > 1$, the sequence $\left( {{S}_{n}} \right)$ is defined by ${{S}_{n}}=\left\lfloor {{2}^{n}}\underbrace{\sqrt{2+\sqrt{2+...+\sqrt{2}}}}_{n\ radicals} \right\rfloor $ where $\left\lfloor x \right\rfloor$ denotes the floor function of $x$. Prove that ${{S}_{2001}}=2\,{{S}_{2000}}+1$. .

Find all functions $f : \mathbb{R} \to \mathbb{Z}$ which satisfy the conditions: $f(x+y) < f(x) + f(y)$ $f(f(x)) = \lfloor {x} \rfloor + 2$

Do there exist integers $a$ and $b$ such that : (a) the equation $x^2 + ax + b = 0$ has no real roots, and the equation $\lfloor x^2 \rfloor + ax + b = 0$ has at least one real root? [i](2 points)[/i] (b) the equation $x^2 + 2ax + b$ = 0 has no real roots, and the equation $\lfloor x^2 \rfloor + 2ax + b = 0$ has at least one real root? [i]3 points[/i] (By $\lfloor k \rfloor$ we denote the integer part of $k$, that is, the greatest integer not exceeding $k$.) [i]Alexandr Khrabrov[/i]

There are several scientists collaborating in Niichavo. During an $ 8$-hour working day, the scientists went to cafeteria, possibly several times.It is known that for every two scientist, the total time in which exactly one of them was in cafeteria is at least $ x$ hours ($ x>4$). What is the largest possible number of scientist that could work in Niichavo that day,in terms of $ x$?

For any number $x$, let $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$. A sequence $a_1,a_2,\cdots$ is given, where \[a_n=\left\lfloor{\sqrt{2n}+\dfrac{1}{2}}\right\rfloor.\] How many values of $k$ are there such that $a_k=2010$?