How to prove the inequality involving a sum of a sequence divided by $\sqrt{n}$ I'm trying to prove # 19 on page 41 of Bartle and Sherbert's Real Anaylsis.  Here is the problem:
$\forall k$ let $c_k>0$, show:
$$
\frac{c_1+c_2+...+c_n}{\sqrt{n}}\leq (c_1^2+c_2^2+...+c_n^2)^\frac{1}{2}
$$
I'm having trouble showing this with induction, and I am hopeful that someone might give a hint to point me in a good direction.  Thanks!

We can change this problem to be: $$(c_1 + c_2 + \cdots + c_n)^2 \le n (c_1^2 + c_2^2 + \cdots + c_n^2)$$
Then we can establish a quick lemma: $$x^2 + y^2 \ge xy + yx.$$
This is established by noticing: $(x-y)^2 \ge 0$ and so $x^2 + y^2 \ge 2xy = xy + yx$.
Now if we consider the case when $n=2$ we see that
$$(c_1 + c_2)^2 = c_1^2 + c_1 c_2 + c_2 c_1 + c_2^2 \le c_1^2 + c_1^2 + c_2^2 + c_2^2 = 2(c_1^2 + c_2^2).$$
The same reasoning can be carried out for arbitrary $n$.
