Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2015-01-20 15:11:57

Cam943
Member
Registered: 2014-07-14
Posts: 6

Distance Optimization

Hello mathisfun forum users! I wanted to know how to do this question:

"There are 2 graphs. The first of which is

and the second
. What is the length of the shortest line that connects both of the graphs?"

I want to know for the future how to approach these kind of problems. Do I have to find the locus of the length of the normal line at a point on one of the graphs, and then optimize it?

Thanks,
Cam943

Offline

#2 2015-01-21 02:06:02

Olinguito
Member
Registered: 2014-08-12
Posts: 649

Re: Distance Optimization

Cam943 wrote:

Do you mean

[list=*]
[*]

[/*]
[/list]


The distance from the point
to the line
is

[list=*]
[*]

[/*]
[/list]

Now use calculus.

Last edited by Olinguito (2015-01-21 08:17:49)


Bassaricyon neblina

Offline

#3 2015-01-23 09:18:20

Cam943
Member
Registered: 2014-07-14
Posts: 6

Re: Distance Optimization

Yes that's what I meant. I see how you do it now. I can't believe I didn't use the dropped perpendicular formula...

Offline

Board footer

Powered by FluxBB