We will look at a problem that is originated from a math competition and analyze how we might solve the problem without using calculus approach. Second, we will investigate given two differentiable curves in two dimensions and given any point on the curve 1, how do we find the point on the curve 2 so that the distance between these two points is the shortest. Finally, we will see how we extend this result to the one in three dimensions.

From this paper, we will see how dynamic geometry software that is equipped with CAS such as ClassPad has helped me making conjectures on problems in 2D and prompted me to do further investigation using Maple in 3D.