Found problems: 1187
Find all positive integers $m$ and $n$ such that the inequality:
\[ [ (m+n) \alpha ] + [ (m+n) \beta ] \geq [ m \alpha ] + [n \beta] + [ n(\alpha+\beta)] \]
is true for any real numbers $\alpha$ and $\beta$. Here $[x]$ denote the largest integer no larger than real number $x$.
Let $n$ be a positive integer. Let $a$ be an integer such that $\gcd (a,n)=1$. Prove that
\[\frac{a^{\phi (n)}-1}{n}=\sum_{i\in R}\frac{1}{ai}\left[\frac{ai}{n}\right]\pmod{n}\]
where $R$ is the reduced residue system of $n$ with each element a positive integer at most $n$.
Nine mathematicians meet at an international conference and discover that among any three of them, at least two speak a common language. If each of the mathematicians speak at most three languages, prove that there are at least three of the mathematicians who can speak the same language.
Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.)
[i]Proposed by Hong Kong[/i]
Let $\lambda$ the positive root of the equation $t^2-1998t-1=0$. It is defined the sequence $x_0,x_1,x_2,\ldots,x_n,\ldots$ by $x_0=1,\ x_{n+1}=\lfloor\lambda{x_n}\rfloor\mbox{ for }n=1,2\ldots$ Find the remainder of the division of $x_{1998}$ by $1998$.
Note: $\lfloor{x}\rfloor$ is the greatest integer less than or equal to $x$.
Prove that the sum:
\[ S_n=\binom{n}{1}+\binom{n}{3}\cdot 2005+\binom{n}{5}\cdot 2005^2+...=\sum_{k=0}^{\left\lfloor\frac{n-1}{2}\right\rfloor}\binom{n}{2k+1}\cdot 2005^k \]
is divisible by $2^{n-1}$ for any positive integer $n$.
Let $f(0, 0) = 5^{2003}, f(0, n) = 0$ for every integer $n \neq 0$ and
\[\begin{array}{c}\ f(m, n) = f(m-1, n) - 2 \cdot \Bigg\lfloor \frac{f(m-1, n)}{2}\Bigg\rfloor + \Bigg\lfloor\frac{f(m-1, n-1)}{2}\Bigg\rfloor + \Bigg\lfloor\frac{f(m-1, n+1)}{2}\Bigg\rfloor \end{array}\]
for every natural number $m > 0$ and for every integer $n$.
Prove that there exists a positive integer $M$ such that $f(M, n) = 1$ for all integers $n$ such that $|n| \leq \frac{(5^{2003}-1)}{2}$ and $f(M, n) = 0$ for all integers n such that $|n| > \frac{5^{2003}-1}{2}.$
Find all positive integers $m$ and $n$ such that the inequality:
\[ [ (m+n) \alpha ] + [ (m+n) \beta ] \geq [ m \alpha ] + [n \beta] + [ n(\alpha+\beta)] \]
is true for any real numbers $\alpha$ and $\beta$. Here $[x]$ denote the largest integer no larger than real number $x$.
A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula
\[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0;
\]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large.
[i]Proposed by Harmel Nestra, Estionia[/i]
Let $R$ be the set of points $(x, y)$ such that $\lfloor x^2 \rfloor = \lfloor y \rfloor$ and $\lfloor y^2 \rfloor = \lfloor x \rfloor$. Compute the area of region $R$. Recall that $\lfloor z \rfloor$ is the greatest integer that is less than or equal to $z$.
Given $ n$ points in a line so that any distance occurs at most twice, show that the number of distance occurring exactly once is at least $ \lfloor n/2 \rfloor$.
[i]V. T. Sos, L. Szekely[/i]
A real number $a$ is given. The sequence $n_{1}< n_{2}< n_{3}< ...$ consists of all the positive integral $n$ such that $\{na\}< \frac{1}{10}$. Prove that there are at most three different numbers among the numbers $n_{2}-n_{1}$, $n_{3}-n_{2}$, $n_{4}-n_{3}$, $\ldots$.
[i]A corollary of a theorem from ergodic theory[/i]
An infinite sequence of natural number $\{x_n\}_{n\ge 1}$ is such that $x_{n+1}$ is obtained by adding one of the non-zero digits of $x_n$ to itself. Show this sequence contains an even number.
Let $d$ be a positive integer.
The seqeunce $a_1, a_2, a_3,...$ of positive integers is defined by $a_1 = 1$ and $a_{n + 1} = n\left \lfloor \frac{a_n}{n} \right \rfloor+ d$ for $n = 1,2,3, ...$ .
Prove that there exists a positive integer $N$ so that the terms $a_N,a_{N + 1}, a_{N + 2},...$ form an arithmetic progression.
Note: If $x$ is a real number, $\left \lfloor x \right \rfloor $ denotes the largest integer that is less than or equal to $x$.
Find the minimum real $x$ that satisfies
$$\lfloor x \rfloor <\lfloor x^2 \rfloor <\lfloor x^3 \rfloor < \cdots < \lfloor x^n \rfloor < \lfloor x^{n+1} \rfloor < \cdots$$
Find all possible pairs of real numbers $ (x, y) $ that satisfy the equalities $ y ^ 2- [x] ^ 2 = 2001 $ and $ x ^ 2 + [y] ^ 2 = 2001 $.
Let $r_1,r_2,\ldots,r_m$ be positive rational numbers with a sum of $1$. Find the maximum values of the function $f:\mathbb N\to\mathbb Z$ defined by
$$f(n)=n-\lfloor r_1n\rfloor-\lfloor r_2n\rfloor-\ldots-\lfloor r_mn\rfloor$$
Does there exist a pair $(g,h)$ of functions $g,h:\mathbb{R}\rightarrow\mathbb{R}$ such that the only function $f:\mathbb{R}\rightarrow\mathbb{R}$ satisfying $f(g(x))=g(f(x))$ and $f(h(x))=h(f(x))$ for all $x\in\mathbb{R}$ is identity function $f(x)\equiv x$?
Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.)
[i]Proposed by Hong Kong[/i]
An integer sequence $\{a_{n}\}_{n \ge 1}$ is defined by \[a_{1}=1, \; a_{n+1}=a_{n}+\lfloor \sqrt{a_{n}}\rfloor.\] Show that $a_{n}$ is a square if and only if $n=2^{k}+k-2$ for some $k \in \mathbb{N}$.
Let $\lfloor \bullet \rfloor$ denote the floor function. For nonnegative integers $a$ and $b$, their [i]bitwise xor[/i], denoted $a \oplus b$, is the unique nonnegative integer such that $$ \left \lfloor \frac{a}{2^k} \right \rfloor+ \left\lfloor\frac{b}{2^k} \right\rfloor - \left\lfloor \frac{a\oplus b}{2^k}\right\rfloor$$ is even for every $k \ge 0$. Find all positive integers $a$ such that for any integers $x>y\ge 0$, we have \[ x\oplus ax \neq y \oplus ay. \]
[i]Carl Schildkraut[/i]
Square $S$ is the unit square with vertices at $(0, 0)$, $(0, 1)$, $(1, 0)$ and $(1, 1)$. We choose a random point $(x, y)$ inside $S$ and construct a rectangle with length $x$ and width $y$. What is the average of $\lfloor p \rfloor$ where $p$ is the perimeter of the rectangle? $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.
Let $n$ be a positive integer. Find the number of sequences $a_0,a_1,a_2,\dots,a_{2n}$ of integers in the range $[0,n]$ such that for all integers $0\leq k\leq n$ and all nonnegative integers $m$, there exists an integer $k\leq i\leq 2k$ such that $\lfloor k/2^m\rfloor=a_i.$
[i]Andrew Carratu[/i]
A doubly-indexed sequence $a_{m,n}$, for $m$ and $n$ nonnegative integers, is defined as follows:
[list]
[*]$a_{m,0}=0$ for all $m>0$ and $a_{0,0}=1$.
[*]$a_{m,1}=0$ for all $m>1$, $a_{1,1}=1$, and $a_{0,1}=0$.
[*]$a_{0,n}=a_{0,n-1}+a_{0,n-2}$ for all $n\geq 2$.
[*]$a_{m,n}=a_{m,n-1}+a_{m,n-2}+a_{m-1,n-1}-a_{m-1,n-2}$ for all $m>0$, $n\geq 2$.
[/list]
Then there exists a unique value of $x$ so $\sum_{m=0}^{\infty}\sum_{n=0}^{\infty}\frac{a_{m,n}x^m}{3^{n-m}}=1$. Find $\lfloor 1000x^2 \rfloor$.
Find the number of positive integers $n$ such that $1\leq n\leq 1000$ and $n$ is divisible by $\lfloor \sqrt[3]{n} \rfloor$.