1. The problem statement, all variables and given/known data Let L be the segment of the Line y=3x+1 with end points (2, 7) and (6, 19). If P is a point not on L, is it guaranteed that the distance between P and L can be Minimized? 2. Relevant equations None Really. 3. The attempt at a solution I looked through my book but couldn't really find anything that was directly related to this. Is there some kind of famous theorem or something that should be obvious?