This math topic focuses on calculating the number of distinct ways to order a set of three letters with no repetitions, and expressing the results in the form of a factorial notation. The problems helps to practice and understand the use of factorial function (n!) in probability scenarios specifically related to combinatorics, such as determining the total possible permutations of given items without any of them repeating. Each question on this topic presents a choice of factorial expressions, guiding learners to comprehend and apply factorial equations to solve real word permutation problems in probability.

Work on practice problems directly here, or download the printable pdf worksheet to practice offline.