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?

On a blackboard a positive integer $n_0$ is written. Two players, $A$ and $B$ are playing a game, which respects the following rules: $-$ acting alternatively per turn, each player deletes the number written on the blackboard $n_k$ and writes instead one number denoted with $n_{k+1}$ from the set $\left\{n_k-1, \dsp \left\lfloor\frac {n_k}3\right\rfloor\right\}$; $-$ player $A$ starts first deleting $n_0$ and replacing it with $n_1\in\left\{n_0-1, \dsp \left\lfloor\frac {n_0}3\right\rfloor\right\}$; $-$ the game ends when the number on the table is 0 - and the player who wrote it is the winner. Find which player has a winning strategy in each of the following cases: a) $n_0=120$; b) $n_0=\dsp \frac {3^{2002}-1}2$; c) $n_0=\dsp \frac{3^{2002}+1}2$.

$f(x) = [x] + [2x] + [3x] + [4x] + [5x] + [6x]$. What values does $f$ take?

Prove that for any positive integer $n$, \[\left\lfloor \frac{n}{3}\right\rfloor+\left\lfloor \frac{n+2}{6}\right\rfloor+\left\lfloor \frac{n+4}{6}\right\rfloor = \left\lfloor \frac{n}{2}\right\rfloor+\left\lfloor \frac{n+3}{6}\right\rfloor .\]

Solve in the real numbers the equation $ \arcsin x=\lfloor 2x \rfloor . $ [i]Petre Guțescu[/i]

Find the set of all possible values of the expression $\lfloor m^2+\sqrt{2} n \rfloor$, where $m$ and $n$ are positive integers. Note: The symbol $\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$.

Solve the equation $x\cdot [x\cdot [x \cdot [x]]] = 88$ in the set of real numbers.

Denote by $\{x\}$ the fractional part of a real number $x$, that is $\{x\} = x - \rfloor x \lfloor $ where $\rfloor x \lfloor $ is the maximum integer not greater than$ x$ . Prove that a) For every integer $n$, we have $\{n\sqrt{17}\}> \frac{1}{2\sqrt{17} n}$ b) The value $\frac{1}{2\sqrt{17} }$ is the largest constant $c$ such that the inequality $\{n\sqrt{17}\}> c n $ holds for all positive integers $n$

Let $m$ and $n$ be odd positive integers. Each square of an $m$ by $n$ board is coloured red or blue. A row is said to be red-dominated if there are more red squares than blue squares in the row. A column is said to be blue-dominated if there are more blue squares than red squares in the column. Determine the maximum possible value of the number of red-dominated rows plus the number of blue-dominated columns. Express your answer in terms of $m$ and $n$.

We define a sequence ${a_n}$: $$a_1=1,a_{n+1}=\sqrt{a_n+n^2},n=1,2,...$$ (1)Find $\lfloor a_{2019}\rfloor$ (2)Find $\lfloor a_{1}^2\rfloor+\lfloor a_{2}^2\rfloor+...+\lfloor a_{20}^2\rfloor$

For $a,b,c$ positive reals, let \[N=\dfrac{a^2+b^2}{c^2+ab}+\dfrac{b^2+c^2}{a^2+bc}+\dfrac{c^2+a^2}{b^2+ca}.\] Find the minimum value of $\lfloor 2008N\rfloor$.

Let $a_0,b_0$ be positive integers, and define $a_{i+1}=a_i+\lfloor\sqrt{b_i}\rfloor$ and $b_{i+1}=b_i+\lfloor\sqrt{a_i}\rfloor$ for all $i\ge0$. Show that there exists a positive integer $n$ such that $a_n=b_n$. [i]David Yang.[/i]

Let $ f(x) \equal{} \log_{10} (\sin (\pi x)\cdot\sin (2\pi x)\cdot\sin (3\pi x) \cdots \sin (8\pi x))$. The intersection of the domain of $ f(x)$ with the interval $ [0,1]$ is a union of $ n$ disjoint open intervals. What is $ n$? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 18 \qquad \textbf{(D)}\ 22 \qquad \textbf{(E)}\ 36$

Find all real numbers $ x$ such that $ \lfloor x^3 \rfloor \equal{} 4x \plus{} 3$.

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 ]\]

Consider rows of the form: $[x], [2x], [3x], ...$ Proof that, if $N \in N$ does not occur in the sequence $([n x])$, then there is an $n \in N$ with $n - 1 < \frac{N}{x}< n -\frac{1}{x}$ Prove that, for $x, y \notin Q$: $\frac{1}{x}+\frac{1}{y} = 1$, then each $N \in N$ term is either of $([nx])$ or of $([ny])$.

Let $p$ be a prime number and let $s$ be an integer with $0 < s < p.$ Prove that there exist integers $m$ and $n$ with $0 < m < n < p$ and \[ \left \{\frac{sm}{p} \right\} < \left \{\frac{sn}{p} \right \} < \frac{s}{p} \] if and only if $s$ is not a divisor of $p-1$. Note: For $x$ a real number, let $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$, and let $\{x\} = x - \lfloor x \rfloor$ denote the fractional part of x.

Solve in $R$ equation $[x] \cdot \{x\} = 2001 x$, where$ [ .]$ and $\{ .\}$ represent respectively the floor and the integer functions.

Given real numbers $ x_1 < x_2 < \ldots < x_n$ such that every real number occurs at most two times among the differences $ x_j \minus{} x_i$, $ 1\leq i < j \leq n$, prove that there exists at least $ \lfloor n/2\rfloor$ real numbers that occurs exactly one time among such differences.

In convex quadrilateral $ABCD$, $\angle A \cong \angle C$, $AB = CD = 180$, and $AD \neq BC$. The perimeter of $ABCD$ is 640. Find $\lfloor 1000 \cos A \rfloor$. (The notation $\lfloor x \rfloor$ means the greatest integer that is less than or equal to $x$.)

Prove that if $ n\geq 4$, $ n\in\mathbb Z$ and $ \left \lfloor \frac {2^n}{n} \right\rfloor$ is a power of 2, then $ n$ is also a power of 2.

Let $I = (0, 1]$ be the unit interval of the real line. For a given number $a \in (0, 1)$ we define a map $T : I \to I$ by the formula if \[ T (x, y) = \begin{cases} x + (1 - a),&\mbox{ if } 0< x \leq a,\\ \text{ } \\ x - a, & \mbox{ if } a < x \leq 1.\end{cases} \] Show that for every interval $J \subset I$ there exists an integer $n > 0$ such that $T^n(J) \cap J \neq \emptyset.$

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

Find the maximum possible number of edges of a simple graph with $8$ vertices and without any quadrilateral. (a simple graph is an undirected graph that has no loops (edges connected at both ends to the same vertex) and no more than one edge between any two different vertices.)

Show that for all positive integers $n$, \[\lfloor \sqrt{n}+\sqrt{n+1}\rfloor =\lfloor \sqrt{4n+1}\rfloor =\lfloor \sqrt{4n+2}\rfloor =\lfloor \sqrt{4n+3}\rfloor.\]