Calculate nPr and nCr
Arrangement and selection calculations
Permutation and combination are fundamental concepts frequently used in probability and statistics. Permutation (P) counts arrangements where order matters, while combination (C) only concerns the selection itself.
Permutation: Used when order is important. For example, how many different ways can you arrange 5 different books on a shelf? P(5,5) = 5! = 120. Formula: P(n,r) = n!/(n-r)!. If you want to arrange 3 people from a group of 10: P(10,3) = 10×9×8 = 720 different arrangements.
Combination: Used when order doesn't matter. For example, how many different ways can you select a 3-person committee from 10 people? C(10,3) = 120. Formula: C(n,r) = n!/(r!×(n-r)!). Combination is always less than or equal to permutation because order is not counted.
Application areas: Lottery and gambling (calculating winning probability), Genetics (DNA sequence combinations), Password creation (number of secure combinations), Team selection and tournament organization, Widely used in data analysis and machine learning.
Short answers to common questions
In permutation order matters (ABC ≠ BAC), in combination it doesn't (ABC = BAC). For example, arranging 3 people is permutation, selecting a group of 3 people is combination.
P(5,3) = 5!/(5-3)! = 5!/2! = 120/2 = 60. This means there are 60 different ways to arrange 3 items from a set of 5.
Because order doesn't count in combination, there are fewer options. For example, P(5,3) = 60 but C(5,3) = 10 because each combination corresponds to 3! = 6 different permutations. 60/6 = 10.
Permutation: Password creation, race ranking, book arrangement where order matters. Combination: Lottery, team selection, committee formation where only selection matters.