Question set
Ten questions on the HCF and the LCM, the Euclidean algorithm, Bezout's identity and the number and sum of divisors. Untimed.
At a glance
| Part | Questions | Marks |
|---|---|---|
| All questions | 10 | 10 |
Marking
Time
No time limit: work at your own pace.
Syllabus covered
One chapter