0

I am having trouble proving this inequality: $2ab\leq a^2+b^2$

I can transpose the equation and change around signs. But I am not sure If I need to use k+1 here or just prove the inequality. In discrete math what would my professor be looking for as a proper answer?

Dre_Dre
  • 221
  • A duplicate of this question (among others). It generalizes to more than two variables, and goes by the name AM-GM -inequality. The acronym comes from the fact that the inequality states that the arithmetic mean of a finite collection of positive numbers is $\ge$ than their geometric mean. If you find a better duplicate target, ping me. Dre_Dre: plug in $x=a^2$, $y=b^2$ to arrive at something that looks even more like your inequality. – Jyrki Lahtonen Jul 21 '16 at 14:16

1 Answers1

0

HINT: $a^2+b^2-2ab=(a-b)^2\;\;$

Brian M. Scott
  • 616,228