Phase 1: Prepare
Step 1 Warm-up recall
From M5.L3: which is cheaper at n = 20, 100n or n×n?
Private: nothing you type here is sent or stored.
Step 2 Learning goal
By the end of this lesson you can:
- describe exponential growth (Foundation);
- compute 2 to the power n for small n (Core);
- explain a time-versus-memory trade-off (Core).
Phase 2: Teach
Step 3 A familiar example
Each new switch added to a panel doubles the number of on and off settings. Ten switches give a thousand settings; thirty give over a billion.
Step 4 Clear explanation
In exponential growth the cost doubles each time n increases by one, so the cost is 2 to the power n. A method that checks every subset of a list of n items must examine 2 to the power n subsets.
| Items (n) | Subsets to check (2 to the power n) |
|---|---|
| 10 | 1,024 |
| 20 | 1,048,576 |
| 30 | 1,073,741,824 |
Adding one item doubles the work. Thirty items already mean more than a billion checks, so a method of this kind is practical only for small n, and a cleverer method is needed, or an answer that is good rather than perfect. Some problems are not known to have a fast method at all, a topic that returns in Module 8.
Cost is not only time. A method can be faster if it keeps extra data in memory: for example, storing a sorted copy of a list speeds later searches but uses more memory. This is a trade-off. Simplicity is another: a plain method that is easy to check may be the better choice for small inputs. Computers offer both fast and large memory, and designers trade one against the other; see the entry on the computer.
Step 5 Worked example (4 marks)
How many subsets must be checked for 12 items?
- Use 2 to the power n with n = 12. (1 mark)
- 2 to the power 10 is 1,024. (1 mark)
- Two more doublings give 1,024 × 4 = 4,096. (1 mark)
- Answer: 4,096 subsets. (1 mark)
Phase 3: Practise
Step 6 Learner practice (instant-marked)
1. In exponential growth, adding one item:
The cost is 2 to the power n.
2. 2 to the power 10 equals:
It is the tenth doubling of 1.
3. Checking every subset of 20 items needs about:
2 to the power 20 is 1,048,576.
4. Keeping a sorted copy to speed up searches is a trade of:
It uses more memory to save time.
Phase 4: Close
Step 7 Recap
- Exponential growth doubles the cost per extra item.
- 2 to the power 30 is over a billion.
- Time, memory and simplicity trade against each other.
Step 8 Exit ticket (ungraded)
Give the number of subsets for 5, 10 and 15 items.
Private: nothing you type here is sent or stored.
Step 9 Go further (Extension)
Describe one trade-off between memory and time in an everyday tool.
Common mistakes
| Mistake | Why it fails |
|---|---|
| Treating 2 to the power n as n times 2 | It is 2 multiplied by itself n times. |
| Assuming faster hardware solves exponential growth | A few more items cancel the gain. |
| Ignoring memory cost | Faster methods often use more memory. |
Limits. Exponential counts apply to methods that check every combination; many problems have cleverer methods.