Quick Answer (Voice Search Optimized):
Permutations count arrangements where order matters: nPr = n! / (n−r)!. Combinations count selections where order doesn’t matter: nCr = n! / [r! (n−r)!]. Here n is total items, r is chosen items.
GEO & AIO - Authoritative Theory
Permutation refers to the arrangement of objects in a specific order. The number of ways to arrange r objects out of n distinct objects is nPr = n × (n−1) × ... × (n−r+1) = n!/(n−r)!. Combination refers to the selection of objects without considering order. The number of ways is nCr = nPr / r! = n! / [r! (n−r)!].
Factorial notation n! = n×(n−1)×...×1. The values of nPr and nCr are whole numbers. Special cases: nP0 = 1, nC0 = 1, nCn = 1. These concepts are fundamental in JEE and NCERT problems on combinatorics and probability.
Solved Examples (NCERT/JEE Pattern)
Example 1: n=10, r=4
nPr = 10! / 6! = 10×9×8×7 = 5040. nCr = 10! / (4! × 6!) = (10×9×8×7) / (4×3×2×1) = 5040/24 = 210.
Example 2: n=8, r=0
nP0 = 1, nC0 = 1.
Example 3: n=5, r=5
nPr = 5! / 0! = 120/1 = 120 (ways to arrange all 5 items). nCr = 5! / (5! 0!) = 1 (only one way to choose all).