Brand Logo
Login
Search
Brand Logo

Edzy for Classes 6-12

Edzy is a personal AI tutor for CBSE and State Board students, with curriculum-aligned guidance, practice, revision, and study plans that adapt to each learner.

  • Email: always@edzy.ai
  • Phone: +91 96256 68472
  • WhatsApp: +91 96256 68472
  • Address: Sector 63, Gurgaon, Haryana

Follow Edzy

Browse by Class

  • CBSE Class 6
  • CBSE Class 7
  • CBSE Class 8
  • CBSE Class 9
  • CBSE Class 10
  • CBSE Class 11
  • CBSE Class 12
Explore the CBSE resource hub

Explore Edzy

  • About Us
  • Why We Built Edzy
  • Search Learning Resources
  • Blog
  • CBSE News & Updates
  • Contact Us
  • CBSE AI Tutor
  • CBSE Resource Hub

Support & Legal

  • Help & FAQs
  • Accessibility
  • Privacy Policy
  • Terms & Conditions
  • Refund Policy
  • Cookie Policy
  • Site Directory

© 2026 Edzy. All rights reserved.

Curriculum-aligned learning paths for students in Classes 6-12.

Chapter Hub

Permutations and Combinations

This chapter explores the fundamental concepts of permutations and combinations, essential for solving problems related to counting and arrangement in mathematics.

Summary, practice, and revision
CBSE
Class 11
Mathematics
Mathematics

Permutations and Combinations

Chapter Summary

Playing 00:00 / 00:00

Download NCERT Chapter PDF for Permutations and Combinations – Latest Edition

Access Free NCERT PDFs & Study Material on Edzy – Official, Anytime, Anywhere

Live Challenge Mode

Ready to Duel?

Challenge friends on the same chapter, answer fast, and sharpen your concepts in a focused 1v1 battle.

NCERT-aligned questions
Perfect for friends and classmates

Why start now

Quick, competitive practice with instant momentum and zero setup.

More about chapter "Permutations and Combinations"

In the chapter on Permutations and Combinations, students learn various methods for calculating the number of ways to arrange and select items. Beginning with practical examples such as opening a number lock and choosing outfits, the chapter emphasizes the fundamental principle of counting. It explains permutations—arrangements where order matters—and combinations—selections where order does not matter. Key concepts such as factorial notation and techniques for dealing with distinct and indistinct objects are introduced, along with examples and exercises to reinforce understanding. The chapter culminates with applications in real-world scenarios, helping students grasp these mathematical tools for further studies.
Learn Better On The App
Free learning flow

Learn Without Limits

Access NCERT content for free with a cleaner, faster way to revise every day.

Chapter summaries
Revision tools

Faster access to practice, revision, and daily study flow.

Edzy mobile app preview

Permutations and Combinations - Class 11 Mathematics Chapter

Explore the concepts of permutations and combinations to master counting techniques in mathematics, particularly useful for Class 11 students.

A permutation is an arrangement of a set of objects in a definite order. For example, the arrangements of the letters in the word 'ROSE' yield different permutations such as 'ROSE', 'REOS', etc. Permutations focus on the order, meaning 'ABC' and 'CAB' are considered different.
A combination refers to a selection of items where the order does not matter. For instance, the combinations of choosing 2 letters from 'ABCD' are 'AB', 'AC', 'AD', 'BC', 'BD', and 'CD'. Here, 'AB' is the same as 'BA', emphasizing that order is not important.
The fundamental principle of counting states that if an event can happen in 'm' ways and is followed by another independent event that can occur in 'n' ways, then the total number of ways both events can happen in succession is 'm × n'. This principle helps simplify calculations in permutations and combinations.
To calculate permutations of 'n' distinct objects taken 'r' at a time, use the formula nPr = n! / (n-r)!. This formula effectively counts all possible arrangements by considering the different positions the objects could occupy.
Factorial notation, represented as 'n!', denotes the product of all positive integers up to 'n'. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. Factorials are commonly used in permutations and combinations to simplify calculations.
Problems related to arrangements, such as seating people in a row, creating passwords, or organizing events can be solved using permutations. The focus is on scenarios where the order of arrangement is crucial.
Combinations are used in situations like forming committees, selecting teams, or creating combinations of ingredients. Order does not affect the outcome, making combinations suitable for these contexts.
An example of a permutation problem is determining the number of ways to arrange 4 books on a shelf. If the books are labeled A, B, C, and D, the number of arrangements (4!) is 24 (A,B,C,D), (A,B,D,C), etc.
The number of ways to select 'r' items from 'n' without regard to order is calculated using the combination formula nCr = n! / (r!(n-r)!). For example, selecting 2 fruits from 5 different types is computed as 5C2.
Understanding the difference between permutations (order matters) and combinations (order does not matter) is crucial in problem-solving. It helps in applying the correct mathematical approach to count arrangements or selections accurately.
When repetition of items is allowed, the formula for permutations changes. Instead of nPr, which does not allow repeats, you use n^r, where 'n' is the number of items and 'r' is how many are chosen. For example, if choosing 3 items from 5 with repeats, the count is 5^3 = 125.
If there are indistinguishable items, you adjust the combination formula to account for identical items. For example, the word 'BANAANAS' has repeating letters, and the number of combinations can be calculated using a modified factorial approach, like counting distinct permutations.
In statistics, combinations are used to determine probabilities and outcomes when the order of selection does not matter. For example, calculating the likelihood of drawing a specific number of red cards from a deck relies on combination calculations.
Yes, many problems require both. For example, if you need to select a committee of 5 from 10 people (combinations) and arrange that committee for a presentation (permutations), you would first calculate the combinations, then use that result in permutations.
To avoid errors, it helps to clearly identify whether the problem involves permutations (order matters) or combinations (order does not matter) before applying the respective formulas. Carefully analyze all constraints such as repetition and ensure proper labeling.
Numerous educational apps and software programs provide interactive tools and simulations for practicing permutations and combinations. Such resources help visualize concepts and reinforce understanding through practice problems.
When dealing with indistinguishable objects, one must account for the repetitions in their calculations. Formulas for permutations and combinations are adjusted to reduce the count by dividing by the factorial of the number of indistinguishable items.
In computer science, these concepts help optimize algorithms, manage data ordering, and evaluate complexity. For instance, calculating possible states in databases or evaluating potential configurations in programming relies on combinatorial logic.
Engaging activities include solving puzzles such as Sudoku, arranging objects for photos, or playing card games where counting outcomes is vital. These activities help apply the concepts interactively!
Understanding permutations and combinations is fundamental in mathematics as they form the basis for counting principles, probability theory, and are widely applicable in real-life scenarios from statistical analysis to everyday decision-making.
The history of permutations and combinations includes significant contributions from ancient civilizations, notably in Jain mathematics and later formal developments in Europe by figures like Jacob Bernoulli. Their applications and theorems laid the groundwork for modern combinatorics.
To tackle word arrangement problems, first identify if letters are unique or repeated. Use factorial formulas for unique arrangements and modify for repeated letters by reducing counts accordingly, then apply necessary permutations or combinations formulas.
Begin by thoroughly understanding the problem's requirements. Identify if order matters (permutation) or if only selection is needed (combination). Settle on constraints like repetitions, then employ corresponding mathematical formulas.

Chapters related to "Permutations and Combinations"

Sets

This chapter introduces the concept of sets, their significance, and basic operations in mathematics.

Start chapter

Relations and Functions

This chapter explores the concepts of relations and functions in mathematics, focusing on how to connect pairs of objects from different sets and the significance of functions in describing these relationships.

Start chapter

Trigonometric Functions

This chapter introduces trigonometric functions, explaining their definitions, properties, and applications. Understanding these concepts is essential for solving various mathematical problems and real-world applications.

Start chapter

Complex Numbers and Quadratic Equations

This chapter introduces complex numbers and their relation to quadratic equations, emphasizing their significance in solving equations without real solutions.

Start chapter

Linear Inequalities

This chapter explores linear inequalities in one and two variables, explaining their significance in various real-world applications.

Start chapter

Binomial Theorem

This chapter introduces the binomial theorem, which simplifies the expansion of binomials raised to a power. It is essential for efficiently calculating powers without repeated multiplication.

Start chapter

Sequences and Series

This chapter discusses sequences, which are ordered lists of numbers, and their importance in mathematics. It covers different types of sequences and series, including arithmetic and geometric progressions, and their applications.

Start chapter

Straight Lines

This chapter explores the properties and equations of straight lines in coordinate geometry, emphasizing their significance in mathematics and real-life applications.

Start chapter

Conic Sections

This chapter explores conic sections including circles, ellipses, parabolas, and hyperbolas, highlighting their definitions and significance in mathematics and real-world applications.

Start chapter

Introduction to Three Dimensional Geometry

This chapter introduces the essential concepts of three dimensional geometry, focusing on how to represent points in space using coordinate systems.

Start chapter

Permutations and Combinations Summary, Important Questions & Solutions | All Subjects

Question Bank

Worksheet

Revision Guide

Formula Sheet