It is in the form of m/n where m and n are integers and n is not equal to 0.
1 answer:
You might be interested in
Answer:
32760 ways
Step-by-step explanation:
Given
Number of Candidates = 15
Job Positions = 4
Required:
Number of outcomes
This question represent selection; i.e. selecting candidates for job positions;
This question can be solved in any of the following two ways
Method 1.
The first candidate can be chosen from any of the 15 candidates
The second candidate can be chosen from any of the remaining 14 candidates
The third candidate can be chosen from any of the remaining 13 candidates
The fourth candidate can be chosen from any of the remaining 12 candidates
Total Possible Selection = 15 * 14 * 13 * 12
<em>Total Possible Selection = 32760 ways</em>
<em></em>
Method 2:
This can be solved using permutation method which goes thus;
Where n = 15 and r = 4
So;
becomes
<em>Hence, there are 32760 ways</em>
We can first add up the cards so we know how many we have in all:
16 + 16 + 18 = 50 cards
We can do this a little bit easier if we get the "16"-cards in one number total.
16 + 16 = 32
= 32 x 2 = 
50 x 2
= 64 : 2 = 32 %
100
We did just divide the % of two types cards on 2, so we get the %-chance of 1 type card.
I am not quite sure, but I think that 32 % is the correct answer.
16 + 16 + 18 = 50 cards
We can do this a little bit easier if we get the "16"-cards in one number total.
16 + 16 = 32
50 x 2
100
We did just divide the % of two types cards on 2, so we get the %-chance of 1 type card.
I am not quite sure, but I think that 32 % is the correct answer.