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

Difference between revisions of "User:Temperal/The Problem Solver's Resource3"

(→‎Rules of Products: explanatiobn)
(→‎Rules of Summation)
Line 16: Line 16:
  
 
<math>\sum_{i=1}^{n} i^2 = \frac{n(n+1)(2n+1)}{6}</math>
 
<math>\sum_{i=1}^{n} i^2 = \frac{n(n+1)(2n+1)}{6}</math>
 +
 +
=====Derivation=====
 +
We write <math>n^2</math> as <math>a_1\binom{n}{1}+a_2\binom{n}{2}</math>. Substituting n=1 gives <math>a_1=1</math> while substituting n=2 gives <math>a_2=2</math>. Hence, <math>n^2=\binom{n}{1}+2\binom{n}{2}</math>.
 +
 +
Now, <math>\sum_{i=1}^{n} i^2=\sum_{i=1}^n (\binom{i}{1}+2\binom{i}{2})=\sum_{i=1}^n \binom{i}{1}+2\sum_{i=1}^n \binom{i}2=\binom{n+1}{2}+2\binom{n+1}{3}</math>, where we use the [[Hockeystick Identity]]. After some algebra, this comes out to <math>\frac{(n)(n+1)(2n+1)}{6}</math>.
 +
 +
This method can be generalized nicely; <math>i^n=\sum_{k=1}^n a_k\binom{i}{k}</math>.
  
 
<math>\sum_{i=1}^{n} i^3 = \left(\sum_{i=1}^{n} i\right)^2 = \left(\frac{n(n+1)}{2}\right)^2</math>
 
<math>\sum_{i=1}^{n} i^3 = \left(\sum_{i=1}^{n} i\right)^2 = \left(\frac{n(n+1)}{2}\right)^2</math>

Revision as of 22:07, 10 January 2009


Introduction | Other Tips and Tricks | Methods of Proof | You are currently viewing page 3.

Summations and Products

Definitions

  • Summations: $\sum_{i=a}^{b}c_i=c_a+c_{a+1}+c_{a+2}...+c_{b-1}+c_{b}$
  • Products: $\prod_{i=a}^{b}c_i=c_a\cdot c_{a+1}\cdot c_{a+2}...\cdot c_{b-1}\cdot c_{b}$

Rules of Summation

$\sum_{i=a}^{b}f_1(i)+f_2(i)+\ldots f_n(i)=\sum_{i=a}^{b}f(i)+\sum_{i=a}^{b}f_2(i)+\ldots+\sum_{i=a}^{b}f_n(i)$

$\sum_{i=a}^{b}c\cdot f(i)=c\cdot \sum_{i=a}^{b}f(i)$

$\sum_{i=1}^{n} i= \frac{n(n+1)}{2}$, and in general $\sum_{i=a}^{b} i= \frac{(b-a+1)(a+b)}{2}$

The above should all be self-evident and provable by the reader within seconds.

$\sum_{i=1}^{n} i^2 = \frac{n(n+1)(2n+1)}{6}$

Derivation

We write $n^2$ as $a_1\binom{n}{1}+a_2\binom{n}{2}$. Substituting n=1 gives $a_1=1$ while substituting n=2 gives $a_2=2$. Hence, $n^2=\binom{n}{1}+2\binom{n}{2}$.

Now, $\sum_{i=1}^{n} i^2=\sum_{i=1}^n (\binom{i}{1}+2\binom{i}{2})=\sum_{i=1}^n \binom{i}{1}+2\sum_{i=1}^n \binom{i}2=\binom{n+1}{2}+2\binom{n+1}{3}$, where we use the Hockeystick Identity. After some algebra, this comes out to $\frac{(n)(n+1)(2n+1)}{6}$.

This method can be generalized nicely; $i^n=\sum_{k=1}^n a_k\binom{i}{k}$.

$\sum_{i=1}^{n} i^3 = \left(\sum_{i=1}^{n} i\right)^2 = \left(\frac{n(n+1)}{2}\right)^2$

$\sum_{i=1}^n i^4=\frac{n(n+1)(2n+1)(3n^2+3n-1)}{30}$

$\sum_{i=1}^n i^5=\frac{n^2(n+1)^2(2n^2+2n-1)}{12}$


Rules of Products

$\prod_{i=a}^{b}x=x^{(b-a+1)}$

$\prod_{i=a}^{b}x\cdot y=x^{(b-a+1)}y^{(b-a+1)}$

These should be self-evident, as above.

Back to page 2 | Continue to page 4

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=User:Temperal/The_Problem_Solver%27s_Resource3&oldid=29429"