Three sticks, one triangle
Three numbers are drawn independently and uniformly from . What is the probability that there is a (non-degenerate) triangle with side lengths , and ?
Fractions, decimals with at least 3 significant digits, and expressions such as sqrt(2)/2, e^-1 or pi/4.
Three lengths form a triangle exactly when the largest is smaller than the sum of the other two. The three events “ is too long”, “ is too long”, “ is too long” cannot happen together.
is the volume of a region in the unit cube. For a fixed , the pairs with form a triangle of area .
h
s Shown after a correct answer. Revealing it first marks the problem as seen, not solved.
Idea. The triangle fails if and only if one side is at least the sum of the other two. These failures are disjoint, so their probabilities add, and each one is a simple volume.
Step 1: failure events. No triangle exists when , or , or . Two of these cannot hold together (adding them would force a length to be , which has probability ). So
Step 2: one volume. For fixed , the set in the unit square is a right triangle with area (since ). Hence
Step 3.
Compare. If instead a single stick of length is broken at two uniform points, the three pieces form a triangle with probability . The constraint that the pieces add up to makes a long piece more likely.