AoPSWiki
Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!

Inequality Introductory Problem 2

From AoPSWiki

Revision as of 19:18, 23 May 2009 by Tonypr (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Problem

Show that \sum_{k=1}^{n}a_k^2 \geq a_1a_2+a_2a_3+\cdots+a_{n-1}a_n+a_na_1.

Solutions

Solution

Multiply both sides by 2:

2\sum_{k=1}^{n}a_{k}^{2}\ge 2(a_{1}a_{2}+a_{2}a_{3}+\cdots+a_{n-1}a_{n}+a_{n}a_{1})

By subtracting each side by the RHS, you result in:

(a_1-a_n)^2+(a_2-a_1)^2+(a_3-a_2)^2+\cdots+(a_n-a_{n-1})^2\ge 0

Which is always true.

Retrieved from "http://www.artofproblemsolving.com/Wiki/index.php/Inequality_Introductory_Problem_2"
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • Foundation • Privacy • Contact Us