Found problems: 1187
2005 France Team Selection Test, 4
Let $X$ be a non empty subset of $\mathbb{N} = \{1,2,\ldots \}$. Suppose that for all $x \in X$, $4x \in X$ and $\lfloor \sqrt{x} \rfloor \in X$. Prove that $X=\mathbb{N}$.
2012 JBMO TST - Turkey, 2
Let $S=\{1,2,3,\ldots,2012\}.$ We want to partition $S$ into two disjoint sets such that both sets do not contain two different numbers whose sum is a power of $2.$ Find the number of such partitions.
1982 Swedish Mathematical Competition, 1
How many solutions does
\[
x^2 - [x^2] = \left(x - [x]\right)^2
\]
have satisfying $1 \leq x \leq n$?
2007 Indonesia TST, 3
For each real number $ x$< let $ \lfloor x \rfloor$ be the integer satisfying $ \lfloor x \rfloor \le x < \lfloor x \rfloor \plus{}1$ and let $ \{x\}\equal{}x\minus{}\lfloor x \rfloor$. Let $ c$ be a real number such that \[ \{n\sqrt{3}\}>\dfrac{c}{n\sqrt{3}}\] for all positive integers $ n$. Prove that $ c \le 1$.
2008 Junior Balkan Team Selection Tests - Romania, 4
Let $ a,b$ be real nonzero numbers, such that number $ \lfloor an \plus{} b \rfloor$ is an even integer for every $ n \in \mathbb{N}$. Prove that $ a$ is an even integer.
2016 India PRMO, 8
Find the number of integer solutions of $\left[\frac{x}{100} \left[\frac{x}{100}\right]\right]= 5$
1998 Czech And Slovak Olympiad IIIA, 1
Solve the equation $x\cdot [x\cdot [x \cdot [x]]] = 88$ in the set of real numbers.
2015 India Regional MathematicaI Olympiad, 6
For how many integer values of $m$,
(i) $1\le m \le 5000$
(ii) $[\sqrt{m}] =[\sqrt{m+125}]$
Note: $[x]$ is the greatest integer function
2009 Kazakhstan National Olympiad, 3
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$.
2007 Stanford Mathematics Tournament, 4
How many positive integers $n$, with $n\le 2007$, yield a solution for $x$ (where $x$ is real) in the equation $\lfloor x \rfloor+\lfloor 2x\rfloor+\lfloor 3x\rfloor=n$?
PEN M Problems, 9
An integer sequence $\{a_{n}\}_{n \ge 1}$ is defined by \[a_{1}=2, \; a_{n+1}=\left\lfloor \frac{3}{2}a_{n}\right\rfloor.\] Show that it has infinitely many even and infinitely many odd integers.
2021 Latvia Baltic Way TST, P14
Prove that there exist infinitely many triples of positive integers $(a,b,c)$ so that $a,b,c$ are pairwise coprime and
$$\bigg \lfloor \frac{a^2}{2021} \bigg \rfloor + \bigg \lfloor \frac{b^2}{2021} \bigg \rfloor = \bigg \lfloor \frac{c^2}{2021} \bigg \rfloor.$$
2013 NIMO Problems, 5
For every integer $n \ge 1$, the function $f_n : \left\{ 0, 1, \cdots, n \right\} \to \mathbb R$ is defined recursively by $f_n(0) = 0$, $f_n(1) = 1$ and \[ (n-k) f_n(k-1) + kf_n(k+1) = nf_n(k) \] for each $1 \le k < n$. Let $S_N = f_{N+1}(1) + f_{N+2}(2) + \cdots + f_{2N} (N)$. Find the remainder when $\left\lfloor S_{2013} \right\rfloor$ is divided by $2011$. (Here $\left\lfloor x \right\rfloor$ is the greatest integer not exceeding $x$.)
[i]Proposed by Lewis Chen[/i]
2008 AIME Problems, 11
Consider sequences that consist entirely of $ A$'s and $ B$'s and that have the property that every run of consecutive $ A$'s has even length, and every run of consecutive $ B$'s has odd length. Examples of such sequences are $ AA$, $ B$, and $ AABAA$, while $ BBAB$ is not such a sequence. How many such sequences have length 14?
1980 AMC 12/AHSME, 25
In the non-decreasing sequence of odd integers $\{a_1,a_2,a_3,\ldots \}=\{1,3,3,3,5,5,5,5,5,\ldots \}$ each odd positive integer $k$ appears $k$ times. It is a fact that there are integers $b$, $c$, and $d$ such that for all positive integers $n$,
\[ a_n=b\lfloor \sqrt{n+c} \rfloor +d, \]
where $\lfloor x \rfloor$ denotes the largest integer not exceeding $x$. The sum $b+c+d$ equals
$\text{(A)} \ 0 \qquad \text{(B)} \ 1 \qquad \text{(C)} \ 2 \qquad \text{(D)} \ 3 \qquad \text{(E)} \ 4$
2008 Bosnia And Herzegovina - Regional Olympiad, 4
$ n$ points (no three being collinear) are given in a plane. Some points are connected and they form $ k$ segments. If no three of these segments form triangle ( equiv. there are no three points, such that each two of them are connected) prove that $ k \leq \left \lfloor \frac {n^{2}}{4}\right\rfloor$
2018 Malaysia National Olympiad, A5
Find the positive integer $n$ that satisfi es the equation $$n^2 - \lfloor \sqrt{n} \rfloor = 2018$$
2012 Pan African, 3
Find all real solutions $x$ to the equation $\lfloor x^2 - 2x \rfloor + 2\lfloor x \rfloor = \lfloor x \rfloor^2$.
2014 Iran MO (2nd Round), 3
Members of "Professionous Riddlous" society have been divided into some groups, and groups are changed in a special way each weekend: In each group, one of the members is specified as the best member, and the best members of all groups separate from their previous group and form a new group. If a group has only one member, that member joins the new group and the previous group will be removed. Suppose that the society has $n$ members at first, and all the members are in one group. Prove that a week will come, after which number of members of each group will be at most $1+\sqrt{2n}$.
2014 Junior Balkan Team Selection Tests - Romania, 4
Let $n \ge 6$ be an integer. We have at our disposal $n$ colors. We color each of the unit squares of an $n \times n$ board with one of the $n$ colors.
a) Prove that, for any such coloring, there exists a path of a chess knight from the bottom-left to the upper-right corner, that does not use all the colors.
b) Prove that, if we reduce the number of colors to $\lfloor 2n/3 \rfloor + 2$, then the statement from a) is true for infinitely many values of $n$ and it is false also for infinitely many values of $n$
2022 Brazil Team Selection Test, 2
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?
2000 Brazil National Olympiad, 2
Let $s(n)$ be the sum of all positive divisors of $n$, so $s(6) = 12$. We say $n$ is almost perfect if $s(n) = 2n - 1$. Let $\mod(n, k)$ denote the residue of $n$ modulo $k$ (in other words, the remainder of dividing $n$ by $k$). Put $t(n) = \mod(n, 1) + \mod(n, 2) + \cdots + \mod(n, n)$.
Show that $n$ is almost perfect if and only if $t(n) = t(n-1)$.
2014 Contests, 2
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$).
2010 Spain Mathematical Olympiad, 2
Let $\mathbb{N}_0$ and $\mathbb{Z}$ be the set of all non-negative integers and the set of all integers, respectively. Let $f:\mathbb{N}_0\rightarrow\mathbb{Z}$ be a function defined as
\[f(n)=-f\left(\left\lfloor\frac{n}{3}\right\rfloor \right)-3\left\{\frac{n}{3}\right\} \]
where $\lfloor x \rfloor$ is the greatest integer smaller than or equal to $x$ and $\{ x\}=x-\lfloor x \rfloor$. Find the smallest integer $n$ such that $f(n)=2010$.
2020 Regional Olympiad of Mexico Northeast, 1
Let $a_1=2020$ and let $a_{n+1}=\sqrt{2020+a_n}$ for $n\ge 1$. How much is $\left\lfloor a_{2020}\right\rfloor$?
Note: $\lfloor x\rfloor$ denotes the integer part of a number, that is that is, the immediate integer less than $x$. For example, $\lfloor 2.71\rfloor=2$ and $\lfloor \pi\rfloor=3$.