Question set
Olympiad Maths: Divisibility and Number Theory
Twenty olympiad questions on divisibility and number theory: divisibility rules, HCF and LCM, the Euclidean algorithm, primes and counting divisors, remainders and powers modulo n, last digits, linear Diophantine equations, and digit and parity arguments. Most have one correct option; four ask for a number and three have one or more correct options. Every question has a hint and a full worked solution.
- questions
- 20
- at your own pace
- Untimed
- marks
- 20
- right / wrong
- +1 / 0
questions
at your own pace
marks
right / wrong
At a glance
| Part | Questions | Marks |
|---|---|---|
| All questions | 20 | 20 |
13 with one correct option, 3 with one or more correct options, 4 with a number to type.
Marking
- Right answer: +1
- Wrong answer: 0, nothing taken away
- Left blank: 0
- One or more correct: only right options, but not all of them, earns part of the marks.
Time
No time limit: work at your own pace.
Topics
- Divisibility, HCF and LCM 14
- Exponents and Radicals 4
- Rational and Irrational Numbers 2
