**Triangle Inequality** is an exaggerated version of the Basic Idea of the Euclidean Plane, something we follow every day in our lives –

The shortest distance between two points is the straight-line distance between the two points.

It tells you, if you move from A to B via another point P, then the distance of travel will be larger than traveling along AB.

But, we can play with and nurture this idea to solve interesting puzzles. Let’s do some **Triangle inequality Problems and Solutions**. A single diagram is sufficient for the arguments.

Excited right? Let’s explore!

**Problem 1**: A, B, C, D are four points. Find a point P such that PA + PB + PC + PD is minimum.

**Solution**:

Now, observe, that HA + HB + HC + HD = AH + HC + CI + IF, which is minimized if H lies on AC and I lies on CF. I lie on CF is the same as H lies on BD. So, it is minimized if H lies on AC and BD both, which is the intersection point of the diagonal.

**Problem 3**: A is a line. L and M are two points in the same plane on the* opposite *side of the line. Find a point N on A such that NL + NM is minimum.

**Solution**:

**Problem 2**: A is a line. L and M are two points in the same plane on the *same* side of the line. Find a point N on A such that NL + NM is minimum.

**Solution**:

**Problem 4**: A is a line. L and M are two points in the same plane on the *same* side of the line. Find a point P on A such that |PL – PM| is minimum.

**Solution**:

**Problem **5: A is a line. L and M are two points in the same plane on the *opposite *side of the line. Find a point P on A such that |PL – PM| is minimum.

**Solution**:

**Problem **6: A is a line. L and M are two points in the same plane on the *same* side of the line. Find a point O on A such that |OL – OM| is maximum.

**Solution**:

**Problem **7: A is a line. L and M are two points in the same plane on the *opposite *side of the line. Find a point O on A such that |OL – OM| is maximum.

**Solution**:

#### Problem 8: An ant is caught on one corner of a cuboid with sides l, b, and h. It wants to reach the diagonally opposite corner, However, the ant can perform a walk only along with the faces of the cuboid. What is the least amount of distance that the ant needs to walk to reach the other corner?

**Solution: **

More, similar problems to come. Stay tuned!

Google