On , the area under is always 5. That is, for any you choose, and satisfy .
On , there is an infinite number of possibilities for that satisfy the above conditions. Then, you can get an infinite number of distances between and depending on the values of and .
If the average distance between and given all the above conditions is , find .
Note: Please when you solve the problem to avoid entering an "incorrect" answer that is actually correct, integrate with respect to , not . There seems to be a possible discrepancy with Wolfram Alpha. Also, yes, you may use Wolfram Alpha to compute the integral.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
∫ a b x 2 d x = 5 → 3 b 3 − a 3 = 5
Rearrange to get
b = 3 a 3 + 1 5
The minimum value of a = 0 and maximum value of b is 100, so we can solve for max value of a.
1 0 0 = 3 a 3 + 1 5 1 0 6 = a 3 + 1 5 1 0 6 − 1 5 = a 3 3 1 0 6 − 1 5 = a
To get the average distance, we want to know the average b − a but we've already figured out b in terms of a .
3 1 0 6 − 1 5 − 0 1 ∫ 0 3 1 0 6 − 1 5 3 a 3 + 1 5 − a d a = 0 . 0 5 3 2 . . .
Finally, ⌈ 1 0 0 0 ⋅ 0 . 0 5 3 2 ⌉ = 5 4