Ch 6Permutations and Combinations — Class 11 Applied Mathematics, concept-first.

This concept map shows how the chapter fits together. Counting problems split into permutations (arrangements, where order matters) — resting on the factorial and the fundamental principle of counting…

We often need to count the number of ways to arrange or select objects without actually listing every possibility.

The factorial is one of the simplest yet most powerful tools in counting. It compactly represents the number of ways to arrange a set of distinct objects in a line — the very foundation of permutation…

Counting is easy when you just list things out, but the moment the numbers get large, you need a smarter way.

We now move from simply counting arrangements to a precise way of describing them. A permutation is any ordered arrangement of a set of objects — changing the order gives a different permutation.

When objects are arranged in a circle, the usual idea of a "first" position vanishes — rotating the entire circle gives the same arrangement.

When objects are not all distinct or when certain positions are reserved, the number of arrangements changes.

We now turn to the problem of counting selections where the order of the chosen items does not matter — a combination.

When items are chosen from a set and repetition is allowed, the number of ways to select them changes dramatically — a single type can be picked multiple times.

This section brings together problems that don't fit neatly into the earlier categories — they test your ability to think flexibly about arrangements and selections.

This miscellaneous exercise pulls together every counting tool from the chapter — the factorial , the fundamental principle of counting, permutations (including circular and restricted arrangements),…