Or search by topic
This problem provides an introduction to summing geometric series, and allows students to discover for themselves the formulae used to calculate such sums. By seeing a particular case, students can perceive the structure and see where the general method for summing such series comes from.
You may wish to show the video, in which Alison works out the sum of the first twenty terms of $2, 8, 32, 128, 512 ...$ in silence, or you may wish to recreate the video for yourself on the board.
"Can you make sense of the video? See if you can recreate it with your partner."
"Can you adapt the method to work out the sum of the first 50 terms of the sequence?"
Share answers and explanations of how they worked it out.
Next, give students the following questions:
"Can you adapt the method to work out these sums? In a while I'm going to give you another question like these and you'll need to be able to work it out efficiently"
While students are working, listen out for useful comments that they make about how to work out such sums generally. Then bring the class together to share answers and methods for the questions they have worked on.
Make up a few questions like those above, and invite students out to the board to work them out 'on the spot', explaining what they do as they go along.
Next, invite students to create a formula from their general thinking:
"Imagine a sequence with first term $a$ and each term after that is multiplied by $r$. Can you use what you did with the numerical examples to create a formula for the sum of the series?"
Give students time to think and discuss in pairs and then share their suggestions.
To finish off, perhaps offer some questions for students to try out their formula, or discuss what happens when the sequence has infinitely many terms, and the conditions necessary for convergence.
How does Alison sum the series in the video? What are the key steps?
What do you need to do to adapt Alison's method for other sequences?
Telescoping Series invites students to investigate another family of series and how to sum them.
There is a proof sorter activity that could be offered to students who are having difficulty generalising the method.
Find $S_r = 1^r + 2^r + 3^r + ... + n^r$ where r is any fixed positive integer in terms of $S_1, S_2, ... S_{r-1}$.
Make a conjecture about the sum of the squares of the odd positive integers. Can you prove it?