Math Problem Statement
Suppose we want to choose 3 letters, without replacement, from the 4 letters A, B, C, D, 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
Permutations: P(n, r) = n! / (n-r)!
Combinations: C(n, r) = n! / (r!(n-r)!)
Theorems
-
Suitable Grade Level
Grades 9-12
Related Recommendation
Unique Permutations of A, B, C, D, E, F for 1 to 6 Letters
How to Choose 3 Letters from 4 Using Combinations (A, B, C, D)
Calculate Ways to Choose 2 Letters from A, B, C, D, E
Counting Linear Arrangements with A, B, and C
Solve Permutations, Combinations, and Probability Questions Involving 'MOROCCO' and Team Selection