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>
Answer:
-6
(I don’t understand what you mean by on & 5 but..)
Step-by-step explanation:
The two negatives (the -(- ) cancel each other out and make a postive, so
-18 + 12 = -6
Step-by-step explanation:
Notice: The literal factors are all the combinations of a and b where the sum of the exponents is 4: a4, a³b, a²b², ab³, b4 ... The solution to the problem of the binomial coefficients without actually ... The upper index n is the exponent of the expansion; the lower index k indicates which term ... 1a5 + a4b + a3b² + a²b3 + ab4 + b5.
Answer:
5.7*10^-3
Step-by-step explanation:
Answer: No! This is not a function!
Step-by-step explanation:
Functions. Terms. Domain - The set of all inputs of a relation or function. Function - A relation in which each input has only one output. Often denoted f (x). Horizontal Line Test - If every horizontal line you can draw passes through only 1 point, x is a function of y.
