BOOK
Edexcel AS and A level Further Mathematics Decision Mathematics 2 Textbook + e-book
Susie Jameson | Francis Norman | Keith Pledger | Peter Sherran | Harry Smith | Ibrahim Wazir
(2018)
Additional Information
Book Details
Abstract
Exam Board: Edexcel
Level: AS and A level
Subject: Further Mathematics
First teaching: September 2017
First exams: Summer 2018
With over 1.3 million copies sold of the previous edition, Pearson’s textbooks are the market-leading and most trusted resources for AS and A level Further Mathematics.
This book covers all the content needed for the optional Edexcel AS and A level Decision Mathematics 2 exams.
- Fully updated to match the 2017 specifications, with more of a focus on problem-solving and modelling.
-
FREE additional online content to support your independent learning, including full worked solutions for every question in the book (SolutionBank) and GeoGebra interactives.
-
Includes access to an online digital edition (valid for 3 years once activated).
-
Includes worked examples with guidance, lots of exam-style questions, practice papers, and plenty of mixed and review exercises.
Table of Contents
| Section Title | Page | Action | Price |
|---|---|---|---|
| Front Cover | Front Cover | ||
| Contents | iii | ||
| Overarching themes | iv | ||
| Extra online content | vi | ||
| Chapter 1: Transportation problems | 1 | ||
| 1.1: The north-west corner method | 2 | ||
| 1.2: Unbalanced problems and degenerate solutions | 6 | ||
| 1.3: Finding an improved solution | 11 | ||
| 1.4: The stepping-stone method | 19 | ||
| 1.5: Linear programming | 28 | ||
| Mixed exercise: 1 | 32 | ||
| Chapter 2: Allocation problems | 38 | ||
| 2.1: The Hungarian algorithm | 39 | ||
| 2.2: Using a dummy | 49 | ||
| 2.3: Maximum profit allocation | 51 | ||
| 2.4: Managing incomplete data | 56 | ||
| 2.5: Linear programming | 62 | ||
| Mixed exercise: 2 | 67 | ||
| Chapter 3: Flows in networks 1 | 72 | ||
| 3.1: Flows in networks | 73 | ||
| 3.2: Cuts and their capacities | 78 | ||
| 3.3: Finding an initial flow | 85 | ||
| 3.4: Flow-augmenting routes | 88 | ||
| 3.5: Maximum flow – minimum cut theorem | 98 | ||
| Mixed exercise: 3 | 104 | ||
| Chapter 4: Flows in networks 2 | 109 | ||
| 4.1: Lower capacities | 110 | ||
| 4.2: Sources and sinks | 119 | ||
| 4.3: Restricted capacity nodes | 128 | ||
| Mixed exercise: 4 | 132 | ||
| Review exercise: 1 | 138 | ||
| Chapter 5: Dynamic programming | 151 | ||
| 5.1: Shortest and longest path problems | 152 | ||
| 5.2: Minimax and maximin problems | 161 | ||
| 5.3: Dynamic programming problems in table form | 165 | ||
| Mixed exercise: 5 | 174 | ||
| Chapter 6: Game theory | 179 | ||
| 6.1: Play-safe strategies and stable solutions | 180 | ||
| 6.2: Reducing the pay-off matrix | 191 | ||
| 6.3: Optimal strategies for games with no stable solution | 194 | ||
| 6.4: Converting games to linear programming problems | 203 | ||
| Mixed exercise: 6 | 209 | ||
| Chapter 7: Recurrence relations | 214 | ||
| 7.1: Forming recurrence relations | 215 | ||
| 7.2: Solving first-order recurrence relations | 219 | ||
| 7.3: Solving second-order recurrence relations | 228 | ||
| Mixed exercise: 7 | 236 | ||
| Chapter 8: Decision analysis | 242 | ||
| 8.1: Decision trees | 243 | ||
| 8.2: Utility | 252 | ||
| Mixed exercise: 8 | 259 | ||
| Review exercise: 2 | 263 | ||
| Exam-style practice (AS level) | 272 | ||
| Exam-style practice (A level) | 274 | ||
| Answers | 277 | ||
| Index | 325 | ||
| Back Cover | Back Cover |