Answer:
- The lowest point = 20 ft
- The highest point = 60 ft
- The diameter of the wheel = 40 ft
Step-by-step explanation:
<h3>Given</h3>
- The radius = 20 ft
- Distance from the ground to the center = 40 ft
<h3>To find</h3>
- The lowest point
- The highest point
- The diameter of the wheel
<h3>Solution</h3>
- The diameter = 2*radius = 2*20 ft = 40 ft
- The lowest point = distance to the center - radius = 40 ft - 20 ft = 20 ft
- The highest point = the lowest point + diameter = 20 ft + 40 ft = 60 ft
Answer:
Friend 1 (with 80 more tickets) gets 290
Friend 2 gets 210
Step-by-step explanation:
500-80 = 420 tickets |
^in order to figure out how many total tickets they got without the 80 extra
420/2 = 210 |
^divide by 2 to figure out how many tickets each friend had
210+80 |
^add 80 to figure out how many tickets friend one gets
<u>210</u><u> </u><u>+</u><u> </u><u>290</u><u> </u><u>=</u><u> </u><u>500</u>
Answer:
The correct answer is - Non sampling error
Step-by-step explanation:
Sampling errors arises when a sample does not represent the whole population.
It is difference between the real values of the population and the values derived by using samples from the population.
A non-sampling error refers to an error that occurs during data collection, causing the data to differ from the true values.
Non sampling error are of two types , response error and non response error.
In the given question , the error is a response error.
So , it is an example of Non-Sampling error.
- Answer:-The multiplicative rate of change for the exponential function =3. Explanation:- The exponential function is given by y=Ab^x. , where A
Step-by-step explanation:
Answer:
9.11*10^-4 %
Step-by-step explanation:
To find the probability, you simply need to find the possible outcomes that allows no rooks to be in danger, and the possible amount of ways to place the rooks.
For the first outcome, you start by putting 1 rook in the first columns, you have 8 possible rows to do this. The next rook in the next column will only have 7 possible rows, as you have to exclude the one where the previous rook is located. The next rook, 6 possibilities, the next 5, and so on. So we conclude that the total amount of ways so that none of the rooks can capture any of the other rooks is 8*7*6*5*4*3*2*1 = 8! = 40320
In order to find the total amount of ways to place the rooks, you can just use a combinatoric:
![\left[\begin{array}{ccc}64\\8\end{array}\right]= \frac{64!}{8!(64-8)!} = 4.43*10^9](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D64%5C%5C8%5Cend%7Barray%7D%5Cright%5D%3D%20%5Cfrac%7B64%21%7D%7B8%21%2864-8%29%21%7D%20%3D%204.43%2A10%5E9)
Then:
P = 