Welcome to the World of Series!
In this chapter of Pure Core, we are moving beyond just adding a few numbers together. You are going to learn how to find the total sum of hundreds, thousands, or even an infinite number of terms without actually doing the manual addition! This is a vital skill in Further Maths because it forms the foundation for more advanced topics like calculus and approximations. Don't worry if it seems like a lot of symbols at first—we’ll break it down step-by-step.
1. The Basics: Sigma Notation and Linearity
Before we dive into the big formulae, let's refresh our memory on the Sigma notation \(\sum\). This symbol is just a fancy way of saying "add everything up."
Quick Tip: Think of the Sigma symbol \(\sum\) as a machine. The number at the bottom is where you start, the number at the top is where you stop, and the bit in the middle is the rule you follow for each step.
Rules for manipulating Sigma:
To solve complex problems, you can split Sigma expressions apart. This is called linearity:
- Constant Rule: \(\sum_{r=1}^{n} k = nk\) (Adding the same number \(k\), \(n\) times).
- Split Rule: \(\sum (a_r + b_r) = \sum a_r + \sum b_r\).
- Factor Rule: \(\sum k a_r = k \sum a_r\) (You can pull a constant out to the front).
Key Takeaway: Always simplify your expression into smaller parts before trying to use the standard formulae.
2. The "Big Three" Summation Formulae
The OCR syllabus requires you to know and use these three standard results. These are your "power tools" for this chapter.
I. Sum of Integers (\(r\))
\(\sum_{r=1}^{n} r = \frac{1}{2}n(n+1)\)
Example: If you want to add all numbers from 1 to 100, just plug in \(n=100\).
II. Sum of Squares (\(r^2\))
\(\sum_{r=1}^{n} r^2 = \frac{1}{6}n(n+1)(2n+1)\)
Note: This formula will be given in your formula booklet, but you should be comfortable using it!
III. Sum of Cubes (\(r^3\))
\(\sum_{r=1}^{n} r^3 = \frac{1}{4}n^2(n+1)^2\)
Did you know? The sum of cubes is actually the square of the sum of integers! Notice that \(\frac{1}{4}n^2(n+1)^2 = [\frac{1}{2}n(n+1)]^2\). This is a great memory aid.
Common Mistake to Avoid: These formulae only work if the sum starts at \(r=1\). If your sum starts at \(r=5\), you must calculate the sum from 1 to \(n\) and then subtract the sum from 1 to 4.
3. The Method of Differences
What happens when you don't have a standard formula? We use a clever trick called the Method of Differences (sometimes called telescoping).
The Analogy: The Collapsing Telescope
Imagine an old-fashioned pirate telescope. When you push it together, all the middle sections slide inside each other, and you’re left with just the two ends. That is exactly what happens here!
Step-by-Step Process:
- Partial Fractions: Usually, the term you are summing will look like a fraction. Use partial fractions to split it into two or more parts (e.g., \(\frac{1}{r} - \frac{1}{r+1}\)).
- Write out terms: Write out the first few terms (\(r=1, r=2, r=3\)) and the last few terms (\(r=n-1, r=n\)).
- The "Great Cancel": You will notice that terms start canceling each other out.
- Find the survivors: Identify which terms are left at the very beginning and the very end.
Example: For \(\sum_{r=1}^{n} (\frac{1}{r} - \frac{1}{r+1})\):
When \(r=1\), we have \((1 - \frac{1}{2})\)
When \(r=2\), we have \((\frac{1}{2} - \frac{1}{3})\)
Notice the \(-\frac{1}{2}\) and \(+\frac{1}{2}\) cancel! This continues until only the first and last parts remain.
Infinite Series: If the question asks for the "sum to infinity" (\(\sum_{r=1}^{\infty}\)), simply take the limit of your finite sum as \(n \to \infty\). If the leftover parts with \(n\) in them go to zero, the series converges.
Key Takeaway: If you see a summation of a fraction, 90% of the time, you need Partial Fractions and the Method of Differences.
4. Proving Series Results with Induction
The syllabus mentions that you may be asked to prove these summation formulae. In Further Maths, the "gold standard" for proof is Mathematical Induction.
The Domino Effect Analogy
Proof by induction is like knocking down a line of dominoes:
- Step 1 (Basis): Show the first domino falls (Prove it works for \(n=1\)).
- Step 2 (Assumption): Assume any random domino in the middle falls (Assume it works for \(n=k\)).
- Step 3 (Inductive Step): Show that if the \(k\)-th domino falls, it must knock down the \((k+1)\)-th domino.
- Step 4 (Conclusion): Since the first fell, and each knocks the next, they all must fall!
Quick Review Box: Induction for Series
To prove \(\sum_{r=1}^{n} f(r) = S_n\):
1. Check \(n=1\).
2. Assume \(\sum_{r=1}^{k} f(r) = S_k\).
3. Add the next term: \(\sum_{r=1}^{k+1} f(r) = S_k + f(k+1)\).
4. Use algebra to show this equals the formula for \(S_{k+1}\).
Final Chapter Summary
- Standard Series: Learn the formulae for \(\sum r, \sum r^2,\) and \(\sum r^3\). Use linearity to split complex sums.
- Starting Point: Always check if the sum starts at \(r=1\). If not, subtract the missing "head" of the series.
- Method of Differences: Use partial fractions to create terms that cancel out, leaving only a few "survivor" terms.
- Proof: Be prepared to use Mathematical Induction to prove that a summation formula is true for all \(n\).
Don't worry if the algebra feels heavy! The more you practice splitting fractions and factoring out \((n+1)\), the more natural it will become. You've got this!