|
|
|
Circle line picking considers the distance between two points chosen independently and uniformly at random on
the circumference of a unit
circle. Their chord has length . By rotational and reflection symmetry, the first point
can be taken as
and the second as
,
where
has a uniform distribution on
. Then
|
(1)
|
The average distance is then given by
|
(2)
|
The probability density function vanishes outside
and for
is obtained from
|
(3)
|
For nonnegative integers , the raw moments are then
|
(4)
| |||
|
(5)
| |||
|
(6)
|
where
is the gamma function. The first few are
|
(7)
| |||
|
(8)
| |||
|
(9)
| |||
|
(10)
| |||
|
(11)
|
(OEIS A000984 and OEIS A093581 and A001803), where the numerators of the odd terms are 4 times OEIS A061549.
The central moments are
|
(12)
| |||
|
(13)
| |||
|
(14)
|
giving the skewness and kurtosis excess as
|
(15)
| |||
|
(16)
|
Bertrand's problem asks for the probability that a chord drawn at random on a circle
of radius has length
.