Computers and Technology, 09.10.2019 21:00 Sk8terkaylee

Aperson gets 13 cards of a deck. let us call for simplicity the types of cards by 1,2,3,4. in how many ways can we choose 13 cards, so that so that there are 5 of type 1, there are 4 of type 2, there are 2 of type 3 and there are 2 of type 4?

Answers: 2

Show answers

Answers

There are 5,598,527,220 ways to choose 5 cards of type 1, 4 cards of type 2, 2 cards of type 3 and 2 cards of type 4 from a set of 13 cards.

Explanation:

The crucial point of this problem is to understand the possible ways of choosing any type of card from the 13-card deck.

This is a problem of combination since the order of choosing them does not matter here, that is, the important fact is the number of cards of type 1, 2, 3 or 4 we can get, no matter the order that they appear after choosing them.

So, the question for each type of card that we need to answer here is, how many ways are there of choosing 5 cards of type 1, 4 cards of type 2, 2 cards of type 3 and 2 are of type 4 from the deck of 13 cards?

The mathematical formula for combinations is $\\ \frac{n!}{(n-k)!k!}$ , where n is the total of elements available and k is the size of a selection of k elements from which we can choose from the total n.

Then,

Choosing 5 cards of type 1 from a 13-card deck:

$\frac{n!}{(n-k)!k!} = \frac{13!}{(13-5)!5!} = \frac{13*12*11*10*9*8!}{8!*5!} = \frac{13*12*11*10*9}{5*4*3*2*1} = 1,287$ , since $\\ \frac{8!}{8!} = 1$ .

Choosing 4 cards of type 2 from a 13-card deck:

$\\ \frac{n!}{(n-k)!k!} = \frac{13!}{(13-4)!4!} = \frac{13*12*11*10*9!}{9!4!} = \frac{13*12*11*10}{4!}= 715$ , since $\\ \frac{9!}{9!} = 1$ .

Choosing 2 cards of type 3 from a 13-card deck:

$\\ \frac{n!}{(n-k)!k!} =\frac{13!}{(13-2)!2!} = \frac{13*12*11!}{11!2!} = \frac{13*12}{2!} = 78$ , since $\\ \frac{11!}{11!}=1$ .

Choosing 2 cards of type 4 from a 13-card deck:

It is the same answer of the previous result, since

$\\ \frac{n!}{(n-k)!k!} = \frac{13!}{(13-2)!2!} = 78$ .

We still need to make use of the Multiplication Principle to get the final result, that is, the ways of having 5 cards of type 1, 4 cards of type 2, 2 cards of type 3 and 2 cards of type 4 is the multiplication of each case already obtained.

So, the answer about how many ways can we choose 13 cards so that there are 5 of type 1, there are 4 of type 2, there are 2 of type 3 and there are 2 of type 4 is:

1287 * 715 * 78 * 78 = 5,598,527,220 ways of doing that (or almost 6 thousand million ways).

In other words, there are 1287 ways of choosing 5 cards of type 1 from a set of 13 cards, 715 ways of choosing 4 cards of type 2 from a set of 13 cards and 78 ways of choosing 2 cards of type 3 and 2 cards of type 4, respectively, but having all these events at once is the multiplication of all them.

Answer from: Quest

All links together are together

Answer from: Quest

What did you need with?

Another question on Computers and Technology

Computers and Technology, 23.06.2019 17:30

Per the municipal solid waste report, what are the most common sources of waste (trash

Answers: 3

Answer

Computers and Technology, 23.06.2019 20:00

Match the file formats with the types of multimedia they can store

Answers: 2

Answer

Computers and Technology, 23.06.2019 20:40

Instruction active describing list features which statements accurately describe the features of word that are used to create lists? check all that apply. the tab key can be used to create a sublist. the enter key can be used to add an item to a list. the numbering feature allows for the use of letters in a list. the numbering feature can change the numbers to bullets in a list. the multilevel list feature provides options for different levels in a list.

Answers: 2

Answer

Computers and Technology, 24.06.2019 13:30

Does anybody know how to hack into a google account? i had important information on it and it is gone now and i need getting it back.

Answers: 1

Answer

You know the right answer?

Aperson gets 13 cards of a deck. let us call for simplicity the types of cards by 1,2,3,4. in how ma...

Questions