Crossing Paths in a Space Station

Two astronauts, Alfred and Bob, are positioned at the midpoints of adjacent walls, in a rectangular room, in a space station. Alfred's wall has length 3 L 3L , and Bob's wall has length 2 L 2L .

They both push off of their walls at the same instant. Alfred has a speed of 3 v 3v , and Bob has a speed of 5 v 5v . They both stop when they reach their opposing walls.

The closest distance they ever get to each other can be written as L a b \frac{L}{a\sqrt{b}} , where a a and b b are positive integers and b b is square free.

Find a + b a+b .

Ignore gravity and air resistance.


The answer is 36.

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.

2 solutions

Deepanshu Gupta
Dec 17, 2014

Best Technique To Solve This Problem is By using Concept of Relative Motion

Let us Consider our Refrence frame at B (Say Bob) , Then in this frame B is at rest , So

Equation of motion of A (Alfred) is a straight Line Motion w.r.t Bob (B) So it's equation is :

y 0 = 3 5 ( x 3 L 2 ) 3 x + 5 y = 9 L 2 y-0\quad =\quad \cfrac { -3 }{ 5 } (x-\cfrac { 3L }{ 2 } )\\ \\ 3x+5y\quad =\quad \cfrac { 9L }{ 2 } .

Closest Distance between them is equal to Perpendicular distance of (bob) B(0,L) from the Line which is :

d m i n = 0 + 5 L 9 L 2 3 2 + 5 2 d m i n = L 2 34 { d }_{ min }=\left| \cfrac { 0+\quad 5L\quad -\cfrac { 9L }{ 2 } }{ \sqrt { { 3 }^{ 2 }+{ 5 }^{ 2 } } } \right| \\ \\ \boxed { { d }_{ min }\quad =\quad \cfrac { L }{ 2\sqrt { 34 } } } \quad .

Nice diagrammatic Solution ! :)

Karan Shekhawat - 6 years, 5 months ago

We can also solve this by considering (x-y) plane and then using A. O. D

Kïñshük Sïñgh - 6 years, 5 months ago
Tyler Hanna
Dec 16, 2014

Let the lower-left corner of the room be the origin of our x- y- coordinate system. Then, Alfred and Bob's position vectors, as functions of time, can be written as:

r A ( t ) = < ( 3 L 2 ) , ( 3 v t ) > \vec{r}_{A}(t) = <(\frac{3L}{2}),(3vt)> , and r B ( t ) = < ( 5 v t ) , ( L ) > \vec{r}_{B}(t) = <(5vt),(L)>

Then, the displacement vector pointing from Bob to Alfred can be written:

Δ r = < ( 3 L 2 5 v t ) , ( 3 v t L ) > \Delta\vec{r} = <(\frac{3L}{2}-5vt),(3vt-L)>

Now we need to minimize the distance. To make the math simpler, we mimimize the square of the distance instead. That is:

r 2 = ( 3 L 2 5 v t ) 2 + ( 3 v t L ) 2 r^{2} = (\frac{3L}{2}-5vt)^{2}+(3vt-L)^{2}

and:

d d t r 2 = 2 r d r d t = 21 v L + 68 v 2 t \frac{d}{dt}r^{2} = 2r\frac{dr}{dt} = -21vL + 68v^{2}t

Setting this equal to 0, we can cancel out the 2 r 2r , as I've already verified that r = 0 r=0 never occurs. Solving for t t , we find that the time of occurence where Alfred and Bob are closest together is:

t = 21 L 68 v t = \frac{21L}{68v}

Now we simply plug this into our distance formula, and simplify to get:

r m i n = L 2 34 r_{min} = \frac{L}{2\sqrt{34}}

So, a + b = 36 \boxed{a+b = 36}

I guess it would be simpler if we solved the problem in the frame of one of the astronauts, (say Alfred.) Bob will appear to move in a straight line, and the shortest distance between them will be when the line joining Alfred and Bob would be perpendicular to the Bob's path.

q q

The length of the perpendicular can be easily calculated by using base x height = perpendicular x hypotenuse.

Pranshu Gaba - 6 years, 5 months ago

Nice solution, Tyler. One typo to point out, however; in the line where you take derivatives you should have 21 v L + 68 v 2 t -21vL + 68v^{2}t . Perhaps you could also expand d r 2 d t \frac{dr^{2}}{dt} as 2 r d r d t 2r\frac{dr}{dt} , but that's just a personal preference.

Brian Charlesworth - 6 years, 5 months ago

Log in to reply

d=rt , t=d/r, Bob's time to get to center of the room = 1.5 L/ 5v. At that instance Alfred is (1.5L/5v )* 3v = .9 L from his take-off point or 0.1 L from the center of the room, where Alfred is. At times before this and after this the distances between them are greater. Therefore I claim that L/10 is the closest distance they get to each other.

What is incorrect about my analysis?

Guiseppi Butel - 6 years, 5 months ago

Log in to reply

I agree that for the times before this the distance is greater than L 10 \frac{L}{10} , but for a short interval after this the distance between the two diminishes further. As a demonstration, reset to clock to zero when Bob reaches the center of the room, and for convenience let L = 10 , v = 1 L = 10, v = 1 . Then the distance between the two after time T T is

( 5 T ) 2 + ( 1 3 T ) 2 = 34 T 2 6 T + 1 = T ( 34 T 6 ) + 1 \sqrt{(5T)^{2} + (1 - 3T)^{2}} = \sqrt{34T^{2} - 6T + 1} = \sqrt{T(34T - 6) + 1} ,

which will be less than L 10 = 1 \frac{L}{10} = 1 when 0 T 6 34 0 \le T \le \frac{6}{34} .

So for any L , v L, v there will be a brief interval in which the two astronauts are closer than L 10 \frac{L}{10} , and Tyler's analysis identifies the time at which they are closest.

Brian Charlesworth - 6 years, 5 months ago

Log in to reply

@Brian Charlesworth Thanks for the enlightenment, Charles. I accept this now, had to prove it to myself with diagrams. I must say that the concept is counter-intuitive, though. Who'd a thunk it!

Guiseppi Butel - 6 years, 5 months ago

Log in to reply

@Guiseppi Butel Yes, I agree that it is counter-intuitive. I actually made the above sample calculation to convince myself that the solution obtained using calculus was in fact reasonable. :)

Brian Charlesworth - 6 years, 5 months ago

Thanks for pointing out the typo. I'll probably change the derivative notation as well.

Tyler Hanna - 6 years, 5 months ago

Log in to reply

You're welcome. It was a nice twist putting astronauts into your problem. A follow-up question could look at the scenario where they don't stop after hitting the opposite walls and just keep bouncing back and forth until they actually collide. The question would then be whether or not they will ever collide, and if they do, after what time will the collision occur.

Brian Charlesworth - 6 years, 5 months ago

Log in to reply

@Brian Charlesworth You read my mind.

Tyler Hanna - 6 years, 5 months ago

Log in to reply

@Tyler Hanna Haha. Well, with the two bouncing back and forth, Alfred will be at the center of the rectangle at times

t A = 3 L 10 v + n 3 L 5 v t_{A} = \frac{3L}{10v} + n*\frac{3L}{5v}

for integers n 0 n \ge 0 and Bob will be at the center at times

t B = L 3 v + m 2 L 3 v t_{B} = \frac{L}{3v} + m*\frac{2L}{3v} .

for integers m 0 m \ge 0 . For the two of them to collide we would need t A = t B t_{A} = t_{B} for some m , n m,n . Equating and simplifying, this would require that there exist m , n m,n such that

18 n 20 m = 1 18n - 20m = 1 ,

which, since gcd ( 18 , 20 ) = 2 \gcd(18,20) = 2 , has so integer solution, (as 2 2 is the least integer that can be written in this form). Thus Alfred and Bob will never collide.

So the next question is whether they will ever get closer than they do on the first pass. I'll get to those calculations... sometime. :)

Brian Charlesworth - 6 years, 5 months ago

Log in to reply

@Brian Charlesworth I'll probably redo the problem with different numbers so that they do collide, but first I've got a center of mass problem that I've been working on for three days now, so I should probably get that one up first.

Tyler Hanna - 6 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...