ficklehead
In example : |x - 1| + |x-3| + |x + 1| + |x + 6| .. the posts on the number line are : -6, -1 , 1 and 3. In order to minimize value of this expression to 9, how to chose the x ?
Please correct me if I am wrong.
x is that point on the number line whose sum of distances from -6, -1, 1 and 3 is minimum. So basically there is a person each at points -6, -1, 1 and 3. You need to make them all meet by covering minimum distance.
Distance between -6 and 3 is 9 which must be covered by these 2 people to meet. These 2 can meet at any point: -6, -1, 0, 1 or 3 etc they will cover a distance of 9 together.
If -1 and 1 have to meet too, they need to cover a distance of 2 together. Say, if person at -1 travels down to 1 and -6 and 3 also meet at 1, the minimum distance covered will be 9+2 = 11 and they will all be able to meet.
If they instead meet at -1, the situation will be the same and total distance covered will be 11 again. In fact, they can meet at any point between -1 and 1, the total distance covered will be 11.
To check, put x = 1. you get |x - 1| + |x-3| + |x + 1| + |x + 6| = 11
put x = -1, you get |x - 1| + |x-3| + |x + 1| + |x + 6| = 11
put x = 0, you get |x - 1| + |x-3| + |x + 1| + |x + 6| = 11