Answer:
One and two twenty one
Step-by-step explanation:
Answer:
Step-by-step explanation:
This is a poisson distribution. Let x be a random representing the number of calls in a given time interval.
a) the expected number of calls in one hour is the same as the mean score in 60 minutes. Thus,
Mean score = 60/2 = 30 calls
b) The interval of interest is 5 minutes.
µ = 5/2 = 2.5
We want to determine P(x = 3)
Using the Poisson probability calculator,
P(x = 3) = 0.21
c) µ = 5/2 = 2.5
We want to determine P(x = 0)
Using the Poisson probability calculator,
P(x = 0) = 0.08
1. Let the four consecutive numbers be x, x+1, x+2, x+3
The sum of four consecutive number is already given to us = 70
Therefore
⇒(x)+(x+1)+(x+2)+(x+3)=70
We need to combine x as we have four x terms in the equation. The next step is to get all of the x’s on one side of the equation and all the numbers on the other side. The same rule applies – whatever you do to one side of the equation, you must do to the other side as well!
⇒4x+6=70⇒4x=64⇒x=16
So, the four numbers are 16, 17, 18 and 19.
Hence, the greatest number among them is 19.
Good evening ,
Answer:
<h2>x = 3 or x = -21</h2>
Step-by-step explanation:
x²+18x=63 ⇌ x²+18x+81 = 63 + 81
⇌ (x+9)² = 144 ⇌ (x+9)² = 12² ⇌ (x+9-12)(x+9+12) = 0
⇌ (x-3)(x+21) = 0
⇌ x=3 or x=-21.
:)
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>