You are Here: Home >< Maths

Distance between two lines

Announcements Posted on
Four hours left to win £100 of Amazon vouchers!! Don't miss out! Take our short survey to enter 24-10-2016
1. Find an expression for the square of the distance between any two points on and in terms of and where
has equation and has equation .

Without using the scalar product and without using a standard shortest distance formula, find the shortest distance between the lines and and give the coordinates of each of the points on and at which the shortest distance occurs.

This question is proving quite difficult. It is an FP4* question.I would normally use scalar and/or vector product to do this but it specifically states that you can't.
2. (Original post by Ano123)
Find an expression for the square of the distance between any two points on and in terms of and where
has equation and has equation .

Without using the scalar product and without using a standard shortest distance formula, find the shortest distance between the lines and and give the coordinates of each of the points on and at which the shortest distance occurs.

This question is proving quite difficult. It is an FP4* question.I would normally use scalar and/or vector product to do this but it specifically states that you can't.
Surely you can use the cross/vector product? That wouldn't be the same as using the scalar product and it would give you a nice perpendicular vector to both lines.
3. (Original post by RDKGames)
Surely you can use the cross/vector product? That wouldn't be the same as using the scalar product and it would give you a nice perpendicular vector to both lines.
That way is practically a standard formula, or you would have to use the scalar product after that wouldn't you?
4. (Original post by Ano123)
Find an expression for the square of the distance between any two points on and in terms of and where
has equation and has equation .

Without using the scalar product and without using a standard shortest distance formula, find the shortest distance between the lines and and give the coordinates of each of the points on and at which the shortest distance occurs.

This question is proving quite difficult. It is an FP4* question.I would normally use scalar and/or vector product to do this but it specifically states that you can't.
If you call the first point P and the second point Q, then |PQ|^2 is a function in lambda and mu which is a degree two function of two variables. Has this question come up at all in the context of conics? Or diagonalizing symmetric matrices?

PS Actually it's easier than that - just work out |PQ|^2
5. (Original post by Ano123)
That way is practically a standard formula, or you would have to use the scalar product after that wouldn't you?
In that case I think differentiation might do the trick. I used it once for distances between lines and planes in a 9 marker and got it right, it wasn't on the mark schemes though. I'll give it a shot and see what happens.

Never mind, that works when you actually know the distance. Useful for finding the points though. Do you have the answers for this? Been a while since I've done FP4
6. (Original post by Ano123)
x
okay for the first part i think you just just use the 3d version of Pythagoras' theorem (im not sure if this has it's own name or not) with your first set of coordinates being and your second being . Theres some tidying up to do though.

Note: I havent tired this method for the next part yet and im very tired but im guessing itll work

so I have no idea how to differentiate with both lambda and mu in there, but you know the shortest distance between two lines that dont touch is the perpendicular line to both of them so I'd use vector product for this part.

once you get your direction vector which is perpendicular to both lines, lets call it , just use the coordinates for a general point on one line (use the things in the first paragraph) and then;

+ t(a,b,c) =

Now youll have three equations with three unknowns (namely lambda, mu and t) so solve for t and that'll lead to finding the shortest distance, solve for lambda and mu to find the exact points on the lines they are referring to
7. I did it.
If we let .
Let the distance be so So . We can treat it as a quadratic in and then complete the square.
.
Making both brackets 0 we see that for minimum , and and so .
8. Alternatively, define .
We have and .
Setting both derivatives to 0 we obtain and for to have a minimum value.

Register

Thanks for posting! You just need to create an account in order to submit the post
1. this can't be left blank
2. this can't be left blank
3. this can't be left blank

6 characters or longer with both numbers and letters is safer

4. this can't be left empty
1. Oops, you need to agree to our Ts&Cs to register

Updated: August 29, 2016
TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Today on TSR

Who is getting a uni offer this half term?

Find out which unis are hot off the mark here

Poll
Useful resources

Maths Forum posting guidelines

Not sure where to post? Read here first

How to use LaTex

Writing equations the easy way

Study habits of A* students

Top tips from students who have already aced their exams

Chat with other maths applicants