MathDB
2017 PUMaC Team 17

Source:

September 20, 2019
combinatorics

Problem Statement

Zack keeps cutting the interval [0,1][0, 1] of the number line, each time cutting at a uniformly random point in the interval, until the interval is cut into pieces, none of which have length greater than 35\frac35 . The expected number of cuts that Zack makes can be written as pq\frac{p}{q} for pp and qq relatively prime positive integers. Find p+qp + q.