Any triple may be described by its starting index `j ` and the distance between the closest balls `k , ` i.e. `j , j + k , j + 2k . ` Here `j = 1 , 2 , 3 ... ` and `k = 1 , 2 , 3 ...`

The probability of a triple `j , j + k , j + 2k ` in some fixed order of balls is the product of the corresponding probabilities, `2^( -j ) * 2^( -j - k ) * 2^( -j - 2k ) = 2^( -3j ) * 2^( -3k ) . ` Because the order is insignificant, the probability of each triple is 6 times greater.

The probability of even spacing is therefore

`6 sum_( j = 1 )^( oo ) ( sum_( k = 1 )^( oo ) ( 2^( -3j ) * 2^( -3k ) ) ) =` ` 6 sum_( j = 1 )^( oo ) ( 2^( -3j ) ) * sum_( k = 1 )^( oo ) ( 2^( -3k ) ) =`

`= 6 * ( 2^( -3 ) / ( 1 - 2 ^( -3 ) ) )^2 = 6 * ( 1 / ( 8 - 1 ) )^2 = 6 / 49 .`

This way, `p = 6 , q = 49 , p + q = 55 .`

## We’ll help your grades soar

Start your 48-hour free trial and unlock all the summaries, Q&A, and analyses you need to get better grades now.

- 30,000+ book summaries
- 20% study tools discount
- Ad-free content
- PDF downloads
- 300,000+ answers
- 5-star customer support

Already a member? Log in here.

Are you a teacher? Sign up now