Found problems: 26
Given a sequence $\{a_n\}$ of real numbers such that $|a_{k+m} - a_k - a_m| \leq 1$ for all positive integers $k$ and $m$, prove that, for all positive integers $p$ and $q$, \[|\frac{a_p}{p} - \frac{a_q}{q}| < \frac{1}{p} + \frac{1}{q}.\]
Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions:
\[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n;
\]
\[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n.
\]
[i]Author: Dusan Dukic, Serbia[/i]
Find all positive real solutions to: \begin{eqnarray*} (x_1^2-x_3x_5)(x_2^2-x_3x_5) &\le& 0 \\ (x_2^2-x_4x_1)(x_3^2-x_4x_1) &\le& 0 \\ (x_3^2-x_5x_2)(x_4^2-x_5x_2) &\le& 0 \\ (x_4^2-x_1x_3)(x_5^2-x_1x_3) &\le & 0 \\ (x_5^2-x_2x_4)(x_1^2-x_2x_4) &\le& 0 \\ \end{eqnarray*}
Find the maximum value of the expression $ x+y+z, $ where $ x,y,z $ are real numbers satisfying
$$ \left\{ \begin{matrix} x^2+yz\le 2 \\y^2+zx\le 2\\ z^2+xy\le 2 \end{matrix} \right. . $$
$(NET 3)$ Let $x_1, x_2, x_3, x_4,$ and $x_5$ be positive integers satisfying
\[x_1 +x_2 +x_3 +x_4 +x_5 = 1000,\]
\[x_1 -x_2 +x_3 -x_4 +x_5 > 0,\]
\[x_1 +x_2 -x_3 +x_4 -x_5 > 0,\]
\[-x_1 +x_2 +x_3 -x_4 +x_5 > 0,\]
\[x_1 -x_2 +x_3 +x_4 -x_5 > 0,\]
\[-x_1 +x_2 -x_3 +x_4 +x_5 > 0\]
$(a)$ Find the maximum of $(x_1 + x_3)^{x_2+x_4}$
$(b)$ In how many different ways can we choose $x_1, . . . , x_5$ to obtain the desired maximum?
Let $a_1, a_2, \ldots , a_n, \ldots $ be a sequence of real numbers such that $0 \leq a_n \leq 1$ and $a_n - 2a_{n+1} + a_{n+2} \geq 0$ for $n = 1, 2, 3, \ldots$. Prove that
\[0 \leq (n + 1)(a_n - a_{n+1}) \leq 2 \qquad \text{ for } n = 1, 2, 3, \ldots\]
Given five real numbers $u_0, u_1, u_2, u_3, u_4$, prove that it is always possible to find five real numbers $v0, v_1, v_2, v_3, v_4$ that satisfy the following conditions:
$(i)$ $u_i-v_i \in \mathbb N, \quad 0 \leq i \leq 4$
$(ii)$ $\sum_{0 \leq i<j \leq 4} (v_i - v_j)^2 < 4.$
[i]Proposed by Netherlands.[/i]
Find all positive real solutions to: \begin{eqnarray*} (x_1^2-x_3x_5)(x_2^2-x_3x_5) &\le& 0 \\ (x_2^2-x_4x_1)(x_3^2-x_4x_1) &\le& 0 \\ (x_3^2-x_5x_2)(x_4^2-x_5x_2) &\le& 0 \\ (x_4^2-x_1x_3)(x_5^2-x_1x_3) &\le & 0 \\ (x_5^2-x_2x_4)(x_1^2-x_2x_4) &\le& 0 \\ \end{eqnarray*}
Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions:
\[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n;
\]
\[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n.
\]
[i]Author: Dusan Dukic, Serbia[/i]
The sequence $ \{a_n\}$ of integers is defined by
\[ a_1 \equal{} 2, a_2 \equal{} 7
\]
and
\[ \minus{} \frac {1}{2} < a_{n \plus{} 1} \minus{} \frac {a^2_n}{a_{n \minus{} 1}} \leq \frac {}{}, n \geq 2.
\]
Prove that $ a_n$ is odd for all $ n > 1.$
Let $n$ be a positive integer. How many integer solutions $(i, j, k, l) , \ 1 \leq i, j, k, l \leq n$, does the following system of inequalities have:
\[1 \leq -j + k + l \leq n\]\[1 \leq i - k + l \leq n\]\[1 \leq i - j + l \leq n\]\[1 \leq i + j - k \leq n \ ?\]
The sequence $ \{a_n\}$ of integers is defined by
\[ a_1 \equal{} 2, a_2 \equal{} 7
\]
and
\[ \minus{} \frac {1}{2} < a_{n \plus{} 1} \minus{} \frac {a^2_n}{a_{n \minus{} 1}} \leq \frac {}{}, n \geq 2.
\]
Prove that $ a_n$ is odd for all $ n > 1.$
Given a sequence $\{a_n\}$ of real numbers such that $|a_{k+m} - a_k - a_m| \leq 1$ for all positive integers $k$ and $m$, prove that, for all positive integers $p$ and $q$, \[|\frac{a_p}{p} - \frac{a_q}{q}| < \frac{1}{p} + \frac{1}{q}.\]
$(NET 3)$ Let $x_1, x_2, x_3, x_4,$ and $x_5$ be positive integers satisfying
\[x_1 +x_2 +x_3 +x_4 +x_5 = 1000,\]
\[x_1 -x_2 +x_3 -x_4 +x_5 > 0,\]
\[x_1 +x_2 -x_3 +x_4 -x_5 > 0,\]
\[-x_1 +x_2 +x_3 -x_4 +x_5 > 0,\]
\[x_1 -x_2 +x_3 +x_4 -x_5 > 0,\]
\[-x_1 +x_2 -x_3 +x_4 +x_5 > 0\]
$(a)$ Find the maximum of $(x_1 + x_3)^{x_2+x_4}$
$(b)$ In how many different ways can we choose $x_1, . . . , x_5$ to obtain the desired maximum?
Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$. [i](IMO Problem 3)[/i]
[i]Proposed by Germany, FR[/i]
Let $ \{a_k\}^{\infty}_1$ be a sequence of non-negative real numbers such that:
\[ a_k \minus{} 2 a_{k \plus{} 1} \plus{} a_{k \plus{} 2} \geq 0
\]
and $ \sum^k_{j \equal{} 1} a_j \leq 1$ for all $ k \equal{} 1,2, \ldots$. Prove that:
\[ 0 \leq a_{k} \minus{} a_{k \plus{} 1} < \frac {2}{k^2}
\]
for all $ k \equal{} 1,2, \ldots$.
Let $ \{a_k\}^{\infty}_1$ be a sequence of non-negative real numbers such that:
\[ a_k \minus{} 2 a_{k \plus{} 1} \plus{} a_{k \plus{} 2} \geq 0
\]
and $ \sum^k_{j \equal{} 1} a_j \leq 1$ for all $ k \equal{} 1,2, \ldots$. Prove that:
\[ 0 \leq a_{k} \minus{} a_{k \plus{} 1} < \frac {2}{k^2}
\]
for all $ k \equal{} 1,2, \ldots$.
Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions:
\[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n;
\]
\[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n.
\]
[i]Author: Dusan Dukic, Serbia[/i]
Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$. [i](IMO Problem 3)[/i]
[i]Proposed by Germany, FR[/i]
Suppose that $ n \geq 2$ and $ x_1, x_2, \ldots, x_n$ are real numbers between 0 and 1 (inclusive). Prove that for some index $ i$ between $ 1$ and $ n \minus{} 1$ the
inequality
\[ x_i (1 \minus{} x_{i\plus{}1}) \geq \frac{1}{4} x_1 (1 \minus{} x_{n})\]
Given five real numbers $u_0, u_1, u_2, u_3, u_4$, prove that it is always possible to find five real numbers $v0, v_1, v_2, v_3, v_4$ that satisfy the following conditions:
$(i)$ $u_i-v_i \in \mathbb N, \quad 0 \leq i \leq 4$
$(ii)$ $\sum_{0 \leq i<j \leq 4} (v_i - v_j)^2 < 4.$
[i]Proposed by Netherlands.[/i]
Find all positive real solutions to: \begin{eqnarray*} (x_1^2-x_3x_5)(x_2^2-x_3x_5) &\le& 0 \\ (x_2^2-x_4x_1)(x_3^2-x_4x_1) &\le& 0 \\ (x_3^2-x_5x_2)(x_4^2-x_5x_2) &\le& 0 \\ (x_4^2-x_1x_3)(x_5^2-x_1x_3) &\le & 0 \\ (x_5^2-x_2x_4)(x_1^2-x_2x_4) &\le& 0 \\ \end{eqnarray*}
Suppose that ${x_1, x_2, \dots , x_n}$ are positive integers for which $x_1 + x_2 + \cdots+ x_n = 2(n + 1)$. Show that there exists an integer $r$ with $0 \leq r \leq n - 1$ for which the following $n - 1$ inequalities hold:
\[x_{r+1} + \cdots + x_{r+i} \leq 2i+ 1, \qquad \qquad \forall i, 1 \leq i \leq n - r; \]
\[x_{r+1} + \cdots + x_n + x_1 + \cdots+ x_i \leq 2(n - r + i) + 1, \qquad \qquad \forall i, 1 \leq i \leq r - 1.\]
Prove that if all the inequalities are strict, then $r$ is unique and that otherwise there are exactly two such $r.$
Suppose that ${x_1, x_2, \dots , x_n}$ are positive integers for which $x_1 + x_2 + \cdots+ x_n = 2(n + 1)$. Show that there exists an integer $r$ with $0 \leq r \leq n - 1$ for which the following $n - 1$ inequalities hold:
\[x_{r+1} + \cdots + x_{r+i} \leq 2i+ 1, \qquad \qquad \forall i, 1 \leq i \leq n - r; \]
\[x_{r+1} + \cdots + x_n + x_1 + \cdots+ x_i \leq 2(n - r + i) + 1, \qquad \qquad \forall i, 1 \leq i \leq r - 1.\]
Prove that if all the inequalities are strict, then $r$ is unique and that otherwise there are exactly two such $r.$
Let $n$ be a positive integer. How many integer solutions $(i, j, k, l) , \ 1 \leq i, j, k, l \leq n$, does the following system of inequalities have:
\[1 \leq -j + k + l \leq n\]\[1 \leq i - k + l \leq n\]\[1 \leq i - j + l \leq n\]\[1 \leq i + j - k \leq n \ ?\]