Math Problem Statement
Suppose we want to choose 2 letters, without replacement, from the 5 letters A, B, C, D, and E. How many ways can this be done, if the order of the choices is relevant?
How many ways can this be done, if the order of the choices is not relevant?
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Permutations
Combinations
Formulas
Permutation formula: P(n, r) = n! / (n - r)!
Combination formula: C(n, r) = n! / (r! * (n - r)!
Theorems
-
Suitable Grade Level
High School
Related Recommendation
Unique Permutations of A, B, C, D, E, F for 1 to 6 Letters
Choosing Letters: Permutations and Combinations Explained
Counting Linear Arrangements with A, B, and C
How to Choose 3 Letters from 4 Using Combinations (A, B, C, D)
Calculating Different Arrangements from Letters of the Word ESSENCE with Distinct Initial Letters