Found problems: 1782
Let $n$ be a positive integer. Prove that
\[ \binom{n}{0}^{-1} + \binom{n}{1}^{-1} + \cdots + \binom{n}{n}^{-1} = \frac{n+1}{2^{n+1}} \left( \frac{2}{1} + \frac{2^2}{2} + \cdots + \frac{2^{n+1}}{n+1} \right). \]
Let $ 0 < x_{1}\leq\frac {x_{2}}{2}\leq\cdots\leq\frac {x_{n}}{n}, 0 < y_{n}\leq y_{n \minus{} 1}\leq\cdots\leq y_{1},$ Prove that $ (\sum_{k \equal{} 1}^{n}x_{k}y_{k})^2\leq(\sum_{k \equal{} 1}^{n}y_{k})(\sum_{k \equal{} 1}^{n}(x_{k}^2 \minus{} \frac {1}{4}x_{k}x_{k \minus{} 1})y_{k}).$ where $ x_{0} \equal{} 0.$
Find, with proof, the smallest real number $C$ with the following property:
For every infinite sequence $\{x_i\}$ of positive real numbers such that $x_1 + x_2 +\cdots + x_n \leq x_{n+1}$ for $n = 1, 2, 3, \cdots$, we have
\[\sqrt{x_1}+\sqrt{x_2}+\cdots+\sqrt{x_n} \leq C \sqrt{x_1+x_2+\cdots+x_n} \qquad \forall n \in \mathbb N.\]
Let $n$ be an integer greater than 1. Suppose $2n$ points are given in the plane, no three of which are collinear. Suppose $n$ of the given $2n$ points are colored blue and the other $n$ colored red. A line in the plane is called a [i]balancing line[/i] if it passes through one blue and one red point and, for each side of the line, the number of blue points on that side is equal to the number of red points on the same side.
Prove that there exist at least two balancing lines.
$200n$ diagonals are drawn in a convex $n$-gon. Prove that one of them intersects at least 10000 others.
[b]proposed by D. Karpov, S. Berlov[/b]
On a planet there are $3\times2005!$ aliens and $2005$ languages. Each pair of aliens communicates with each other in exactly one language. Show that there are $3$ aliens who communicate with each other in one common language.
Given are $10$ distinct real numbers. Kyle wrote down the square of the difference for each pair of those numbers in his notebook, while Peter wrote in his notebook the absolute value of the differences of the squares of these numbers. Is it possible for the two boys to have the same set of $45$ numbers in their notebooks?
Denote by $S(k)$ the sum of the digits in the decimal representation of $k$. Prove that there are infinitely many $n\in \mathbb{Z_{+}}$ such that: ${S(2^{n}+n})<S(2^{n})$.
There is a broken computer such that only three primitive data $c$, $1$ and $-1$ are reserved. Only allowed operation may take $u$ and $v$ and output $u \cdot v + v.$ At the beginning, $u,v \in \{c, 1, -1\}.$ After then, it can also take the value of the previous step (only one step back) besides $\{c, 1, -1\}$. Prove that for any polynomial $P_{n}(x) = a_0 \cdot x^n + a_1 \cdot x^{n-1} + \ldots + a_n$ with integer coefficients, the value of $P_n(c)$ can be computed using this computer after only finite operation.
Let $n$ be a positive integer. Let $P_n=\{2^n,2^{n-1}\cdot 3, 2^{n-2}\cdot 3^2, \dots, 3^n \}.$ For each subset $X$ of $P_n$, we write $S_X$ for the sum of all elements of $X$, with the convention that $S_{\emptyset}=0$ where $\emptyset$ is the empty set. Suppose that $y$ is a real number with $0 \leq y \leq 3^{n+1}-2^{n+1}.$
Prove that there is a subset $Y$ of $P_n$ such that $0 \leq y-S_Y < 2^n$
Two people play a game as follows: At the beginning both of them have one point and in every move, one of them can double it's points, or when the other have more point than him, subtract to him his points. Can the two competitors have 2009 and 2002 points respectively? What about 2009 and 2003? Generally which couples of points can they have?
Consider the following sequence : $a_1=1 ; a_n=\frac{a_[{\frac{n}{2}]}}{2}+\frac{a_[{\frac{n}{3}]}}{3}+\ldots+\frac{a_[{\frac{n}{n}]}}{n}$. Prove that $ a_{2n}< 2*a_{n } (\forall n\in\mathbb{N})$
Show that for any finite set $S$ of distinct positive integers, we can find a set $T \supseteq S$ such that every member of $T$ divides the sum of all the members of $T$.
[b]Original Statement:[/b]
A finite set of (distinct) positive integers is called a [b]DS-set[/b] if each of the integers divides the sum of them all. Prove that every finite set of positive integers is a subset of some [b]DS-set[/b].
Let $(a_n)_{n\ge 1}$ be a sequence of real numbers such that
\[a_1\binom{n}{1}+a_2\binom{n}{2}+\ldots+a_n\binom{n}{n}=2^{n-1}a_n,\ (\forall)n\in \mathbb{N}^*\]
Prove that $(a_n)_{n\ge 1}$ is an arithmetical progression.
[i]Lucian Dragomir[/i]
There is a broken computer such that only three primitive data $c$, $1$ and $-1$ are reserved. Only allowed operation may take $u$ and $v$ and output $u \cdot v + v.$ At the beginning, $u,v \in \{c, 1, -1\}.$ After then, it can also take the value of the previous step (only one step back) besides $\{c, 1, -1\}$. Prove that for any polynomial $P_{n}(x) = a_0 \cdot x^n + a_1 \cdot x^{n-1} + \ldots + a_n$ with integer coefficients, the value of $P_n(c)$ can be computed using this computer after only finite operation.
Let $P$ be a polynomial with real coefficients. Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that there exists a real number $t$ such that
\[f(x+t) - f(x) = P(x)\]
for all $x \in \mathbb{R}$.
Let $a_1\ge a_2\ge \ldots \ge a_n>0$ be $n$ reals. Prove the inequality
\[a_1a_2\ldots a_{n-1}+(2a_2-a_1)(2a_3-a_2)\ldots (2a_n-a_{n-1})\ge 2a_2a_3\ldots a_n\]
Given the expression
\[P_n(x) =\frac{1}{2^n}\left[(x +\sqrt{x^2 - 1})^n+(x-\sqrt{x^2 - 1})^n\right],\]
prove:
$(a) P_n(x)$ satisfies the identity
\[P_n(x) - xP_{n-1}(x) + \frac{1}{4}P_{n-2}(x) \equiv 0.\]
$(b) P_n(x)$ is a polynomial in $x$ of degree $n.$
Let $P$ be a polynomial of degree $n$ with only real zeros and real coefficients.
Prove that for every real $x$ we have $(n-1)(P'(x))^2\ge nP(x)P''(x)$. When does equality occur?
All sides and diagonals of a convex $n$-gon, $n\ge 3$, are coloured one of two colours. Show that there exist $\left[\frac{n+1}{3}\right]$ pairwise disjoint monochromatic segments.
[i](Two segments are disjoint if they do not share an endpoint or an interior point).[/i]
Let $\star$ be an operation defined in the set of nonnegative integers with the following properties: for any nonnegative integers $x$ and $y$,
(i) $(x + 1)\star 0 = (0\star x) + 1$
(ii) $0\star (y + 1) = (y\star 0) + 1$
(iii) $(x + 1)\star (y + 1) = (x\star y) + 1$.
If $123\star 456 = 789$, find $246\star 135$.
Let $\, p \,$ be an odd prime. The sequence $(a_n)_{n \geq 0}$ is defined as follows: $\, a_0 = 0,$ $a_1 = 1, \, \ldots, \, a_{p-2} = p-2 \,$ and, for all $\, n \geq p-1, \,$ $\, a_n \,$ is the least positive integer that does not form an arithmetic sequence of length $\, p \,$ with any of the preceding terms. Prove that, for all $\, n, \,$ $\, a_n \,$ is the number obtained by writing $\, n \,$ in base $\, p-1 \,$ and reading the result in base $\, p$.
Prove the identity
\[ (z+a)^n=z^n+a\sum_{k=1}^n\binom{n}{k}(a-kb)^{k-1}(z+kb)^{n-k}\]
(Leo Moser) Show that the Diophantine equation \[\frac{1}{x_{1}}+\frac{1}{x_{2}}+\cdots+\frac{1}{x_{n}}+\frac{1}{x_{1}x_{2}\cdots x_{n}}= 1\] has at least one solution for every positive integers $n$.
Let $ f(x) \equal{} c_m x^m \plus{} c_{m\minus{}1} x^{m\minus{}1} \plus{}...\plus{} c_1 x \plus{} c_0$, where each $ c_i$ is a non-zero integer. Define a sequence $ \{ a_n \}$ by $ a_1 \equal{} 0$ and $ a_{n\plus{}1} \equal{} f(a_n)$ for all positive integers $ n$.
(a) Let $ i$ and $ j$ be positive integers with $ i<j$. Show that $ a_{j\plus{}1} \minus{} a_j$ is a multiple of $ a_{i\plus{}1} \minus{} a_i$.
(b) Show that $ a_{2008} \neq 0$