We look at the average distance between two points inside the unit cube. Here are 20 line segments whose endpoints are randomly chosen inside the unit cube:
The average distance between the two points
and
should be roughly the diagonal of an average cube, which should have edge about
, so the diagonal should be about
![]()
Here are the results of a simulation with
trials of
:
![]()
![]()
Consider points
and
in the unit cube. The average distance between the two points is given by

Alternatively, assume that
,
, and
are the dimensions of a box
whose opposite vertices are two points in the unit cube. Note that this
small cube can be moved inside the unit cube as long as the point closest to
the point
remains inside a box of dimensions
. The average
length of the diagonal of such a box is

This may not be much easier to evaluate, but at least we’ve reduced the
number of integral signs and the number of variables.
This number, called the Robbins constant, was computed by D. P. Robbins in
the American Mathematical Monthly in 1978. See Weisstein, Eric W. “Cube Line
Picking.” From MathWorld–A Wolfram Web Resource.
http://mathworld./wolfram.com/CubeLinePicking.html
