MathDB
Problems
Contests
National and Regional Contests
Poland Contests
Polish MO Finals
2003 Polish MO Finals
2
2
Part of
2003 Polish MO Finals
Problems
(1)
Inequality with strictly increasing sequences - Poland 2003
Source:
11/1/2010
Let
0
<
a
<
1
0 < a < 1
0
<
a
<
1
be a real number. Prove that for all finite, strictly increasing sequences
k
1
,
k
2
,
…
,
k
n
k_1, k_2, \ldots , k_n
k
1
,
k
2
,
…
,
k
n
of non-negative integers we have the inequality
(
∑
i
=
1
n
a
k
i
)
2
<
1
+
a
1
−
a
∑
i
=
1
n
a
2
k
i
.
\biggl( \sum_{i=1}^n a^{k_i} \biggr)^2 < \frac{1+a}{1-a} \sum_{i=1}^n a^{2k_i}.
(
i
=
1
∑
n
a
k
i
)
2
<
1
−
a
1
+
a
i
=
1
∑
n
a
2
k
i
.
inequalities
induction
inequalities unsolved