How Can I prove that $x_1^2+x_2^2+......+x_n^2>0$ by matematical induction

118 Views Asked by At

The problem is this: Prove by induction that $x_1^2+x_2^2+.....+x_n^2>0$ unless $x_1=...=x_n=0. $ I have tried:

If $x_n$> 0 then For $n=1$: $$x_1^2>0$$

We suppose that it is true for $n=k$:$$ x_1^2+x_2^2+...+x_k^2>0$$

We will prove for $n=k+1$:

As $x_{n}^2>0$ so $x_{k+1}^2 >0$

and $$ x_1^2+x_2^2+...+x_k^2>0 $$

therefore $$x_1^2+x_2^2+.....+x_{k+1}^2>0.$$ Q.E.D.

But I am not sure. Thank you.

1

There are 1 best solutions below

0
On

For $n = 1, x_1^2 > 0$ unless $x_1 = 0$, thus the base case is cleared.Assume its true for $n = k$, then $x_1^2+x_2^2+\cdots x_{k+1}^2 \ge x_1^2+x_2^2+\cdots + x_k^2 > 0$, unless $x_{k+1} = 0 = x_1 = x_2 = .. = x_k$. Thus the statement is true for all $n \ge 1$.