Combinatorics and Counting Principles for Exam P

The Multiplication and Addition Principles

Counting problems on Exam P rely on two foundational rules. The multiplication principle states that if one task can be performed in m ways and a second independent task in n ways, then the two tasks together can be performed in m * n ways. The addition principle says that if there are m ways to do one thing and n ways to do another mutually exclusive thing, the total number of ways is m + n.

For example, if an insurance company offers 4 types of auto policies and 3 types of home policies, the number of ways a customer can choose one auto and one home policy is 4 * 3 = 12. If instead the customer wants exactly one policy of either type, the answer is 4 + 3 = 7.

Permutations and Combinations

A permutation counts ordered arrangements: P(n, k) = n! / (n - k)!. A combination counts unordered selections: C(n, k) = n! / (k!(n - k)!). On Exam P, combinations appear far more frequently because insurance pools and risk groups typically care about which items are selected, not the order of selection.

A common exam pattern asks: "In how many ways can 3 claims be selected from 10 for audit?" The answer is C(10, 3) = 120. If the question instead asks how many ways to rank those 3 claims by severity, the answer is P(10, 3) = 720.

Partitions and the Multinomial Coefficient

When dividing n objects into groups of sizes n1, n2, ..., nk, the multinomial coefficient n! / (n1! * n2! * ... * nk!) gives the number of ways. This arises on Exam P when categorizing policyholders or distributing claims across adjusters. For instance, assigning 12 claims among 3 adjusters with 4 each gives 12! / (4! * 4! * 4!) = 34,650 arrangements.