CourseCourseConceptConceptDocumentDocument

CAIE IGCSE Additional Math 11.3 Solve Arrangement and Selection Problems Questions

Practise Cambridge IGCSE Additional Mathematics by counting arrangements, selections, passwords, teams and committees under exact restrictions.

Syllabus
2028–2030
Course
Additional Mathematics 0606

Exam points

  • Count arrangements and selections using permutations, combinations and multiplication principles.
  • Handle restrictions such as adjacency, fixed positions, repeated categories, parity and divisibility.
  • Form complementary or case-based counts and report the valid integer total.

CAIE IGCSE Additional Math 11.3 Solve Arrangement and Selection Problems Questions question 1

[Maximum number: 5]

A 6-character password is to be formed from the following characters.

Letters bfgkm\mathrm{b} \quad \mathrm{f} \quad \mathrm{g} \quad \mathrm{k} \quad \mathrm{m}

Numbers 3259

Symbols * ! @

Each character can be used at most once in any 6-character password.

Question (a)

(a)

Find the number of 6-character passwords that can be formed if there are no further restrictions.

[ 1 ]

Question (b)

(b)

Find the number of 6-character passwords that can be formed if the password starts and ends with a symbol.

[ 2 ]

Question (c)

(c)

Find the number of 6-character passwords that can be formed if the password:
- starts with either a symbol and then a number, or a number and then a symbol and
- ends with 2 letters.

[ 2 ]
All question bank results loaded