Counting & Arrangements in IOQM: previous year question analysis

Counting & Arrangements has appeared 56 times in IOQM between 2012 and 2025, making it the 1st most-asked of 14 chapters and about 15.7% of the bank. Over the last 5 years it has averaged 6.8 questions per year.

Total PYQs
56
Years covered
2012–2025
Weightage rank
#1 of 14
Share of bank
15.7%

How many Counting & Arrangements questions appeared each year

Counting & Arrangements IOQM question count by year
YearQuestionsRelative volume
20131
20141
20152
20161
20173
20187
20195
20213
20228
20239
20243
202511

Which Counting & Arrangements 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.

  • derangements, exactly-k fixed points1 questions
  • greatest integer function, counting integer solutions1 questions
  • counting pairs by colour1 questions
  • counting subset pairs by complementary counting1 questions
  • choosing pairs of vertices1 questions
  • double counting pairs (bipartite degree sum)1 questions
  • multinomial coefficient extraction1 questions
  • arrangements with adjacency restrictions1 questions
  • counting triples under a polygon inequality1 questions
  • ordered factorisations via distribution of prime exponents1 questions

Question formats used in Counting & Arrangements

  • Numerical / integer answer56

How Counting & Arrangements compares with nearby chapters

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 56 Counting & Arrangements questions with solutions.