00:01
Number 59, we are minimizing the distance it takes to go from point c1 to point c2.
00:09
This is a lot like the other problem, only there's more moving parts.
00:13
The way that they have it set up, there's this city, and it's a from this river.
00:18
Over here, the city is b, the distance is b to the river, right? and then we have a distance p, so that makes this p minus x and this x.
00:27
And then algebraically, we can come up with some distances for each one of these.
00:31
And these are figured out, you have to use the pythagorean theorem for them, right? a squared, et cetera.
00:39
But you have to make sure that you are using your actual variables in place because, you know, they're all different.
00:46
Anyway, so we come up with this hypotenuse length, this hypotenuse length, and then we have this bridge called r.
00:52
So we're going to add r in there as well.
00:54
That's a bridge across the river.
00:56
Okay, so the first step over here is to go ahead and basically just make a distance.
01:04
Equation, right? here's the distance that it takes to get from c1 to the river.
01:09
Here's the bridge.
01:10
Here's the distance to c2, right? now, if you want to, maybe it'll make it easier when you do the differentiation...