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:
see below
Step-by-step explanation:
3x^2 + 17x +10 =0
(3x+ ) ( x+ ) =0
We need to factor 10 = 2*5 or 1*10
They are positive since we have all positive terms
3*5 = 15+2 = 17
The 5 needs to multiply the 3 so it goes on the outside
(3x+ ) ( x+ 5 ) =0
That leaves the 2 on the inside
(3x+ 2 ) ( x+ 5 ) =0
Using the zero product property
3x+2 =0 x+5=0
3x = -2 x=-5
x = -2/3 x = -5
Trapezium A is the trapezium you start with. And then you are expected to reflect it on the y axis (which is just the vertical line x=0)
Answer:
A = 907.46
Step-by-step explanation:
C = πd
34π = πd
d = 34
r = 17
A = = 3.14() = 3.14(289) = 907.46