Specification points
AQA AS Further Mathematics 7366
158 points in 5 topics, with AQA's codes and titles.
Codes and titles are read by a script from AQA's published specification and have not been checked by a person. What each point covers is in the specification itself: AQA’s specification.
3.1 Overarching themes
- 3.1.1 OT1: Mathematical argument, language and proof
- OT1.1 Constructing and presenting mathematical arguments
- OT1.2 Mathematical language and syntax
- OT1.3 Set theory language and symbols
- OT1.5 Critiquing arguments, proofs and justifications
- 3.1.2 OT2: Mathematical problem solving
- OT2.1 Recognising the structure behind a problem
- OT2.2 Extended arguments for unstructured problems
- OT2.3 Interpreting solutions in the original context
- OT2.6 The problem-solving cycle
- OT2.7 Reading and drawing diagrams to solve problems
- 3.1.3 OT3: Mathematical modelling
- OT3.1 Turning a situation into a mathematical model
- OT3.2 Using a model to explore situations
- OT3.3 Interpreting model outputs in context
- OT3.4 Refining and evaluating models
- OT3.5 Modelling assumptions
3.2 Compulsory content
- 3.2.1 A: Proof
- A1 Proof by mathematical induction
- 3.2.2 B: Complex numbers
- B1 Solving polynomial equations with complex roots
- B2 Arithmetic with complex numbers
- B3 Complex conjugates and conjugate pairs of roots
- B4 Argand diagrams
- B5 Modulus-argument form of complex numbers
- B6 Multiplying and dividing in modulus-argument form
- B7 Loci in the Argand diagram
- 3.2.3 C: Matrices
- C1 Adding, subtracting and multiplying matrices
- C2 Zero and identity matrices
- C3 Matrices as linear transformations
- C4 Invariant points and lines
- C5 Determinants of 2 × 2 matrices
- C6 Singular matrices and inverse matrices
- 3.2.4 D: Further algebra and functions
- D1 Roots and coefficients of polynomial equations
- D2 Transforming the roots of a polynomial equation
- D3 Sums of integers, squares and cubes
- D4 Method of differences
- D6 Standard Maclaurin series and their validity
- D8 Cubic and quartic inequalities
- D9 Inequalities with rational expressions
- D12 Rational functions with linear numerator and denominator
- D13 Rational functions with quadratic numerator and denominator
- D14 Quadratic theory for ranges and stationary points of rational functions
- D15 Parabolas, ellipses and hyperbolas
- D16 Transformations of curves
- 3.2.5 E: Further calculus
- E2 Volumes of revolution
- E3 Mean value of a function
- 3.2.6 F: Further vectors
- F1 Equations of lines in three dimensions
- F3 Scalar product and the angle between two lines
- F4 Perpendicular vectors and the scalar product
- F6 Intersections and perpendicular distances
- 3.2.7 G: Polar coordinates
- G1 Polar coordinates
- G2 Sketching polar curves
- 3.2.8 H: Hyperbolic functions
- H1 Hyperbolic functions and their graphs
- H3 Inverse hyperbolic functions
- H4 Logarithmic forms of inverse hyperbolic functions
- H6 Hyperbolic identities
3.3 Optional application 1 – mechanics
- 3.3.1 MA: Dimensional analysis
- MA1 Dimensions and dimensional consistency
- MA2 Predicting formulae by dimensional analysis
- 3.3.2 MB: Momentum and collisions
- MB1 Conservation of momentum
- MB2 Coefficient of restitution and Newton’s experimental law
- MB3 Impulse and momentum
- MB4 Impulse of a variable force
- 3.3.3 MC: Work, energy and power
- MC1 Work done by a force
- MC2 Gravitational potential energy
- MC3 Kinetic energy
- MC4 Hooke’s law and modulus of elasticity
- MC5 Work done by a variable force
- MC6 Elastic potential energy
- MC7 Power
- 3.3.4 MD: Circular motion
- MD1 Motion in a circle at constant speed
- MD2 Angular speed
- MD3 Speed, angular speed, radius and acceleration
3.4 Optional application 2 – statistics
- 3.4.1 SA: Discrete random variables (DRVs) and expectation
- SA1 Discrete random variables
- SA2 Probabilities for a discrete random variable
- SA3 Averages and spread of a discrete random variable
- SA4 Expectation and variance formulae
- SA5 Expectation and variance of linear functions of a discrete random variable
- SA6 Discrete uniform distribution
- SA7 Proof of the discrete uniform mean and variance
- 3.4.2 SB: Poisson distribution
- SB1 Conditions for a Poisson model
- SB2 Poisson probabilities
- SB3 Mean and variance of a Poisson distribution
- SB4 Sums of independent Poisson distributions
- SB5 Hypothesis test for a Poisson mean
- 3.4.3 SC: Type I and Type II errors
- SC1 Type I and Type II errors
- 3.4.4 SD: Continuous random variables (CRVs)
- SD1 Probability density functions
- SD2 Probabilities over an interval
- SD3 Median and quartiles from a density function
- SD4 Mean and variance from a density function
- SD5 Expectation of functions of a continuous random variable
- SD8 Expectation and variance of sums of independent variables
- 3.4.5 SE: Chi squared tests for association
- SE1 Contingency tables
- SE2 The chi-squared statistic and degrees of freedom
- SE3 Expected frequencies greater than five
- SE4 Sources of association
- 3.4.6 SH: Confidence intervals
- SH1 Confidence intervals with known variance
- SH2 Confidence intervals from large samples
- SH3 Inferences from confidence intervals
3.5 Optional application 3 – discrete mathematics
- 3.5.1 DA: Graphs
- DA1 Language of graphs
- DA2 Eulerian, semi-Eulerian and Hamiltonian graphs
- DA3 Euler’s formula for planar graphs
- DA5 Complete and bipartite graphs, adjacency matrices and complements
- DA6 Simple graphs, simple-connected graphs and trees
- 3.5.2 DB: Networks
- DB1 Language of networks
- DB2 Spanning trees
- DB3 Route inspection
- DB4 Bounds for the travelling salesperson problem
- DB5 Refining network models
- 3.5.3 DC: Network flows
- DC1 Flow problems on directed networks
- DC2 Cuts and their values
- DC3 Maximum flow-minimum cut theorem
- DC4 Supersources and supersinks
- 3.5.4 DD: Linear programming
- DD1 Formulating constrained optimisation problems
- DD2 Graphical linear programming
- 3.5.5 DE: Critical path analysis
- DE1 Activity networks using activity-on-node
- DE2 Earliest and latest start and finish times
- DE3 Critical activities, critical paths and float
- DE4 Refining critical path models
- 3.5.6 DF: Game theory for zero-sum games
- DF1 Pay-off matrices
- DF2 Play-safe strategies and the value of a game
- DF3 Stable solutions of a game
- DF4 Dominated strategies
- DF5 Optimal mixed strategies
- 3.5.7 DG: Binary operations
- DG1 Binary operations
- DG2 Commutative binary operations
- DG3 Associative binary operations
- DG4 Cayley tables
- DG5 Identity elements
- DG6 Inverse elements