Tracking a Space Ship: Will an Asteroid Hit the Target?

mjbourquin
Messages
6
Reaction score
0
This problem is a sample flight path of a ship in space.
Its path is described by the line r(t) = (-1+t)i + (2-t)j
An asteroid has the starting point (0, 5, -1) and a heading vector of 2i + j + 3k
Ship
x = -1 + t
j = 2 -t
z = 0

asteroid

x = 0 + 2t
y = 5 + t
z = -1 + 3t

The question is will the asteroid hit the ship and if not how close will they come.
 
Physics news on Phys.org
We do not do your homework for you at this site. We help you do your own homework. Before we can even start offering help you need to have shown some work on the problem.
 
I don't even know how to start. A hint in my homework states that if two lines do not intersect, they can be embedded in parallel planes but I don't know how that helps me find how close two lines come to each other. If they do intersect I would plug both lines into an r(t) and set them equal. Then find t. Is that right.
 
Hint: What is the distance between the ship and asteroid at time t? What is the minimum of this distance?
 
oh, I forgot all about optimization derivatives. Much easier. Thanks.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top