Simple Geometric Probability

Ordinary probability counts outcomes: favourable outcomes over total outcomes. But a dart thrown blindly at a board can land anywhere in a continuous space, so there's no finite list of outcomes to count. Instead, every point in the target is equally likely, and the natural way to measure 'how much' of the board counts as favourable is area. A bigger region catches more of the dart's possible landing spots, so probability becomes a ratio of sizes rather than a ratio of counts.

The mechanism is simple: probability = (area of the favourable region) / (area of the whole region). This works because the dart is equally likely to land anywhere, so the fraction of the total space taken up by a region is exactly the chance of landing there. The same idea shrinks down to one dimension: if a point is chosen at random on a segment, probability becomes favourable length over total length, since length plays the role area played before.

This connects directly to the area and perimeter formulas used everywhere else in geometry — circles, squares, triangles — because geometric probability is just those formulas wrapped in a ratio. It also sets up the idea that dimension matters: a region needs the right kind of measure to count at all. A square has area, a segment has length, but a single line or point drawn inside a 2D region has zero area, so it can never be favourable territory no matter how probability is sliced.