First we have to find out the common number of them.
For that purpose, the first number should be divided by next number.
100/20 = 5
20/4 = 5
4/0.8 = 5
we have found that 5 is the common number.
0.8/5 = 0.16
therefore the answer is c
Answer:
The camera had to cover the greatest angle is CAMERA 3 because it had the largest angle of 71.47°
Step-by-step explanation:
From the above question,
We have:
Camera 1 = Angle A
Camera 2= Angle B
Camera 3 = Angle C
A = 210ft
B = 234ft
C = 260ft
We need to find Angle A( angle of camera 1) using the cosine rule
A=(B² + C² - 2BCCosA)
210² = 234² + 260² - 2 × 234 × 260 × CosA
210² = 122356 - 121680CosA
Square both sides
210² = 122356 - 121680CosA
44100 = 122356 - 121680CosA
121680CosA = 122356 - 44100
121680CosA = 78256
Cos A = 78256/121680
Cos A = 0.6431295201
A = arc cos (0.6431295201)
A = 49.974422249°
Angle A approximately = 49.97°
Using the Sine rule to find the Angle B
A/Sine A = B/Sine B
210ft/Sine 49.97° = 234ft/Sine B
210ft × Sine B = 49.97° × 234ft
Sine B =( Sine 49.97° × 234ft)/210ft
B = arc sin (0.8532172354)
Angle B = 58.56334
Approximately = 58.56°
Angle C = 180 - (49.97 + 58.56)°
Angle C = 71.47°
Therefore, the camera had to cover the greatest angle is Camera 3 because it had the largest angle of 71.47°
Answer: y = 2/1 x 0
Step-by-step explanation:
Y=mx+b
2 and 1 are the “rise and run” (m) (from one point to the next, you must go up 2 units then right 1 unit)
The y intercept (b) is the point where it is on the y axis but 0 on the x axis, so 0
7(4)-9(130)
28-1170
answer: -942
Answer:
1) How does "Abe" relate to the merry-go-round? (The problem doesn't seem to say.)
2) How many people did each person provide for? So how many dozens were brought? How many are in a dozen? So how many cookies were brought?
Step-by-step explanation:
nm the top
There are n seats on a merry- go-round. A boy takes n rides. Between each ride, he moves clockwise a certain number of places to a new horse. Each time he moves a different number of places. Find all n for which the boy ends up riding each horse.
2) So if there are n horses, first the boy could move by one place then he could move by n+1 places then by 2n+1 so on and so forth, until he moves (n−2)n+1 places, in which case he'd would have been ridden each horse only one time and taken unique number of steps, which implies that all n's satisfy given condition.
1) I don't know how to cancer this let me resheerch and ill get back to you
P>S let this be help only if you need to annotate or reword thx
