There are plenty of ways to show it.
For simplicity let [itex]z_n = |x_n-y_n|[/itex] (no need to keep track of both x_j and y_j).
Method 1 (means):
The generalized mean inequality says that:
[tex]M_p(a_1,a_2,\ldots,a_n) = \left(\frac{a_1^p + a_2^p + \cdots + a_n^p}{n}\right)^{1/p}[/tex]
Is increasing as a function of p if a_1, ..., a_n are non-negative numbers. In particular:
[tex]M_1(z_j) =\frac{\sum_{j=1}^p z_j }{p} \leq \left(\frac{\sum_{j=1}^p z_j^2}{p}\right)^{1/2} = M_2(z_j)[/tex]
(this is often referred to as the AM-QM inequality since M_1 is called the Arithmetic Mean and M_2 is called the Quadratic Mean).
[EDIT: Note also that the AM-QM inequality is practically the same as yours so if you want more proofs just search for proofs of the AM-QM inequality]Method 2 (rearrangement and fiddling with indices):
Assume without loss of generality [itex]z_1 \leq z_2 \leq \cdots \leq z_p[/itex] (otherwise just rearrange the sequence). You wish to show:
[tex]\left(\sum_{j=1}^p z_j \right)^2 \leq p \left( \sum_{j=1}^p z_j^2 \right)[/tex]
We can extend the sequence z_n to all integer indices by letting [itex]z_{np+k} = z_k[/itex] for all integers n and k (in other words we just extend it by letting z_{p+1} = z_1, z_{p+2} = z_2, ...).
You have
[tex]\left(\sum_{j=1}^p z_j \right)^2 = \sum_{i=1}^p \sum_{j=1}^{p} z_i z_j = \sum_{i=1}^p \sum_{j=1}^{p} z_jz_{j+i}[/tex]
By the rearrangement inequality:
[tex]\sum_{j=1}^{p} z_jz_{j+i} \leq \sum_{j=1}^{p} z_j^2[/tex]
So:
[tex]\sum_{i=1}^p \sum_{j=1}^{p} z_jz_{j+i} \leq \sum_{i=1}^p\sum_{j=1}^{p} z_j^2 = p\sum_{j=1}^{p} z_j^2[/tex]I also guess there is a way to reason geometrically since:
[tex]\left(\sum_{j=1}^p z_j^2\right)^{1/2}[/tex]
is the length of the vector (z_1,z_2,...,z_j).