Permutations and Combinations (PC) - Mathematics
- Fundamental principle of counting (multiplication)
- Fundamental principle of counting (addition)
- Permutation of n things taking r at a time P(n,r)
- Permutation of n things, p are alike, q are alike, r are alike
- Permutation of n things taking r at a time, each may be repeated any number of times (n^r)
- Permutation under condition
- Arrangement around the circular table
- Arrangement of beads around a circular necklace
- Circular permutation of n different things taken r at a time
- Combination of n things taking r at a time C(n,r)
- Combination of n things taken r at a time when k particular objects occur (C(n-k, r-k))
- C(n, 1) + C(n, 2) + ... + C(n, n) = 2^n - 1
- Out of p + q + r + t things p, q, r and t are alike
- Total number of divisors of a number
- Division into groups
- Arrangement in groups
- Derangements
- Multinomial theorem
- Exponent of prime p in n!
- Sum of divisors of a composite number