Class 11 Mathematics — Chapter 6: PERMUTATIONS AND COMBINATIONS
Chapter 6: PERMUTATIONS AND COMBINATIONS is a chapter in Class 11 Mathematics (NCERT), part of the CBSE NCERT curriculum followed by over 25 million students across India. This chapter covers 6 topics including Fundamental Principle of Counting (Multiplication Principle), Solving Counting Problems without Repetition, Solving Counting Problems with Repetition. BrainWeave provides free AI-powered explanations — by voice or text, in Hindi or English — with no signup required.
What you'll learn
-
▸Fundamental Principle of Counting (Multiplication Principle)Core conceptMultiplication Principlecounting techniquessuccessive eventstotal number of occurrences
-
▸Solving Counting Problems without RepetitionCore conceptwithout repetitionrepetition is not alloweddistinct objectsno repetition
-
▸Solving Counting Problems with RepetitionCore conceptwith repetitionrepetition is allowedcan be repeatedreplacement
-
▸Solving Counting Problems with ConstraintsCore conceptconstraintsconditionseven numbersstarts withspecific requirements
-
▸Addition Principle for Countingat leasteither/orsum of possibilitiesmutually exclusive cases
-
▸Introduction to PermutationsCore conceptpermutationarrangementdefinite orderorder matters
Chapter Summary
Understanding the core concept that if one event can occur in 'm' ways and a second event can occur in 'n' ways, then the total number of ways both events can occur in order is m × n. This principle can be extended to any finite number of events.
Applying the Fundamental Principle of Counting to scenarios where objects or digits cannot be reused. For each subsequent choice, the number of available options decreases.
Applying the Fundamental Principle of Counting to scenarios where objects or digits can be used multiple times. The number of available options remains the same for each choice.
Developing strategies to solve problems that have specific conditions, such as forming an even number or a number starting with a specific digit. This often involves filling the constrained position first.
Understanding how to calculate the total number of outcomes when there are multiple mutually exclusive cases. This involves calculating the possibilities for each case separately and then adding them together, as seen in the 'at least 2 flags' example.
Defining a permutation as an arrangement of a number of objects in a definite order. Understanding that in permutations, the order of the objects matters.
Practice Questions from this Chapter
Tap "Get Solution" on any question to ask our AI tutor.
- Explain counting principle simply. Get Solution →
- Give real-world permutation examples. Get Solution →
- Find all arrangements of letters. Get Solution →
- What is the fundamental principle of counting also known as? Get Solution →
- According to Definition 1, what is a permutation? Get Solution →
- What is the defined value of 0! (zero factorial)? Get Solution →
- In the example problem from the text, how many pants and shirts does Mohan have? Get Solution →
- What does the notation n! represent? Get Solution →
Did you know?
- 💡 There are more ways to shuffle a deck of cards than atoms on Earth.
- 💡 Lock 'combinations' are actually permutations because order matters for opening.
- 💡 A standard Rubik's Cube has over 43 quintillion possible arrangements.
- 💡 License plates use number and letter arrangements to create unique identifiers.
- 💡 There are nearly 7 quintillion unique ways to solve a Sudoku puzzle.
Frequently Asked Questions
How many topics are covered in this chapter?
This chapter covers 6 key topics: Fundamental Principle of Counting (Multiplication Principle), Solving Counting Problems without Repetition, Solving Counting Problems with Repetition, Solving Counting Problems with Constraints, Addition Principle for Counting, and more. The BrainWeave AI tutor explains each one with examples.
Is Chapter 6: PERMUTATIONS AND COMBINATIONS important for board exams?
Class 11 is a foundation year. Mastering this chapter now will help you build strong fundamentals for the higher classes.
Can I get NCERT solutions for this chapter in Hindi?
Yes. BrainWeave's AI tutor supports Hindi, English, and Hinglish for both voice and text chat. Just ask your question in your preferred language.
Is BrainWeave free for Class 11 - Science?
Yes. BrainWeave's free Spark plan gives generous daily messages — enough for regular homework. Premium features unlock when you bring your own free Google Gemini API key.
Can I use voice chat for this chapter?
Absolutely. Tap the mic, ask any question about Chapter 6: PERMUTATIONS AND COMBINATIONS, and the AI tutor will explain it back in voice and text.
How is BrainWeave better than static NCERT solutions sites?
Static solution sites give the same answer to everyone. BrainWeave adapts to your question — ask "explain like I'm 12" or "give a real-world example" and get a personalized response. Voice mode and Hindi support work seamlessly.
Related Chapters
Ask Any Question About Chapter 6: PERMUTATIONS AND COMBINATIONS
Voice or text. Hindi or English. Free to start. No signup required.
Start Now →