Question

Suppose we want to choose 5 letters, without replacement, from 13 distinct letters. How many ways...

Suppose we want to choose 5 letters, without replacement, from 13 distinct letters.

How many ways can this be done, if the order of the choices does not matter?

How many ways can this be done, if the order of the choices matters?

Math   Statistics-And-Probability   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

When the order of choices for the number of formations does not matter, we use the combination technique whereas when the order of choices does matter, we use the permutation technique.

Here

n = 13

r = 5

The number of ways that can be done, if the order of the choices does not matter

=

ways

The number of ways that can be done, if the order of the choices does  matter

=

ways

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Suppose we want to choose 5 colors, without replacement, from 13 distinct colors. (a) How many...
Suppose we want to choose 5 colors, without replacement, from 13 distinct colors. (a) How many ways can this be done, if the order of the choices matters? (b) How many ways can this be done, if the order of the choices does not matter?
How many ways can we order the letters in SEVENTEEN? (Hint: Not all of the letters...
How many ways can we order the letters in SEVENTEEN? (Hint: Not all of the letters are distinct, so the plain permutations formula does not apply.)
Permutations--------- In how many distinct ways can all the letters of the word UNBELIEVABLE be arranged...
Permutations--------- In how many distinct ways can all the letters of the word UNBELIEVABLE be arranged amongst themselves if a) there are no restrictions? b) the arrangement begins with the letters I V A, in that order? c) the arrangements must begin and end with a consonant?
In how many ways can 3 letters be chosen from M, N, O, P, Q, R,...
In how many ways can 3 letters be chosen from M, N, O, P, Q, R, S, assuming that the order of the choices doesn't matter and that repeats are not allowed?
How many “words” are there of length 4, with distinct letters, from the letters {a, b,...
How many “words” are there of length 4, with distinct letters, from the letters {a, b, c, d, e, f}, in which the letters appear in increasing order alphabetically. A word is any ordering of the six letters, not necessarily an English word.
1. How many permutations are there of the letters in the word ​RINSE, if all the...
1. How many permutations are there of the letters in the word ​RINSE, if all the letters are used without​ repetition? 2. In how many distinct ways can the letters of the word SELLS be​ arranged?
1.) How many “words” are there of length 4, with distinct letters, from the letters {a,...
1.) How many “words” are there of length 4, with distinct letters, from the letters {a, b, c, d, e, f}, in which the letters appear in increasing order alphabetically. A word is any ordering of the six letters, not necessarily an English word. 2.) Prove that every graph has an even number of odd nodes.
How many ways can we put 14 identical balls into 5 distinct bins if no bin...
How many ways can we put 14 identical balls into 5 distinct bins if no bin can hold more than 6 balls?
In how many ways can we place n distinct objects into k distinct bins such that...
In how many ways can we place n distinct objects into k distinct bins such that no bin contains more than half of the objects?
How many ways can we pick three distinct integers from {1,2, ...,15} such that their sum...
How many ways can we pick three distinct integers from {1,2, ...,15} such that their sum is divisible by 3?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT