Difference between revisions of "Inequality Introductory Problem 2"

(New page: == Problem == Show that <math>\sum_{k=1}^{n}a_k^2 \geq a_1a_2+a_2a_3+\cdots+a_{n-1}a_n+a_na_1</math>. == Solutions == ===First Solution=== Working backwards from the next inequality we...)
 
(First Solution)
Line 8: Line 8:
  
 
Working backwards from the next inequality we solve the origninal one:
 
Working backwards from the next inequality we solve the origninal one:
<center>
 
 
<math>
 
<math>
 
\begin{eqnarray*}
 
\begin{eqnarray*}
Line 18: Line 17:
 
\end{eqnarray*}
 
\end{eqnarray*}
 
</math>
 
</math>
</center>
 

Revision as of 12:37, 18 May 2009

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

First Solution

Working backwards from the next inequality we solve the origninal one: $(k=1n1(akak+1)2)+(ana1)202(k=1nak2)2((k=1n1akak+1)+ana1)02(k=1nak2)2((k=1n1akak+1)+ana1)2k=1nak22(a1a2+a2a3++an1an+ana1)k=1nak2(a1a2+a2a3++an1an+ana1)$ (Error compiling LaTeX. Unknown error_msg)