To do this problem, you need to use the Pythagorean thermion I think.
Here is what I got as an answer
22.5 km
Answer:
I took the test, Its B) 41.1
The same with this question you divide 60 by 6 and you get 5
Answer: The greatest number of pages Kenji can decorate = 3
Step-by-step explanation:
Given: Total heart stickers = 15
Total star stickers =12
If all the papers identical, with the same combination of heart and star stickers and no stickers left over.
Then the greatest number of pages Kenji can decorate = GCD(15,12) [GCD=greatest common divisor]
Since 15 = 3 x 5
12=2 x 2 x 3
GCD(15,12) =3
Hence, the greatest number of pages Kenji can decorate = 3
We know, Sin Ф = P / H
Here, P = 18, H = x
So, Sin 34 = 18 / x
x = 18 / Sin 34
x = 18 / 0.559
x = 32.19
In short, Your Answer would be Option A
Hope this helps!
