Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Inequality Introductory Problem 2

Revision as of 14:18, 23 May 2009 by Tonypr (talk | contribs) (→‎First Solution)
(diff) ← Older revision | Latest 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 "https://artofproblemsolving.com/wiki/index.php?title=Inequality_Introductory_Problem_2&oldid=31829"