Under construction
Stations under construction may not yet contain a good range of resources covering all the key questions and different types of problem.
How can recursion and induction be used to describe and analyse situations?
Key questions
- 1
What are the Fibonacci numbers, and what properties do they have?
- 2
How can the highest common factor of two numbers be found?
- 3
What is the Fundamental theorem of arithmetic, and why does it matter?
- 4
What does it mean to describe situations recursively?
- 5
How can results be proved using induction?
Loading resources...
No resources found.
No resources found.
This resource is in your collection
Review questions Click for information about review questions
No questions found.
Introducing...
| Resource type | Title |
|---|---|
| Investigation | Picture this! |
Developing...
| Resource type | Title |
|---|---|
| Rich example | Euclid's algorithm |
| Building blocks | One step, two step |
| Building blocks | Triominoes |
| Scaffolded task | Division game |
| Scaffolded task | The Fundamental Theorem of Arithmetic |
| Problem requiring decisions | Multiplication magic square |
| Food for thought | A Diophantine equation |
| Food for thought | Factorial fun |
| Food for thought | LCM Sudoku |
| Investigation | Buckets and ponds |
| Go and think about it... | $S$-prime numbers |
| Go and think about it... | An olympiad question |
Review questions
