Mathematics Permutations and Combinations JEE Syllabus

Permutations and Combinations is a key topic in Class 11 Mathematics that focuses on systematic counting techniques used to determine the number of possible arrangements and selections. Instead of listing outcomes manually, this chapter develops mathematical tools to calculate them efficiently using rules and formulas.

The chapter begins with the Fundamental Principle of Counting, which forms the base for all counting techniques. It then introduces factorial notation, which is essential for simplifying expressions involving arrangements. Building on this, the topic covers permutations of distinct objects and repeated objects, where order plays an important role in arranging elements.

Fundamental Principle of Counting

The Fundamental Principle of Counting is the basic rule used to calculate the total number of possible outcomes when a task is completed in multiple stages. Instead of listing every possibility manually, this principle helps us find the total number of outcomes by multiplying the number of choices available at each stage. It forms the foundation of Permutations and Combinations and is used in almost every counting problem.

m × n ways

Permutations

Permutations deal with the arrangement of objects where the order of arrangement is important. Whenever changing the position of objects creates a new arrangement, the concept of Permutations is used. Questions involving seating arrangements, word formation, ranking, and ordering are based on permutations.

Factorial Notation

Factorial notation is a mathematical shortcut used to represent the product of consecutive natural numbers. It simplifies permutation and combination formulas and is one of the most frequently used concepts in counting techniques.

n! = 1 × 2 × 3 × ... × n

Permutations of Distinct Objects

This concept is included under the study of arrangements where all the objects involved are different from each other. In such cases, every possible arrangement results in a unique outcome because no two objects are identical. The formula for permutations of distinct objects is used to calculate the total number of arrangements efficiently without listing them one by one.

nPr = n! / (n − r)!

Permutations of Repeated Objects

Sometimes, all objects are not different. When identical objects are present, some arrangements become indistinguishable. In such cases, the ordinary permutation formula gives repeated counts, so a modified formula is used.

Combinations

Combinations are used when objects are selected rather than arranged. In combinations, only the selection matters and the order of selection has no importance. Team selection, committee formation, and group selection problems are based on combinations.

Difference Between Permutations and Combinations

Although both concepts are used for counting, the key difference lies in whether order matters or not. Understanding this distinction is essential for choosing the correct formula in examinations.

Permutation: Order is important.

Combination: Order is not important.

Formula for Combinations

The number of combinations of n objects taken r at a time is:

nCr = n! / [r!(n−r)!]

Relationship Between Permutation and Combination

A permutation is simply a combination arranged in different orders.

Therefore:

nPr = nCr × r!

or

nCr = nPr / r!

This relationship is extremely useful in solving counting problems.

Key Formulas to Remember

Permutations and Combinations formulas form the foundation of counting-based problems in JEE Mathematics. A strong grasp of these formulas helps in solving questions quickly, accurately, and with minimal calculations during the exam.