I have just leaned a new technique!! Someone very kind taught me :))
A line segment of length 5 is broken at two random points along its length. What is the probability that the shortest of the three new segments has length longer than 1?
Let the lengths be x, 5-y, and y-x
Obviously x and y are between 0 and 5
and y>x
If you add these together you will see that they add to 5.
So the entire region where x and y can be is a triangle, (the big green one in the contour map)
Now
If x is less then 1, the condition is met. x<1
If x is more than 4 the condition is met. x>4
If 5-y>4 or if 5-y<1 the condition is met.
i.e. if y<1 or if y>4 the condition is met
If 0< y-x<1 or if 4
i.e. x< y<1+x or if 4+x
i.e. y>x and y<1+x or if y>4+x and y<5+x the condition is met
Ok lets try mapping this on a boolean contour map.
I've done all that and the only place that the conditions are not met is the little red triangle in middle.

So all possible outcomes are within the green area which is 0.5*5*5=12.5units squared
The area of red triangle represents all triads where the smallest is bigger than 1
Area = 0.5*2*2 = 2 units squared
So the probability that the shortest side is more than 1 is 2/12.5 = 4/25 = 16%