Question 1015756: This is a basic problem on Combinations and Permutations. Here are 7 letters: A, L, T, E, M, P, N.
How many COMBINATIONS can you make from these letters (they don’t have to spell actual words) ?
How many PERMUTATIONS can you make ? (What is the longest actual word you can make from these letters?)
Would Combinations or Permutations typically be a larger number? Can you give an example with letters or numbers where both would be the same?
Found 2 solutions by richard1234, ikleyn:
Answer by richard1234(7193)   (Show Source):
You can put this solution on YOUR website! # Permutations of {A,L,T,E,M,P,N} is 7! = 5040
# Combinations = 1 (any rearrangement of A,L,T,E,M,P,N contains the same letters in some order)
An example of where the # of combinations equals the # of permutations is if all elements are indistinguishable.
Answer by ikleyn(52767)  (Show Source):
You can put this solution on YOUR website! .
This is a basic problem on Combinations and Permutations. Here are 7 letters: A, L, T, E, M, P, N.
How many COMBINATIONS can you make from these letters (they don’t have to spell actual words) ?
How many PERMUTATIONS can you make ? (What is the longest actual word you can make from these letters?)
Would Combinations or Permutations typically be a larger number? Can you give an example with letters or numbers where both would be the same?
-----------------------------------------------------------------
There are many useful lessons on Permutations and Combinations in this site.
Two introductory lessons are
Introduction to Permutations and
Introduction to Combinations.
You will find there the full list of lessons, too, for further reading.
|
|
|
