Let and be points in space. For any line segment , there exists at least one point such that is a right angle. Find an equation which represents the set of all possible points of in space.
Explanation
Each point can be described as a vector from the midpoint of to the point . Let's call this vector . has 2 important properties; it is orthogonal to and it's magnitude is constant for all terminal points . It shouldn't be that hard to convince yourself of this, try solving the problem in and it should become apparent fairly quickly.
Here's the intuition that I used. Given in space, we can draw an infinite amount of planes that contain (assuming ). For example, in space, imagine rotating a plane about an axis along . That's the set of all planes that contain .
On each of these planes, we can draw the problem in 2 dimensions. You have probably noticed that there are always 2 solutions in . Simply draw a square with the diagonal being and calculate where the last 2 corners are. In fact, because the solutions in are the secondary diagonal points of a square, this tells us that the magnitude of is half that of the diagonal ().
Similarly, we can determine that must be orthogonal to using the idea of square diagonals. The diagonals of a square are by definition orthogonal to each other. This means that .
To combine these conditions, we can write the first condition as . Then we equate this to the second condition. Of course, we still need to specify that both of these expressions are equal to zero.