In the coordinate system, there is a line through the points and . If the point of intersection of the line with the 3D space/cube/whatever you call it (point, line, plane, ??? ) can be represented as the point , where each pair in parentheses contain only coprime positive integers, find the minimum sum of .
Bonus: Make sense of the problem from a geometric point of view.
Notes and Assumptions:
here is a variable and isn't equal to or
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.
The equation of the line is:
r ( t ) = t ⟨ 9 − 1 , 8 − 3 , 5 + 8 , 6 − 4 ⟩ + ⟨ 1 , 3 , − 8 , 4 ⟩
The four equations generated are:
x = 8 t + 1 y = 5 t + 3 z = 1 3 t − 8 w = 2 t + 4
The point of intersection with the z w x 3D space/whatever you call it occurs when y = 0 . Then t = 5 − 3 . Substitute that value of t into other three equations to generate the x , z , w coordinates, namely producing ( − 5 1 9 , 1 0 , − 5 7 9 , 5 1 4 ) . 1 9 + 5 + 0 + 1 + 7 9 + 5 + 1 4 + 5 = 1 2 8