Skip to main content
ExamCompass
Exam Compass LogoExamCompass
BlogFounderAppLogin

Exams

JEE Main & AdvancedNEET UGClass 12 BoardsClass 11 Boards

Categories

All ArticlesExam NotesRevision
Meet the FounderDownload Android & iOS AppLogin
HomeBlogPermutations And Combinations Class 11 Revision Notes Jee
Revision

Permutations And Combinations Class 11 Exam Prep Revision β€” CBSE 2026 Grandmaster Guide

A

Ayush (Founder)

Exam Strategist

Last Updated: 2026-06-01

πŸ“‘ Table of Contents

  1. Introduction to Permutations and Combinations
  2. What is Permutations and Combinations?
  3. The Fundamental Counting Principle and Permutations
  4. Combinations
  5. Applications of Permutations and Combinations
  6. Practice Problems and Solutions
  7. Conclusion
  8. πŸͺ€ The 5 Mistakes That Cost Marks
  9. πŸ” Last 5 Minutes Box

🎬 Watch video explanations on YouTube β†’


Introduction to Permutations and Combinations

Permutations and combinations are fundamental concepts in mathematics, particularly combinatorics. These concepts are essential for solving problems that involve arranging and selecting objects from a larger set. In this guide, we will the world of permutations and combinations, exploring their definitions, formulas, and applications, to help students prepare for their Class 11 exams.

What is Permutations and Combinations?

Permutations refer to the arrangement of objects in a specific order. For instance, if we have three letters: A, B, and C, the permutations of these letters are ABC, ACB, BAC, BCA, CAB, and CBA. On the other hand, combinations involve selecting objects from a larger set without considering the order. Using the same example, the combinations of the letters A, B, and C taken two at a time are AB, AC, and BC.

The Fundamental Counting Principle and Permutations

The fundamental counting principle states that if one event can occur in mmm ways and a second independent event can occur in nnn ways, then the events together can occur in mΓ—nm \times nmΓ—n ways. This principle is crucial for calculating permutations. For example, if we have nnn objects and want to find the number of permutations of these objects taken rrr at a time, we can use the formula: [ P(n, r) = \frac{n!}{(n-r)!} ] where n!n!n! represents the factorial of nnn, which is the product of all positive integers up to nnn. For instance, 5!=5Γ—4Γ—3Γ—2Γ—1=1205! = 5 \times 4 \times 3 \times 2 \times 1 = 1205!=5Γ—4Γ—3Γ—2Γ—1=120.

Combinations

Combinations, as mentioned earlier, involve selecting objects without considering the order. The formula for calculating combinations is: [ C(n, r) = \frac{n!}{r!(n-r)!} ] This formula gives us the number of ways to choose rrr objects from a set of nnn objects without regard to the order of selection.

Applications of Permutations and Combinations

Permutations and combinations have numerous applications in various fields, including mathematics, statistics, computer science, and engineering. They are used in problems involving arrangements, selections, and outcomes. For example, in statistics, combinations are used to calculate the number of possible outcomes when selecting a sample from a population.

Practice Problems and Solutions

To master permutations and combinations, it's essential to practice solving problems. Here are a few examples:

  1. Permutation Problem: Find the number of permutations of the letters A, B, C, and D.
  • Solution: Using the permutation formula P(n,r)=n!(nβˆ’r)!P(n, r) = \frac{n!}{(n-r)!}P(n,r)=(nβˆ’r)!n!​, where n=4n = 4n=4 and r=4r = 4r=4, we get P(4,4)=4!(4βˆ’4)!=4!=24P(4, 4) = \frac{4!}{(4-4)!} = 4! = 24P(4,4)=(4βˆ’4)!4!​=4!=24.
  1. Combination Problem: Find the number of combinations of 5 objects taken 3 at a time.
  • Solution: Using the combination formula C(n,r)=n!r!(nβˆ’r)!C(n, r) = \frac{n!}{r!(n-r)!}C(n,r)=r!(nβˆ’r)!n!​, where n=5n = 5n=5 and r=3r = 3r=3, we get C(5,3)=5!3!(5βˆ’3)!=5Γ—4Γ—33Γ—2Γ—1=10C(5, 3) = \frac{5!}{3!(5-3)!} = \frac{5 \times 4 \times 3}{3 \times 2 \times 1} = 10C(5,3)=3!(5βˆ’3)!5!​=3Γ—2Γ—15Γ—4Γ—3​=10.

Conclusion

Permutations and combinations are vital concepts in mathematics that help us solve problems involving arrangements and selections. By understanding the formulas and applications of these concepts, students can improve their problem-solving skills and perform well in their exams. Remember, practice is key to mastering permutations and combinations. With consistent effort and the right approach, anyone can become proficient in these areas.

πŸͺ€ The 5 Mistakes That Cost Marks

  • Forgetting to Apply the Formula for Permutations: A common mistake is not using the correct formula for permutations, which is given by nPr=n!(nβˆ’r)!nPr = \frac{n!}{(n-r)!}nPr=(nβˆ’r)!n!​, where nnn is the total number of items and rrr is the number of items being chosen.
  • Confusing Permutations with Combinations: Students often get confused between permutations and combinations, where order matters in permutations but not in combinations. The formula for combinations is nCr=n!r!(nβˆ’r)!nCr = \frac{n!}{r!(n-r)!}nCr=r!(nβˆ’r)!n!​.
  • Not Considering the Case of Repetition: When dealing with permutations or combinations of items where some items repeat, students often forget to account for this repetition, leading to incorrect calculations.
  • Incorrectly Calculating the Number of Ways to Arrange Items: A trap question might involve arranging items with certain restrictions, such as arranging people in a line with certain people always together or never together. Students must apply the correct principles to solve these problems.
  • Failing to Simplify Factorials and Expressions: Simplifying expressions involving factorials is crucial in permutations and combinations. Students should be careful to simplify expressions like n!(nβˆ’r)!\frac{n!}{(n-r)!}(nβˆ’r)!n!​ to n(nβˆ’1)(nβˆ’2)...(nβˆ’r+1)n(n-1)(n-2)...(n-r+1)n(nβˆ’1)(nβˆ’2)...(nβˆ’r+1) to avoid computational errors.

πŸ” Last 5 Minutes Box

Permutations

  • nPr = n! / (n-r)!
  • Permutation of and objects taken r at a time

Combinations

  • nCr = n! / (r!(n-r)!)
  • Combination of and objects taken r at a time

Important Formulas

  • n! = n * (n-1) * (n-2) * ... * 2 * 1
  • 0! = 1
  • nC0 = nCn = 1
  • nC1 = n
  • nCn-1 = n

Key Points

  • Permutation is an arrangement of objects in a specific order
  • Combination is a selection of objects without considering the order
  • Permutations and combinations are used to calculate the number of ways to arrange or select objects from a larger set

πŸ“š Related Topics

Continue your revision with these related guides:

  • πŸ“– Permutations Combinations Class 11 Mathematics Revision β€” JEE 2026 Grandmaster Guide
  • πŸ“– Equilibrium Class 11 Exam Prep Revision β€” CBSE 2026 Grandmaster Guide
  • πŸ“– Structure Of Atom Class 11 Exam Prep Revision β€” CBSE 2026 Grandmaster Guide
  • πŸ“– Relations And Functions Class 11 Exam Prep Revision β€” CBSE 2026 Grandmaster Guide
A

Made by Ayush Kumar

JEE Aspirant & Founder β€” KV Darbhanga

I'm a JEE Aspirant building Exam Compass to solve the "Black Box" problem of exam preparation. Every featureβ€”from the Neural Mock Engine to the Cognitive Decay Mapsβ€”exists because I needed a way to verify my readiness with mathematical certainty. This isn't just a platform; it's the infrastructure I built to win, and now it's open to every student in the trenches.

Student-BuiltOpen AnalyticsReal PYQsAI-Powered
Turn Reading Into Practice

Ready to test your knowledge?

Stop studying blindly. Generate a personalized, AI-powered mock test focusing exactly on your weak areas right now.

Try Exam Compass Free
ExamCompass

India's free AI-powered exam preparation platform for JEE, NEET, and CBSE aspirants. 9,000+ verified PYQs.

Competitive Exams

  • JEE Mains 2026
  • JEE Advanced 2026
  • NEET UG 2026

Board Exams

  • Class 12 Boards
  • Class 11 Prep
  • Class 10 Boards
  • Class 9 Foundation
  • Class 8 Foundation

Resources

  • Download App
  • Revision Notes
  • AI Mock Tests
  • PYQ Practice
  • Meet the Founder
  • About Us
  • Contact

Legal

  • Privacy Policy
  • Terms of Service

Exam Compass is India's free AI-powered exam preparation platform. Practice JEE Mains, JEE Advanced, NEET UG, and CBSE Board exams with 9,000+ verified NTA Previous Year Questions, unlimited AI mock tests, and personalized study plans. All free, forever.

Β© 2026 Exam Compass. All rights reserved.

Built with ❀️ in India by Ayush Kumar

Exam Compass
Premium Article β€’ blog.examcompass.dev
Empowering Students with AI-Driven Engineering.
Prepared for Scholar
Date: 2026-06-01
CATEGORY: Revision

πŸ“‘ Table of Contents

  1. Introduction to Permutations and Combinations
  2. What is Permutations and Combinations?
  3. The Fundamental Counting Principle and Permutations
  4. Combinations
  5. Applications of Permutations and Combinations
  6. Practice Problems and Solutions
  7. Conclusion
  8. πŸͺ€ The 5 Mistakes That Cost Marks
  9. πŸ” Last 5 Minutes Box

🎬 Watch video explanations on YouTube β†’


Introduction to Permutations and Combinations

Permutations and combinations are fundamental concepts in mathematics, particularly combinatorics. These concepts are essential for solving problems that involve arranging and selecting objects from a larger set. In this guide, we will the world of permutations and combinations, exploring their definitions, formulas, and applications, to help students prepare for their Class 11 exams.

What is Permutations and Combinations?

Permutations refer to the arrangement of objects in a specific order. For instance, if we have three letters: A, B, and C, the permutations of these letters are ABC, ACB, BAC, BCA, CAB, and CBA. On the other hand, combinations involve selecting objects from a larger set without considering the order. Using the same example, the combinations of the letters A, B, and C taken two at a time are AB, AC, and BC.

The Fundamental Counting Principle and Permutations

The fundamental counting principle states that if one event can occur in mmm ways and a second independent event can occur in nnn ways, then the events together can occur in mΓ—nm \times nmΓ—n ways. This principle is crucial for calculating permutations. For example, if we have nnn objects and want to find the number of permutations of these objects taken rrr at a time, we can use the formula: [ P(n, r) = \frac{n!}{(n-r)!} ] where n!n!n! represents the factorial of nnn, which is the product of all positive integers up to nnn. For instance, 5!=5Γ—4Γ—3Γ—2Γ—1=1205! = 5 \times 4 \times 3 \times 2 \times 1 = 1205!=5Γ—4Γ—3Γ—2Γ—1=120.

Combinations

Combinations, as mentioned earlier, involve selecting objects without considering the order. The formula for calculating combinations is: [ C(n, r) = \frac{n!}{r!(n-r)!} ] This formula gives us the number of ways to choose rrr objects from a set of nnn objects without regard to the order of selection.

Applications of Permutations and Combinations

Permutations and combinations have numerous applications in various fields, including mathematics, statistics, computer science, and engineering. They are used in problems involving arrangements, selections, and outcomes. For example, in statistics, combinations are used to calculate the number of possible outcomes when selecting a sample from a population.

Practice Problems and Solutions

To master permutations and combinations, it's essential to practice solving problems. Here are a few examples:

  1. Permutation Problem: Find the number of permutations of the letters A, B, C, and D.
  • Solution: Using the permutation formula P(n,r)=n!(nβˆ’r)!P(n, r) = \frac{n!}{(n-r)!}P(n,r)=(nβˆ’r)!n!​, where n=4n = 4n=4 and r=4r = 4r=4, we get P(4,4)=4!(4βˆ’4)!=4!=24P(4, 4) = \frac{4!}{(4-4)!} = 4! = 24P(4,4)=(4βˆ’4)!4!​=4!=24.
  1. Combination Problem: Find the number of combinations of 5 objects taken 3 at a time.
  • Solution: Using the combination formula C(n,r)=n!r!(nβˆ’r)!C(n, r) = \frac{n!}{r!(n-r)!}C(n,r)=r!(nβˆ’r)!n!​, where n=5n = 5n=5 and r=3r = 3r=3, we get C(5,3)=5!3!(5βˆ’3)!=5Γ—4Γ—33Γ—2Γ—1=10C(5, 3) = \frac{5!}{3!(5-3)!} = \frac{5 \times 4 \times 3}{3 \times 2 \times 1} = 10C(5,3)=3!(5βˆ’3)!5!​=3Γ—2Γ—15Γ—4Γ—3​=10.

Conclusion

Permutations and combinations are vital concepts in mathematics that help us solve problems involving arrangements and selections. By understanding the formulas and applications of these concepts, students can improve their problem-solving skills and perform well in their exams. Remember, practice is key to mastering permutations and combinations. With consistent effort and the right approach, anyone can become proficient in these areas.

πŸͺ€ The 5 Mistakes That Cost Marks

  • Forgetting to Apply the Formula for Permutations: A common mistake is not using the correct formula for permutations, which is given by nPr=n!(nβˆ’r)!nPr = \frac{n!}{(n-r)!}nPr=(nβˆ’r)!n!​, where nnn is the total number of items and rrr is the number of items being chosen.
  • Confusing Permutations with Combinations: Students often get confused between permutations and combinations, where order matters in permutations but not in combinations. The formula for combinations is nCr=n!r!(nβˆ’r)!nCr = \frac{n!}{r!(n-r)!}nCr=r!(nβˆ’r)!n!​.
  • Not Considering the Case of Repetition: When dealing with permutations or combinations of items where some items repeat, students often forget to account for this repetition, leading to incorrect calculations.
  • Incorrectly Calculating the Number of Ways to Arrange Items: A trap question might involve arranging items with certain restrictions, such as arranging people in a line with certain people always together or never together. Students must apply the correct principles to solve these problems.
  • Failing to Simplify Factorials and Expressions: Simplifying expressions involving factorials is crucial in permutations and combinations. Students should be careful to simplify expressions like n!(nβˆ’r)!\frac{n!}{(n-r)!}(nβˆ’r)!n!​ to n(nβˆ’1)(nβˆ’2)...(nβˆ’r+1)n(n-1)(n-2)...(n-r+1)n(nβˆ’1)(nβˆ’2)...(nβˆ’r+1) to avoid computational errors.

πŸ” Last 5 Minutes Box

Permutations

  • nPr = n! / (n-r)!
  • Permutation of and objects taken r at a time

Combinations

  • nCr = n! / (r!(n-r)!)
  • Combination of and objects taken r at a time

Important Formulas

  • n! = n * (n-1) * (n-2) * ... * 2 * 1
  • 0! = 1
  • nC0 = nCn = 1
  • nC1 = n
  • nCn-1 = n

Key Points

  • Permutation is an arrangement of objects in a specific order
  • Combination is a selection of objects without considering the order
  • Permutations and combinations are used to calculate the number of ways to arrange or select objects from a larger set

πŸ“š Related Topics

Continue your revision with these related guides:

  • πŸ“– Permutations Combinations Class 11 Mathematics Revision β€” JEE 2026 Grandmaster Guide
  • πŸ“– Equilibrium Class 11 Exam Prep Revision β€” CBSE 2026 Grandmaster Guide
  • πŸ“– Structure Of Atom Class 11 Exam Prep Revision β€” CBSE 2026 Grandmaster Guide
  • πŸ“– Relations And Functions Class 11 Exam Prep Revision β€” CBSE 2026 Grandmaster Guide