The remainder is 110 when
is divided by x-4
Step-by-step explanation:
We need to find the remainder when
is divided by x-4
Solving:
The solution is attached in the figure below.
The quotient is: 
The remainder is: 110
Keywords: quotient, division
Learn more about Division and quotient at:
#learnwithBrainly
Hello from MrBillDoesMath!
Answer:
9
Discussion:
Solution 1:
Distance between two points (x1, y1), (x2,y2) is given by the formula
sqrt( (x1-x2)^2 + (y1-y2)^2). In our case this becomes
sqrt( (0-0)^2 + (12 -3)^2 ) =
sqrt( 9^2) =
9.
Solution 2:
Note points D and E both have x = 0 so segment DE is a vertical segment. The length is simply the difference of the y coordinates: 12- 3 = 9 as before.
Thank you,
MrB
Answer:
And if we solve for a we got
And the limits for this case are: (214.4; 295.4)
Step-by-step explanation:
Previous concepts
Normal distribution, is a "probability distribution that is symmetric about the mean, showing that data near the mean are more frequent in occurrence than data far from the mean".
The Z-score is "a numerical measurement used in statistics of a value's relationship to the mean (average) of a group of values, measured in terms of standard deviations from the mean".
Solution to the problem
Let X the random variable that represent the annual precipitation of a population, and for this case we know the distribution for X is given by:
Where
and
The confidence level is 95.44 and the signficance is
and the value of
. And the critical value for this case is 
Using this condition we can find the limits
And if we solve for a we got
And the limits for this case are: (214.4; 295.4)
Answer:
a = -8
Step-by-step explanation:
-5⁄2 a + 5 = 25
Subtract 5 from each side
-5⁄2 a + 5-5 = 25-5
-5/2 a = 20
Multiply each side by -2/5 to isolate a
-2/5 * -5/2 a = -2/5 *20
a = -8
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>