51����

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Bin-packing Algorithm. Primarily written for Edexcel but suitable for OCR specifications. Complete, step-by-step approach with A Level standard examples. Format is such that students can also use as revision at their own pace and includes a handy flowchart for revision. The full set of 16 PowerPoints in this series cover the whole of the Edexcel D1 course: Algorithms Bin-Packing Algorithm Critical Path Analysis (GANTT) Dijjkstra’s Shortest Path Algorithm Floyd’s shortest distance algorithm Graphs & Networks Kruskal’s Minimum Spanning Tree Linear Programming Planarity Algorithm Prim’s Minimum Spanning Tree Route Inspection Algorithm Simplex Algorithm 1 - Edexcel tableau Simplex Algorithm 2 (artificial variables) - Edexcel tableau Simplex Algorithm 3 (Big M method) - Edexcel tableau Sorting Algorithm: Quick-sort, Bubble-sort (& Shuttle-sort for OCR) Travelling Salesperson Problem, including Nearest Neighbour Algorithm (+ tour improvement algorithm for OCR) Updated 2022

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Prim’s Minimum Spanning Tree Algorithm. Primarily written for Edexcel but suitable for OCR specifications. Complete, step-by-step approach, suitable for teaching or for students to use as revision at their own pace. Includes a handy flowchart for revision. The full set of 16 PowerPoints in this series cover the whole of the Edexcel D1 course: Algorithms Bin-Packing Algorithm Critical Path Analysis (GANTT) Dijjkstra’s Shortest Path Algorithm Floyd’s shortest distance algorithm Graphs & Networks Kruskal’s Minimum Spanning Tree Linear Programming Planarity Algorithm Prim’s Minimum Spanning Tree Route Inspection Algorithm Simplex Algorithm 1 - Edexcel tableau Simplex Algorithm 2 (artificial variables) - Edexcel tableau Simplex Algorithm 3 (Big M method) - Edexcel tableau Sorting Algorithm: Quick-sort, Bubble-sort (& Shuttle-sort for OCR) Travelling Salesperson Problem, including Nearest Neighbour Algorithm (+ tour improvement algorithm for OCR) Updated 2022

This GCSE resource helps students consider approaches to factorising quadratic expressions where the coefficient of x^2 is greater than 1

Powerpoint lesson to show how prove by Mathematical Induction for: algebraic results matrix results divisibility results as part of Edexcel A and AS Level Further Maths Core 1 module **UPDATED to include series notation Un type

Part of the Further Statistics module of Edexcel’s Further Maths course, this PowerPoint explains step by step the development of probability generating functions, and their use with standard Binomial, Poisson, Geometric and Negative Binomial distributions

The HUNGARIAN ALLOCATION ALGORITHM is one PowerPoint covering one topic of Edexcel’s Further Maths Decision Maths 2 course. There are 7 other PowerPoints covering the other topics (detailed below), which can be bought separately. The whole set of 8 PowerPoints is also available to purchase as a bundle. Each PowerPoint contains complete, step-by-step instructions and A Level standard examples. These may be used for both teaching and for student revision. Decision Maths is a module that lends itself to PowerPoint instruction – networks grow and develop as information is added, and these PowerPoints model this in real time. Having developed these as a teaching resource, I find the course can be taught in a substantially reduced time, leaving more time for consolidation and practice or for teaching other FM options. My students take no notes in class but, once taught, use the PowerPoints as reminders and revision as they practise. Most PowerPoints contain a handy flowchart for in-class prompts or for private revision. When used under the previous, modular, A Level specification, this module was consistently the highest-scoring module for my students. “S”, year 12, says: “I find these PowerPoints really visual – I can see what is happening. It makes the process of learning much quicker and easier to understand, and I like the fact that I can always go back and replay the lessons, which is helpful. I find them very useful for revision.” This PowerPoint is for: HUNGARIAN ALLOCATION ALGORITHM Others titles in the series are available separately for each of: Decision Analysis Dynamic programming Flows 1 Flows 2 Game Theory Recurrence Relations Transportation Algorithm Updated 2025

FLOWS 2 is one PowerPoint covering one topic of Edexcel’s Further Maths Decision Maths 2 course. There are 7 other PowerPoints covering the other topics (detailed below), which can be bought separately. The whole set of 8 PowerPoints is also available to purchase as a bundle. Each PowerPoint contains complete, step-by-step instructions and A Level standard examples. These may be used for both teaching and for student revision. Decision Maths is a module that lends itself to PowerPoint instruction – networks grow and develop as information is added, and these PowerPoints model this in real time. Having developed these as a teaching resource, I find the course can be taught in a substantially reduced time, leaving more time for consolidation and practice or for teaching other FM options. My students take no notes in class but, once taught, use the PowerPoints as reminders and revision as they practise. Most PowerPoints contain a handy flowchart for in-class prompts or for private revision. When used under the previous, modular, A Level specification, this module was consistently the highest-scoring module for my students. “S”, year 12, says: “I find these PowerPoints really visual – I can see what is happening. It makes the process of learning much quicker and easier to understand, and I like the fact that I can always go back and replay the lessons, which is helpful. I find them very useful for revision.” This PowerPoint is for: FLOWS 2 Others titles in the series are available separately for each of: Decision Analysis Dynamic programming Flows 1 Game Theory Hungarian Allocation Algorithm Recurrence Relations Transportation Algorithm Updated 2025

Dynamic Programming is one PowerPoint covering one topic of Edexcel’s Further Maths Decision Maths 2 course. There are 7 other PowerPoints covering the other topics (detailed below), which can be bought separately. The whole set of 8 PowerPoints is also available to purchase as a bundle. Each PowerPoint contains complete, step-by-step instructions and A Level standard examples. These may be used for both teaching and for student revision. Decision Maths is a module that lends itself to PowerPoint instruction – networks grow and develop as information is added, and these PowerPoints model this in real time. Having developed these as a teaching resource, I find the course can be taught in a substantially reduced time, leaving more time for consolidation and practice or for teaching other FM options. My students take no notes in class but, once taught, use the PowerPoints as reminders and revision as they practise. Most PowerPoints contain a handy flowchart for in-class prompts or for private revision. When used under the previous, modular, A Level specification, this module was consistently the highest-scoring module for my students. “S”, year 12, says: “I find these PowerPoints really visual – I can see what is happening. It makes the process of learning much quicker and easier to understand, and I like the fact that I can always go back and replay the lessons, which is helpful. I find them very useful for revision.” This PowerPoint is for: DYNAMIC PROGRAMMING Others titles in the series are available separately for each of: Decision Analysis Flows 1 Flows 2 Game Theory Hungarian Allocation Algorithm Recurrence Relations Transportation Algorithm Updated 2025

GAME THEORY is one PowerPoint covering one topic of Edexcel’s Further Maths Decision Maths 2 course. There are 7 other PowerPoints covering the other topics (detailed below), which can be bought separately. The whole set of 8 PowerPoints is also available to purchase as a bundle. Each PowerPoint contains complete, step-by-step instructions and A Level standard examples. These may be used for both teaching and for student revision. Decision Maths is a module that lends itself to PowerPoint instruction – networks grow and develop as information is added, and these PowerPoints model this in real time. Having developed these as a teaching resource, I find the course can be taught in a substantially reduced time, leaving more time for consolidation and practice or for teaching other FM options. My students take no notes in class but, once taught, use the PowerPoints as reminders and revision as they practise. Most PowerPoints contain a handy flowchart for in-class prompts or for private revision. When used under the previous, modular, A Level specification, this module was consistently the highest-scoring module for my students. “S”, year 12, says: “I find these PowerPoints really visual – I can see what is happening. It makes the process of learning much quicker and easier to understand, and I like the fact that I can always go back and replay the lessons, which is helpful. I find them very useful for revision.” This PowerPoint is for: GAME THEORY Others titles in the series are available separately for each of: Decision Analysis Dynamic programming Flows 1 Flows 2 Hungarian Allocation Algorithm Recurrence Relations Transportation Algorithm Updated 2025

TRANSPORTATION ALGORITHM is one PowerPoint covering one topic of Edexcel’s Further Maths Decision Maths 2 course. There are 7 other PowerPoints covering the other topics (detailed below), which can be bought separately. The whole set of 8 PowerPoints is also available to purchase as a bundle. Each PowerPoint contains complete, step-by-step instructions and A Level standard examples. These may be used for both teaching and for student revision. Decision Maths is a module that lends itself to PowerPoint instruction – networks grow and develop as information is added, and these PowerPoints model this in real time. Having developed these as a teaching resource, I find the course can be taught in a substantially reduced time, leaving more time for consolidation and practice or for teaching other FM options. My students take no notes in class but, once taught, use the PowerPoints as reminders and revision as they practise. Most PowerPoints contain a handy flowchart for in-class prompts or for private revision. When used under the previous, modular, A Level specification, this module was consistently the highest-scoring module for my students. “S”, year 12, says: “I find these PowerPoints really visual – I can see what is happening. It makes the process of learning much quicker and easier to understand, and I like the fact that I can always go back and replay the lessons, which is helpful. I find them very useful for revision.” This PowerPoint is for: TRANSPORTATION ALGORITHM Others titles in the series are available separately for each of: Decision Analysis Dynamic programming Flows 1 Flows 2 Game Theory Hungarian Allocation Algorithm Recurrence Relations Updated 2025

RECURRENCE RELATIONS is one PowerPoint covering one topic of Edexcel’s Further Maths Decision Maths 2 course. There are 7 other PowerPoints covering the other topics (detailed below), which can be bought separately. The whole set of 8 PowerPoints is also available to purchase as a bundle. Each PowerPoint contains complete, step-by-step instructions and A Level standard examples. These may be used for both teaching and for student revision. Decision Maths is a module that lends itself to PowerPoint instruction – networks grow and develop as information is added, and these PowerPoints model this in real time. Having developed these as a teaching resource, I find the course can be taught in a substantially reduced time, leaving more time for consolidation and practice or for teaching other FM options. My students take no notes in class but, once taught, use the PowerPoints as reminders and revision as they practise. Most PowerPoints contain a handy flowchart for in-class prompts or for private revision. When used under the previous, modular, A Level specification, this module was consistently the highest-scoring module for my students. “S”, year 12, says: “I find these PowerPoints really visual – I can see what is happening. It makes the process of learning much quicker and easier to understand, and I like the fact that I can always go back and replay the lessons, which is helpful. I find them very useful for revision.” This PowerPoint is for: RECURRENCE RELATIONS Others titles in the series are available separately for each of: Decision Analysis Dynamic programming Flows 1 Flows 2 Game Theory Hungarian Allocation Algorithm Transportation Algorithm Updated 2025

FLOWS 1 is one PowerPoint covering one topic of Edexcel’s Further Maths Decision Maths 2 course. There are 7 other PowerPoints covering the other topics (detailed below), which can be bought separately. The whole set of 8 PowerPoints is also available to purchase as a bundle. Each PowerPoint contains complete, step-by-step instructions and A Level standard examples. These may be used for both teaching and for student revision. Decision Maths is a module that lends itself to PowerPoint instruction – networks grow and develop as information is added, and these PowerPoints model this in real time. Having developed these as a teaching resource, I find the course can be taught in a substantially reduced time, leaving more time for consolidation and practice or for teaching other FM options. My students take no notes in class but, once taught, use the PowerPoints as reminders and revision as they practise. Most PowerPoints contain a handy flowchart for in-class prompts or for private revision. When used under the previous, modular, A Level specification, this module was consistently the highest-scoring module for my students. “S”, year 12, says: “I find these PowerPoints really visual – I can see what is happening. It makes the process of learning much quicker and easier to understand, and I like the fact that I can always go back and replay the lessons, which is helpful. I find them very useful for revision.” This PowerPoint is for: FLOWS 1 Others titles in the series are available separately for each of: Decision Analysis Dynamic programming Flows 2 Game Theory Hungarian Allocation Algorithm Recurrence Relations Transportation Algorithm Updated 2025

DECISION ANALYSIS is one PowerPoint covering one topic of Edexcel’s Further Maths Decision Maths 2 course. There are 7 other PowerPoints covering the other topics (detailed below), which can be bought separately. The whole set of 8 PowerPoints is also available to purchase as a bundle. Each PowerPoint contains complete, step-by-step instructions and A Level standard examples. These may be used for both teaching and for student revision. Decision Maths is a module that lends itself to PowerPoint instruction – networks grow and develop as information is added, and these PowerPoints model this in real time. Having developed these as a teaching resource, I find the course can be taught in a substantially reduced time, leaving more time for consolidation and practice or for teaching other FM options. My students take no notes in class but, once taught, use the PowerPoints as reminders and revision as they practise. Most PowerPoints contain a handy flowchart for in-class prompts or for private revision. When used under the previous, modular, A Level specification, this module was consistently the highest-scoring module for my students. “S”, year 12, says: “I find these PowerPoints really visual – I can see what is happening. It makes the process of learning much quicker and easier to understand, and I like the fact that I can always go back and replay the lessons, which is helpful. I find them very useful for revision.” This PowerPoint is for: DECISION ANALYSIS Other titles in the series are available separately for each of: Dynamic programming Flows 1 Flows 2 Game Theory Hungarian Allocation Algorithm Recurrence Relations Transportation Algorithm Updated 2025