AQA A-Level Further Maths 7367 specification checklist
AQA A-Level Further Maths 7367 specification checklist
0 of 119 subtopics ticked as confident
A1Proof by induction
0 of 2 confident- A1
Induction for series and sequences
- A1
Induction for divisibility and matrix powers
B1–B7Complex numbers (AS)
0 of 4 confident- B2
Complex number arithmetic
- B3
Complex conjugates and polynomial roots
- B4–B6
Argand diagrams and modulus-argument form
- B7
Loci in the Argand diagram
B8–B11Complex numbers (A2)
0 of 3 confident- B8
De Moivre's theorem
- B9
Exponential form of a complex number
- B10–B11
Roots of complex numbers and roots of unity
C1–C6Matrices (AS)
0 of 4 confident- C1–C2
Matrix arithmetic
- C3
Linear transformations
- C4
Invariant points and lines
- C5–C6
2x2 determinants and inverse matrices
C5–C11Matrices (A2)
0 of 5 confident- C5–C6
3x3 determinants and inverse matrices
- C7–C8
Solving simultaneous equations with matrices
- C9
Factorising determinants
- C10
Eigenvalues and eigenvectors
- C11
Diagonalisation of matrices
D1–D7Further algebra: roots, series and Maclaurin
0 of 6 confident- D1–D2
Roots and coefficients of polynomials
- D3
Summation of series
- D4
Method of differences with partial fractions
- D5
Maclaurin series of a function
- D6
Standard Maclaurin series
- D7
Limits using Maclaurin series and L'Hopital's rule
D8–D16Further algebra: inequalities and graphs
0 of 7 confident- D8–D9
Inequalities with polynomials and rational expressions
- D10–D11
Modulus of functions and reciprocal graphs
- D12
Rational function graphs
- D13
Oblique asymptotes of rational functions
- D15
Conic sections
- D16
Single transformations of curves
- D16
Composite transformations of curves
E1–E9Further calculus
0 of 5 confident- E1
Improper integrals
- E2–E3
Volumes of revolution and mean value
- E5–E6
Inverse trigonometric functions: differentiation and integration
Partial fractions and reduction formulae
- E7
Arc length and surface area of revolution
F1–F6Further vectors
0 of 7 confident- F1
Vector and Cartesian equations of lines
- F2
Vector and Cartesian equations of planes
- F3–F4
Scalar product and perpendicular vectors
- F3
Angles between planes and between lines and planes
- F5
Vector product
- F6
Intersection of lines and distances
- F6
Intersections and distances involving planes
G1–G3Polar coordinates
0 of 3 confident- G1
Polar and Cartesian coordinates
- G2
Sketching polar curves
- G3
Area enclosed by a polar curve
H1–H7Hyperbolic functions
0 of 6 confident- H1
Hyperbolic functions and their graphs
- H1
Domains, ranges and reciprocal hyperbolic functions
- H2
Calculus with hyperbolic functions
- H3–H4
Inverse hyperbolic functions
- H6
Basic hyperbolic identities
- H6–H7
Further hyperbolic identities and proofs
I1–I11Differential equations
0 of 6 confident- I1–I2
First order equations and integrating factors
- I4
Second order equations with constant coefficients
- I5
Particular integrals
- I7
Simple harmonic motion
- I8
Damped oscillations
- I9
Coupled first order equations
J1–J3Further numerical methods
0 of 2 confident- J1
Mid-ordinate and Simpson's rules
- J2–J3
Euler's methods for differential equations
MA1–MA2Further Mechanics 1: Dimensional analysis
0 of 1 confident- MA1–MA2
Dimensions and consistency
MB1–MB4Further Mechanics 1: Momentum and collisions
0 of 4 confident- MB1
Conservation of momentum
- MB1–MB3
Momentum, impulse and collisions requiring resolving
- MB2
Coefficient of restitution and collisions
- MB3–MB4
Impulse
MC1–MC7Further Mechanics 1: Work, energy and power
0 of 4 confident- MC1–MC3
Work done and energy
Hooke's law and elastic energy
Variable forces and power
Work and power with forces at an angle
MD1–MD6Further Mechanics 1: Circular motion
0 of 4 confident- MD1–MD3
Angular speed and circular motion
- MD4
Vectors in circular motion
- MD5
Conical pendulums
- MD6
Circular motion in a vertical plane
ME1–ME6Further Mechanics 1: Centres of mass and moments
0 of 3 confident- ME1–ME2
Centre of mass of particles and composite bodies
- ME3–ME4
Centre of mass by integration
- ME5–ME6
Equilibrium, sliding and toppling
SA1–SA7Further Statistics 1: Discrete random variables
0 of 4 confident- SA1–SA4
Distributions and expectation of DRVs
- SA5
Linear functions of a DRV
- SA5
Functions of a DRV
- SA6–SA7
Discrete uniform distribution
SB1–SB5Further Statistics 1: Poisson distribution
0 of 2 confident- SB1–SB3
Poisson model and probabilities
- SB4–SB5
Sums of Poisson variables and Poisson hypothesis tests
SC1–SC2Further Statistics 1: Type I and Type II errors
0 of 3 confident- SC1
Type I and Type II errors
- SC1
Type I errors for normal distribution tests
- SC2
Type II errors and power
SD1–SD8Further Statistics 1: Continuous random variables
0 of 6 confident- SD1–SD3
Probability density functions
- SD1
Part-discrete part-continuous distributions
- SD4–SD5
Mean and variance of a CRV
- SD6
Cumulative distribution functions
- SD7
Rectangular distribution
- SD8
Sums of independent random variables
SE1–SE5Further Statistics 2: Chi-squared tests
0 of 2 confident- SE1–SE4
Contingency tables and the chi-squared test
- SE5
Yates' correction
SF1–SF4Further Statistics 2: Exponential distribution
0 of 2 confident- SF1–SF2
Exponential distribution model, pdf and CDF
- SF3–SF4
Mean and variance, and link to Poisson processes
SG1–SH4Further Statistics 2: Confidence intervals and the t-distribution
0 of 3 confident- SG1
One-sample t-test
- SH1–SH3
Confidence intervals for a mean
- SH4
Confidence intervals from small samples
DA1–DA7Discrete Mathematics 1: Graphs
0 of 5 confident- DA1–DA2
Language and properties of graphs
- DA3
Euler's formula for planar graphs
- DA4
Kuratowski's theorem
- DA5–DA6
Special graphs
- DA7
Isomorphism of graphs
DB1–DB5Discrete Mathematics 2: Networks
0 of 2 confident- DB1–DB2
Spanning trees and network optimisation
- DB3–DB4
Route inspection and travelling salesperson
DC1–DC7Discrete Mathematics 3: Network flows
0 of 2 confident- DC1–DC3
Flows, cuts and the max-flow min-cut theorem
- DC4–DC7
Augmenting flows and refinements
DD1–DD4Discrete Mathematics 4: Linear programming
0 of 2 confident- DD1–DD2
Formulating and graphical solution of LPs
- DD3–DD4
The simplex algorithm
DE1–DE6Discrete Mathematics 5: Critical path analysis
0 of 2 confident- DE1–DE4
Activity networks and critical paths
- DE5–DE6
Gantt charts, resource histograms and levelling
DF1–DF6Discrete Mathematics 6: Game theory
0 of 3 confident- DF1–DF3
Pay-off matrices and play-safe strategies
- DF4–DF5
Dominance and mixed strategies
- DF6
Converting games to linear programming problems
DG1–DG12Discrete Mathematics 7: Binary operations and groups
0 of 5 confident- DG1–DG4
Binary operations and their properties
- DG5–DG6
Identity and inverses
- DG7–DG9
Groups
- DG10–DG11
Lagrange's theorem and generators
- DG12
Isomorphism of groups