Discrete Mathematics - Vol 2 | 11. Permutation and Combination by Abraham | Learn Smarter
K12 Students

Academics

AI-Powered learning for Grades 8–12, aligned with major Indian and international curricula.

Professionals

Professional Courses

Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.

Games

Interactive Games

Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.

Typing
Memory
Math
English Adventures
Knowledge
11. Permutation and Combination

This chapter focuses on permutations and combinations, fundamental concepts in combinatorics. It explores the definitions, formulas, and applications of these concepts, particularly emphasizing the distinctions between ordered and unordered selections. Additionally, the chapter discusses cases where repetitions are allowed and introduces combinatorial proofs to validate the formulas derived.

Enroll to start learning

You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.

Sections

  • 11

    Permutation And Combination

    This section introduces the concepts of permutations and combinations, explaining the importance of order in selections, as well as the different conditions under which selections are made.

    Learning Practice

  • 11.1

    Introduction To Permutations

    This section introduces permutations, detailing ordered arrangements of objects and the distinctions between permutations and combinations.

    Learning Practice

  • 11.2

    Definition Of K-Permutation

    This section defines k-permutations and outlines how to calculate the number of permutations for selecting k elements from a set of n distinct elements, including the concept of repetitions and special cases.

    Learning Practice

  • 11.3

    Calculating K-Permutations

    This section discusses the concept of k-permutations, emphasizing how to calculate the number of ordered arrangements from a set of distinct objects.

    Learning Practice

  • 11.4

    Permutations Where Repetitions Are Allowed

    This section explains the concept of permutations and combinations when repetitions are allowed, illustrating how to calculate the number of permutations with examples.

    Learning Practice

  • 11.5

    Combinations And Its Relation To Permutations

    This section explores the concepts of permutations and combinations, detailing their definitions, formulas, and relationships.

    Learning Practice

  • 11.6

    Unordered Selection Of K Elements

    This section explores unordered selections, known as combinations, focusing on their definitions, mathematical notations, and the relationship to permutations.

    Learning Practice

  • 11.7

    Combinations With Repetitions

    This section discusses the concept of combinations with repetitions, defining the related terminology, formulas, and providing examples of their applications.

    Learning Practice

References

ch34 part A.pdf

Class Notes

Memorization

What we have learnt

  • Permutations represent orde...
  • Combinations refer to unord...
  • Repetitions can be allowed ...

Final Test

Revision Tests