Modular Arithmetic in IOQM: previous year question analysis
Modular Arithmetic has appeared 9 times in IOQM between 2013 and 2025, making it the 11th most-asked of 14 chapters and about 2.5% of the bank. Over the last 5 years it has averaged 1.4 questions per year.
Total PYQs
9
Years covered
2013–2025
Weightage rank
#11 of 14
Share of bank
2.5%
How many Modular Arithmetic questions appeared each year
| Year | Questions | Relative volume |
|---|---|---|
| 2013 | 1 | |
| 2015 | 1 | |
| 2017 | 1 | |
| 2018 | 1 | |
| 2019 | 1 | |
| 2024 | 2 | |
| 2025 | 2 |
Which Modular Arithmetic sub-topics are asked most
Every question in this chapter is tagged to a sub-topic, so you can see exactly where the marks sit before you revise.
- residue classes mod 15 and colour classes1 questions
- remainders mod 37 of structured four-digit numbers1 questions
- Fermat's little theorem, universal divisibility1 questions
- CRT search over remainder sets1 questions
- divisibility of $n(n+1)/2$ by 3, partition feasibility1 questions
- last two digits / powers mod 1001 questions
- distinct residues of fourth powers1 questions
- period of $n^n \bmod 7$1 questions
- periodicity of 2^n and n^2 mod 71 questions
Question formats used in Modular Arithmetic
- Numerical / integer answer9
How Modular Arithmetic compares with nearby chapters
- #9Sequences & Series16
- #10Inequalities12
- #11Modular Arithmetic9
- #12Functional Equations6
- #13Graphs, Games & Sets6
Counts are computed from AcadXL’s own IOQM question bank, tagged chapter- and sub-topic-wise and checked against official answer keys. Sign in to attempt the 9 Modular Arithmetic questions with solutions.