Suppose we want to choose 6 letters, without replacement, from 9 distinct letters.(a) If the order of the choices is not relevant, how many ways can this be done?□(b) If the order of the choices is relevant, how many ways can this be done?□
Q. Suppose we want to choose 6 letters, without replacement, from 9 distinct letters.(a) If the order of the choices is not relevant, how many ways can this be done?□(b) If the order of the choices is relevant, how many ways can this be done?□
Combination Formula: To find the number of ways to choose 6 letters from 9 without considering the order (combinations), we use the combination formula:Number of combinations=(rn)=r!(n−r)!n!where n=9 and r=6.(69)=6!⋅(9−6)!9!=3×2×19×8×7=84
Calculate Combinations: For the ordered selections (permutations), we use the permutation formula:Number of permutations=(n−r)!n!where n=9 and r=6.(9−6)!9!=3!9!=9×8×7×6×5×4=60480