Mark scheme (whole question; this part is marked with the orange bar)

Examiner's comment
The use of the Euclidean algorithm to find the highest common factor and of back substitution to find the Bezout’s identity was well carried out by all the prepared students and nearly all gained full marks in part (i) of this question. The only ones who did not were clearly unprepared for the paper and did not make much progress in any question, often leaving questions unanswered. Part (ii) was less successfully completed, though the majority of students did gain full marks for the whole question. However, a few did not know how to proceed for this part who had completed part (i) successfully, while a couple had the correct method but made a slip during the processing and obtained an incorrect remainder. The replacement of 179 by its congruence modulo 11 was done correctly in such instances, with the errors coming from attempts to find the 5th power of the reduced equation.
Key points from the mark scheme and examiner's report
- 105 = 4 × 24 + 9, 24 = 2 × 9 + 6, 9 = 1 × 6 + 3, 6 = 2 × 3
- h = 3
- well done by prepared students



