a and b are integers(adsbygoogle = window.adsbygoogle || []).push({});

Prove that:

2ab <= a^{2}+ b^{2}

I have tested various values for a and b and determined that the statement seems to be generally true. I'm having a hard time though constructing a formal proof.

It will not do to suppose the statement is wrong and then provide a counterexample. This would only prove that the statement is true for those particular values of a and b, and not for all values.

I learned about mathematical induction but I think that method is used to prove statements about a well-ordered set. a and b can be any integer so I don't think that would work.

I wondered what kind of statement may have simplified to produce a^{2}+ b^{2}so I played with (a+b) * (a+b) which produced a^{2}+ b^{2}+ 2ab and also with (a-b) * (a-b) which produced a^{2}+ b^{2}- 2ab. This looks similar to the original statement, and I feel like I may be onto some clues.

Without giving me the answer, I wonder if someone could give me a push in the right direction?

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

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!

# B How to construct a proof?

Tags:

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads - construct proof | Date |
---|---|

A How can we construct ordinals after large Veblen? | Dec 11, 2017 |

I Constructing an Index | May 26, 2017 |

How to construct the natural numbers with hypersets | May 13, 2015 |

Constructive Proof of Material Implication | Jun 3, 2010 |

Constructing proofs of denumerable sets | Feb 17, 2009 |

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