Answer:
is closest to 4.
Step-by-step explanation:
Our approach consist in comparing the given cubic root with respect to other two cubic roots consecutive to each other and whose result is an integer. The following condition must be satisfied:
![n < \sqrt[3]{62} < n+1](https://tex.z-dn.net/?f=n%20%3C%20%5Csqrt%5B3%5D%7B62%7D%20%3C%20n%2B1)

If
, then the simultaneous inequation is observed:


Since 62 is closer to the upper bound, then
is closest to 4.
5y² + 2xy – 20x - 100
Step-by-step explanation:
Assume that the distance between City A and City B is <em>x</em> miles,
& the speed of the plane from City A to B is<em> y </em>mph;
The return trip is 20 mph slower so the plane's speed is <em>(y – 20)</em> mph
Since <em>time = distance/speed;</em> The time taken by the plane from City A to B is <em>x / y</em> hrs.
The time taken in return flight is;
<em>x / (y - 20)</em> hrs
The layover was 5hrs long. Therefore the total time taken on the who return trip journey is;
x/y + x/(y-20) + 5
multiply each individual fraction with the LCM of the denominators
x(y-20) + xy + 5 y(y-20)
xy -20x +xy + 5y² – 100
5y² + 2xy – 20x - 100
BD and XY are parallel
so
y + 83 = 180
y = 180 - 83
y = 97
answer
D. 97
I think the correct answer is C