Permutations and Combinations - Formulae | Don't Memorise | GMAT/CAT/Bank PO/SSC CGL

TL;DR

This content explains the concepts of permutations and combinations and provides formulae to solve related problems.

Transcript

We have seen more than 10 problems based on permutations and combinations. And we have used logic to solve all of those. Once we understand the logic, there is no harm in using the formulae, which we will see in this session. We know that permutation is about arranging things. And combination is about selecting things. But we need to get a deeper u... Read More

Key Insights

• 🪈 Permutations involve arranging items in a specific order, while combinations focus on selecting items without considering the order.
• 🧑‍🏭 Permutations consider the order as a significant factor, while combinations do not.
• 😀 The formula for permutations is n! / (n - r)!, and for combinations, it is n! / (r! * (n - r)!).
• ❓ Practicing with the formulas will make solving permutation and combination problems quicker and easier.
• ❓ Permutations and combinations are commonly used in probability, statistics, and combinatorial mathematics.
• 🎲 Permutations and combinations have various applications, such as in gambling, games, and analyzing different outcomes.
• ❓ Understanding permutations and combinations is essential for solving complex analytical and mathematical problems.

Questions & Answers

Q: What is the difference between permutations and combinations?

Permutations involve arranging items in a specific order, considering the order's importance. On the other hand, combinations focus on selecting items without considering their order.

Q: Can you provide an example of a permutation problem?

Sure! Let's say we need to select a team of three people out of ten, with each person having a different role. The order in which the three team members are chosen matters, making it a permutation problem.

Q: What is an example of a combination problem?

Suppose we need to choose a leadership team of three people out of ten, without any specific roles assigned to them. In this case, the order of selecting the team members does not matter, representing a combination problem.

Q: What are the formulas for permutations and combinations?

The formula for permutations (nPr) is n! / (n - r)!, where n represents the total number of objects and r represents the number of objects to be arranged. The formula for combinations (nCr) is n! / (r! * (n - r)!), where r represents the number of objects to be selected.

Summary & Key Takeaways

• Permutations involve arranging things in a specific order, while combinations focus on selecting things without considering the order.

• Permutation example: Choosing a team with different roles; order matters.

• Combination example: Selecting a team without specific roles; order does not matter.