Every body knows that:(adsbygoogle = window.adsbygoogle || []).push({});

[tex]x_{1}^2+x_{2}^2........x_{n}^2 =0\Longrightarrow x_{1}=0\wedge x_{2}=0........\wedge x_{n}=0[/tex].

But how do we prove that?

Perhaps by using induction?

For n=1 .o.k

Assume true for n=k

And here now is the difficult part .How do we prove the implication for n=k+1??

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# An easy difficult problem

Loading...

Similar Threads - easy difficult problem | Date |
---|---|

I An easy proof of Gödel's first incompleteness theorem? | Mar 6, 2018 |

I Help with a difficult (?) regression | Oct 11, 2016 |

Easy Skewness question | Jun 9, 2014 |

Mental Blank / Hopefully easy question | Sep 29, 2013 |

Easy-to-compute posteriors / closure under noisy sampling | Jul 6, 2013 |

**Physics Forums - The Fusion of Science and Community**