Permutations and Combinations

6.1 Introduction

This introductory section presents a practical problem involving a suitcase with a number lock having 4 wheels, each labelled with digits from 0 to 9. The lock opens only if 4 specific digits are arranged in a particular sequence without repetition. The problem posed is: if only the first digit (7) is remembered, how many sequences of the remaining 3 digits must be checked to open the lock? Listing all possible arrangements manually is tedious due to the large number of possibilities. This motivates the need for counting techniques that allow us to determine the number of arrangements or selections without explicit enumeration. The chapter aims to introduce these fundamental counting methods, starting with the Fundamental Principle of Counting, which forms the basis for permutations and combinations. The historical note mentions Jacob Bernoulli, a pioneer in the formal study of permutations and combinations.

• Problem of counting sequences in a number lock with 4 wheels and digits 0-9.
• Need for systematic counting techniques to avoid tedious listing.
• Counting arrangements without repetition is the core problem.
• Introduction to Fundamental Principle of Counting as a foundation.
• Historical reference to Jacob Bernoulli's contribution.
• Sets the stage for permutations and combinations study.
• 📌 Permutation: arrangement of objects in a definite order.
• 📌 Combination: selection of objects where order does not matter.

6.2 Fundamental Principle of Counting

This section introduces the Fundamental Principle of Counting, also known as the multiplication principle. It states that if one event can occur in m ways and a subsequent event can occur in n ways, then the total number of ways both events can occur in sequence is m × n. This principle generalizes to any finite number of successive events, where the total number of outcomes is the product of the number of ways each event can occur. Two illustrative problems are presented: Mohan choosing pants and shirts, and Sabnam choosing school bags, tiffin boxes, and water bottles. The section explains how to count the total number of possible pairs or triplets by multiplying the number of choices at each step. Several examples demonstrate the application of this principle to counting arrangements of letters, flags, and digits with or without repetition. The principle is fundamental to understanding permutations and combinations, as it provides a systematic way to count complex arrangements by breaking them down into simpler successive choices.

• Fundamental Principle of Counting states total ways = product of ways of successive events.
• If event 1 can occur in m ways and event 2 in n ways, total ways = m × n.
• Generalizes to multiple events: total ways = m × n × p × ...
• Illustrated by examples of choosing pants and shirts, and school bags, tiffin boxes, water bottles.
• Applied to counting arrangements of letters and digits with/without repetition.
• Foundation for permutations and combinations.
• 📌 Multiplication Principle: counting principle for successive events.
• 📌 Event: an occurrence or choice in a counting problem.