Prove: From the set $\{1,2,...,n\}$, one can choose a subset with at most $2 \left\lfloor \sqrt n \right\rfloor +1$ elements such that the set of the pairwise differences from this subset is $\{1,2,...,n-1\}$. ($\left\lfloor x \right\rfloor$ means the greatest integer $\leq x$)

Let $n$ be a fixed positive integer and let $b(n)$ be the minimum value of $$k+\frac{n}{k},$$ where $k$ is allowed to range through all positive integers. Prove that $\lfloor b(n) \rfloor= \lfloor \sqrt{4n+1} \rfloor.$

The number of solutions in positive integers of $2x+3y=763$ is: $\textbf{(A)}\ 255 \qquad \textbf{(B)}\ 254\qquad \textbf{(C)}\ 128 \qquad \textbf{(D)}\ 127 \qquad \textbf{(E)}\ 0$

Suppose $x$ is a random real number between $1$ and $4$, and $y$ is a random real number between $1$ and $9$. If the expected value of \[ \left\lceil \log_2 x \right\rceil - \left\lfloor \log_3 y \right\rfloor \] can be expressed as $\frac mn$ where $m$ and $n$ are relatively prime positive integers, compute $100m + n$. [i]Proposed by Lewis Chen[/i]

Find all real numbers $\alpha$ for which the equality \[\lfloor \sqrt{n}+\sqrt{n+\alpha}\rfloor =\lfloor \sqrt{4n+1}\rfloor\] holds for all positive integers $n$.

Let $n \geq 2023$ be an integer. For each real $x$, we say that $\lfloor x \rceil$ is the closest integer to $x$, and if there are two closest integers then it is the greater of the two. Suppose there is a positive real $a$ such that $$\lfloor an \rceil = n + \bigg\lfloor\frac{n}{a} \bigg\rceil.$$ Show that $|a^2 - a - 1| < \frac{n\varphi+1}{n^2}$.

Prove that: $ \sum_{i\equal{}1}^{n^2} \lfloor \frac{i}{3} \rfloor\equal{} \frac{n^2(n^2\minus{}1)}{6}$ For all $ n \in N$.

Let $a$ and $n$ be two positive integer numbers such that the (positive) prime factors of $a$ be all greater than $n$. Prove that $n!$ divides $(a - 1)(a^2 - 1)\cdots (a^{n-1} - 1)$. [i]AMM Magazine[/i]

Find all pairs $(a, b)$ of real numbers such that $a \cdot \lfloor b \cdot n\rfloor = b \cdot \lfloor a \cdot n \rfloor$ applies to all positive integers$ n$. (For a real number $x, \lfloor x\rfloor$ denotes the largest integer that is less than or equal to $x$.)

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 $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$. Find the number of positive integers $m$ between $1$ and $2022$ inclusive such that \[ \left\lfloor \frac{3^m}{11} \right\rfloor \] is even.

Let $p > 1$ be relatively prime to $10$. Let $n$ be any positive number and$ d$ be the last digit of $n$. Define $f(n) = \lfloor \frac{n}{10} \rfloor + d \cdot m$. Then, we can call $m$ a [i]divisibility multiplier[/i] for $p$, if $f(n)$ is divisible by $p$ if and only if $n$ is divisible by $p$. Find a divisibility multiplier for $2013$.

Find all pairs $(a,b)$ of real numbers such that $\lfloor an + b \rfloor$ is a perfect square, for all positive integer $n$.

Suppose that $m>2$, and let $P$ be the product of the positive integers less than $m$ that are relatively prime to $m$. Show that $P \equiv -1 \pmod{m}$ if $m=4$, $p^n$, or $2p^{n}$, where $p$ is an odd prime, and $P \equiv 1 \pmod{m}$ otherwise.

(a) Prove that \[ [5x]\plus{}[5y] \ge [3x\plus{}y] \plus{} [3y\plus{}x],\] where $ x,y \ge 0$ and $ [u]$ denotes the greatest integer $ \le u$ (e.g., $ [\sqrt{2}]\equal{}1$). (b) Using (a) or otherwise, prove that \[ \frac{(5m)!(5n)!}{m!n!(3m\plus{}n)!(3n\plus{}m)!}\] is integral for all positive integral $ m$ and $ n$.

Determine all pairs $(a, b)$ of real numbers such that $a\lfloor bn\rfloor =b\lfloor an\rfloor$ for all positive integer $n$.

let $x,y,z$ be positive reals , such that $x+y+z=1399$ find the $$\max( [x]y + [y]z + [z]x ) $$ ( $[a]$ is the biggest integer not exceeding $a$)

Let $ \alpha$ be the positive root of the equation $ x^{2} \equal{} 1991x \plus{} 1$. For natural numbers $ m$ and $ n$ define \[ m*n \equal{} mn \plus{} \lfloor\alpha m \rfloor \lfloor \alpha n\rfloor. \] Prove that for all natural numbers $ p$, $ q$, and $ r$, \[ (p*q)*r \equal{} p*(q*r). \]

Let $n$ be a fixed positive integer. How many ways are there to write $n$ as a sum of positive integers, \[n = a_1 + a_2 + \cdots a_k\] with $k$ an arbitrary positive integer and $a_1 \le a_2 \le \cdots \le a_k \le a_1 + 1$? For example, with $n = 4$, there are four ways: $4$, $2 + 2$, $1 + 1 + 2$, $1 + 1 + 1 + 1$.

$n$ being a given integer, find all functions $f\colon \mathbb{Z} \to \mathbb{Z}$, such that for all integers $x,y$ we have $f\left( {x + y + f(y)} \right) = f(x) + ny$.

For a group $\left( G, \star \right)$ and $A, B$ two non-void subsets of $G$, we define $A \star B = \left\{ a \star b : a \in A \ \text{and}\ b \in B \right\}$. (a) Prove that if $n \in \mathbb N, \, n \geq 3$, then the group $\left( \mathbb Z \slash n \mathbb Z,+\right)$ can be writen as $\mathbb Z \slash n \mathbb Z = A+B$, where $A, B$ are two non-void subsets of $\mathbb Z \slash n \mathbb Z$ and $A \neq \mathbb Z \slash n \mathbb Z, \, B \neq \mathbb Z \slash n \mathbb Z, \, \left| A \cap B \right| = 1$. (b) If $\left( G, \star \right)$ is a finite group, $A, B$ are two subsets of $G$ and $a \in G \setminus \left( A \star B \right)$, then prove that function $f : A \to G \setminus B$ given by $f(x) = x^{-1}\star a$ is well-defined and injective. Deduce that if $|A|+|B| > |G|$, then $G = A \star B$. [hide="Question."]Does the last result have a name?[/hide]

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

Prove that there exists a positive real number $C$ with the following property: for any integer $n\ge 2$ and any subset $X$ of the set $\{1,2,\ldots,n\}$ such that $|X|\ge 2$, there exist $x,y,z,w \in X$(not necessarily distinct) such that \[0<|xy-zw|<C\alpha ^{-4}\] where $\alpha =\frac{|X|}{n}$.

Let $a, b$ be distinct real numbers and $k,m$ be positive integers $k + m = n \ge 3, k \le 2m, m \le 2k$. Consider sequences $x_1,\dots , x_n$ with the following properties: (i) $k$ terms $x_i$, including $x_1$, are equal to $a$; (ii) $m$ terms $x_i$, including $x_n$, are equal to $b$; (iii) no three consecutive terms are equal. Find all possible values of $x_nx_1x_2 + x_1x_2x_3 + \cdots + x_{n-1}x_nx_1$.

Prove that ${d((n^2 +1)}^2)$ does not become monotonic from any given point onwards.