- Algebra (86)
- Algebraic Proofs (4)
- Changing the Subject (4)
- Curved Graphs (7)
- Differentiation (2)
- Expanding Brackets (5)
- Factor Theorem and Remainder Theorem (FM only) (2)
- Factorising (6)
- Formulae and Simplifying Expressions (11)
- Functions (4)
- Inequalities (5)
- Iteration (1)
- Matrix Algebra (FM only) (1)
- Matrix Algebra (FM Only) (1)
- Quadratic Graphs (3)
- Sequences (8)
- Simultaneous Equations (3)
- Solving Equations (13)
- Straight Line Graphs (4)
- Transformations of Curves (1)
- Trial & Improvement (1)

- Computer Science (33)
- Data Handling & Probability (20)
- Revision (6)
- Shape, Space & Measures (77)
- 2D Properties of Shapes (2)
- 3D Shapes (2)
- 3D Volume, Surface Area (3)
- Angles (10)
- Area & Perimeter (6)
- Circle Theorems (4)
- Compound Measures and Units of Measurement (7)
- Construction, Loci & Scale Drawings (4)
- Coordinates (1)
- Distance/Velocity Time Graphs (2)
- Pythagoras (6)
- Similarity & Congruency (5)
- Symmetry (3)
- Transformations (3)
- Trigonometry (17)
- Vectors (2)

# Full Coverage: Counting Strategies

## 1 files01/03/2018

GCSE question compilation which aims to cover all types of questions that might be seen on the topic of counting strategies. Students can complete this set of questions interactively on the DFM Homework Platform. Also contains answers.

# GCSE Counting Strategies

## 3 files20/03/2017

Counting by (a) systematic listing and (b) by multiplying. Part of the new GCSE specification.

# Counting / Combinatorics - Please use 'GCSE counting' instead

## 5 files19/02/2017

(Note: I have kept this resource for posterity, but please use the 'GCSE Counting Strategies' resource instead)

(a) Appreciate that if different selections are independent, each with a number of choices, then the total number of combinations is the product of these.

(b) Understand and use factorial function.

(c) Understand and use 'choose' function.

(d) Solve a variety of arrangement problems.# Robot Path Activity

## 2 files11/05/2016

Activity in which students have to count the total number of possible paths for a robot given certain restrictions on its movements, in order to work out probabilities.