Difficulty Verdict
This paper is a classic FP1 examination: highly predictable in its structure and topics, but testing algebraic endurance and precision. While early questions on matrices and numerical methods are highly accessible, the latter part of the paper features challenging analytical geometry on parabolas and hyperbolas, as well as rigorous proof questions that will stretch candidates aiming for an A*.
Where the Marks Are
The majority of the marks reside in Coordinate Systems (17 marks) and Matrix Transformations (11 marks). Proof by Mathematical Induction (10 marks) also represents a significant portion of the paper, split equally between a matrix induction and a second-order recurrence sequence induction.
Examiner Pitfalls & Challenges
- Matrix Determinants: In Question 1(b), many candidates lose marks by simply stating that the matrix is non-singular because the determinant is "not zero." To gain full credit, a rigorous justification—such as calculating a negative discriminant or completing the square to show that \( p^2 + 2p + 3 > 2 \) for all real \( p \)—is required.
- Fractional Power Differentiation: In Question 2(b), simplifying and differentiating \( \frac{7x - 4\sqrt{x}}{x^3} \) leads to algebraic slips, particularly with negative fractional indices like \( -4x^{-2.5} \).
- Coordinate Geometry Distances: In Question 6(b), candidates frequently fail to account for the modulus when working with coordinate distances/areas, neglecting the negative coordinate solutions and providing only one pair of coordinates for point \( P \) instead of both.
- Strict Inductive Logic: For the recurrence relation induction in Question 8(ii), failing to assume the result for both \( n=k \) and \( n=k+1 \) severely penalizes candidates' proof structures.
Preparation & Exam Strategy
To master future papers, candidates must practice algebraic speed and rigor. Success on FP1 depends on securing easy marks quickly in numerical methods and basic matrix algebra, allowing ample time to set up and solve the multi-step geometric locus equations in coordinate systems.