Slični zadaci
For
and
given real numbers we have the following instructions:
- place out the numbers in some order in a ring;
- delete one of the numbers from the ring;
- if just two numbers are remaining in the ring: let
be the sum of these two numbers. Otherwise, if there are more the two numbers in the ring, replace
Afterwards start again with the step (2). Show that the largest sum
which can result in this way is given by the formula


- place out the numbers in some order in a ring;
- delete one of the numbers from the ring;
- if just two numbers are remaining in the ring: let

Afterwards start again with the step (2). Show that the largest sum

![S_{max}= \sum^n_{k=2} \begin{pmatrix} n -2 \\ [\frac{k}{2}] - 1\end{pmatrix}a_{k}.](/media/m/a/d/4/ad4e65bc42b08da06d18502a103d6a04.png)
Consider two monotonically decreasing sequences
and
, where
, and
and
are positive real numbers for every k. Now, define the sequences
;
;
;
for all natural numbers k.
(a) Do there exist two monotonically decreasing sequences
and
of positive real numbers such that the sequences
and
are not bounded, while the sequence
is bounded?
(b) Does the answer to problem (a) change if we stipulate that the sequence
must be
for all k ?









for all natural numbers k.
(a) Do there exist two monotonically decreasing sequences





(b) Does the answer to problem (a) change if we stipulate that the sequence

