Found problems: 1340
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$).
Let $n$ be a positive integer such that $\lfloor\sqrt n\rfloor-2$ divides $n-4$ and $\lfloor\sqrt n\rfloor+2$ divides $n+4$. Find the greatest such $n$ less than $1000$. (Note: $\lfloor x\rfloor$ refers to the greatest integer less than or equal to $x$.)
Find all real numbers $ x$ such that $ \lfloor x^3 \rfloor \equal{} 4x \plus{} 3$.
At ARML, Santa is asked to give rubber duckies to $2013$ students, one for each student. The students are conveniently numbered $1,2,\cdots,2013$, and for any integers $1 \le m < n \le 2013$, students $m$ and $n$ are friends if and only if $0 \le n-2m \le 1$.
Santa has only four different colors of duckies, but because he wants each student to feel special, he decides to give duckies of different colors to any two students who are either friends or who share a common friend. Let $N$ denote the number of ways in which he can select a color for each student. Find the remainder when $N$ is divided by $1000$.
[i]Proposed by Lewis Chen[/i]
We define a sequence $ \left(a_{1},a_{2},a_{3},\ldots \right)$ by
\[ a_{n} \equal{} \frac {1}{n}\left(\left\lfloor\frac {n}{1}\right\rfloor \plus{} \left\lfloor\frac {n}{2}\right\rfloor \plus{} \cdots \plus{} \left\lfloor\frac {n}{n}\right\rfloor\right),
\] where $\lfloor x\rfloor$ denotes the integer part of $x$.
[b]a)[/b] Prove that $a_{n+1}>a_n$ infinitely often.
[b]b)[/b] Prove that $a_{n+1}<a_n$ infinitely often.
[i]Proposed by Johan Meyer, South Africa[/i]
There are $ 2009$ pebbles in some points $ (x,y)$ with both coordinates integer. A operation consists in choosing a point $ (a,b)$ with four or more pebbles, removing four pebbles from $ (a,b)$ and putting one pebble in each of the points
\[ (a,b\minus{}1),\ (a,b\plus{}1),\ (a\minus{}1,b),\ (a\plus{}1,b)\]
Show that after a finite number of operations each point will necessarily have at most three pebbles. Prove that the final configuration doesn't depend on the order of the operations.
Determine all positive real numbers $a$ such that there exists a positive integer $n$ and partition $A_1$, $A_2$, ..., $A_n$ of infinity sets of the set of the integers satisfying the following condition: for every set $A_i$, the positive difference of any pair of elements in $A_i$ is at least $a^i$.
At a conference there are $n$ mathematicians. Each of them knows exactly $k$ fellow mathematicians. Find the smallest value of $k$ such that there are at least three mathematicians that are acquainted each with the other two.
[color=#BF0000]Rewording of the last line for clarification:[/color]
Find the smallest value of $k$ such that there (always) exists $3$ mathematicians $X,Y,Z$ such that $X$ and $Y$ know each other, $X$ and $Z$ know each other and $Y$ and $Z$ know each other.
Given a positive integer $n$, define $\tau(n)$ as the number of positive divisors of $n$ and $\sigma(n)$ as the sum of those divisors. For example, $\tau(12) = 6$ and $\sigma(12) = 28$. Find all positive integers $n$ that satisfy:
\[
\sigma(n) = \tau(n) \cdot \lceil \sqrt{n} \rceil
\]
Find the minimum positive noninteger root of $ \sin x=\sin \lfloor x \rfloor $.
F. Petrov
Each term of an infinite sequence of natural numbers is obtained from the previous term by adding to it one of its nonzero digits. Prove that this sequence contains an even number.
For fixed positive integers $s, t$, define $a_n$ as the following.
$a_1 = s, a_2 = t$, and $\forall n \ge 1$, $a_{n+2} = \lfloor \sqrt{a_n+(n+2)a_{n+1}+2008} \rfloor$.
Prove that the solution set of $a_n \not= n$, $n \in \mathbb{N}$ is finite.
Given a permutation $(a_{1}, a_{1},...,a_{n})$ of the numbers $1, 2,...,n$ one may interchange any two consecutive "blocks" - that is, one may transform
($a_{1}, a_{2},...,a_{i}$,$\underbrace {a_{i+1},... a_{i+p},}_{A} $ $ \underbrace{a_{i+p+1},...,a_{i+q},}_{B}...,a_{n}) $
into
$ (a_{1}, a_{2},...,a_{i},$ $ \underbrace {a_{i+p+1},...,a_{i+q},}_{B} $ $ \underbrace {a_{i+1},... a_{i+p}}_{A}$$,...,a_{n}) $
by interchanging the "blocks" $A$ and $B$. Find the least number of such changes which are needed to transform $(n, n-1,...,1)$ into $(1,2,...,n)$
Find the number of positive integers $n$ less than $1000$ for which there exists a positive real number $x$ such that $n = x \lfloor x \rfloor$.
[b]Note[/b]: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.
Prove that for all positive integers $n$, \[\lfloor \sqrt[3]{n}+\sqrt[3]{n+1}\rfloor =\lfloor \sqrt[3]{8n+3}\rfloor.\]
Find all real numbers $x$ such that
$\lfloor x^2-2x \rfloor+2\lfloor x \rfloor=\lfloor x \rfloor^2$.
(For a real number $x$, $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$.)
A set of 10 distinct integers $S$ is chosen. Let $M$ be the number of nonempty subsets of $S$ whose elements have an even sum. What is the minimum possible value of $M$?
[hide="Clarifications"]
[list]
[*] $S$ is the ``set of 10 distinct integers'' from the first sentence.[/list][/hide]
[i]Ray Li[/i]
Let $ a, b, c$ be positive integers satisfying the conditions $ b > 2a$ and $ c > 2b.$ Show that there exists a real number $ \lambda$ with the property that all the three numbers $ \lambda a, \lambda b, \lambda c$ have their fractional parts lying in the interval $ \left(\frac {1}{3}, \frac {2}{3} \right].$
Find the sum of the decimal digits of \[ \left\lfloor \frac{51525354555657\dots979899}{50} \right\rfloor. \] Here $\left\lfloor x \right\rfloor$ is the greatest integer not exceeding $x$.
[i]Proposed by Evan Chen[/i]
Let $n$ be an integer greater than $1$. Define
\[x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \qquad \text{for }i = 1, 2, \ldots\ ,\]
where $[z]$ denotes the largest integer less than or equal to $z$. Prove that
\[ \min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]\]
Let $\sigma(x)$ denote the sum of divisors of natural number $x$, including $1$ and $x$. For every $n\in \mathbb{N}$ define $f(n)$ as number of natural numbers $m, m\leq n$, for which $\sigma(m)$ is odd number. Prove that there are infinitely many natural numbers $n$, such that $f(n)|n$.
Let $S$ be the set of $n$-uples $\left( x_{1}, x_{2}, \ldots, x_{n}\right)$ such that $x_{i}\in \{ 0, 1 \}$ for all $i \in \overline{1,n}$, where $n \geq 3$. Let $M(n)$ be the smallest integer with the property that any subset of $S$ with at least $M(n)$ elements contains at least three $n$-uples \[\left( x_{1}, \ldots, x_{n}\right), \, \left( y_{1}, \ldots, y_{n}\right), \, \left( z_{1}, \ldots, z_{n}\right) \] such that
\[\sum_{i=1}^{n}\left( x_{i}-y_{i}\right)^{2}= \sum_{i=1}^{n}\left( y_{i}-z_{i}\right)^{2}= \sum_{i=1}^{n}\left( z_{i}-x_{i}\right)^{2}. \]
(a) Prove that $M(n) \leq \left\lfloor \frac{2^{n+1}}{n}\right\rfloor+1$.
(b) Compute $M(3)$ and $M(4)$.
For a real number $x$, let $\lfloor x\rfloor$ stand for the largest integer that is less than or equal to $x$. Prove that
\[ \left\lfloor{(n-1)!\over n(n+1)}\right\rfloor \]
is even for every positive integer $n$.
The members of a distinguished committee were choosing a president, and each member gave one vote to one of the $27$ candidates. For each candidate, the exact percentage of votes the candidate got was smaller by at least $1$ than the number of votes for that candidate. What is the smallest possible number of members of the committee?
Indians find those sequences of non-negative real numbers $x_0, x_1,...$ [i]mystical [/i]t hat satisfy $x_0 < 2021$, $x_{i+1} = \lfloor x_i \rfloor \{x_i\}$ for every $i \ge 0$, furthermore the sequence contains an integer different from $0$. How many sequences are mystical according to the Indians?