2017 PUMaC Team 17
Source:
September 20, 2019
combinatorics
Problem Statement
Zack keeps cutting the interval 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 . The expected number of cuts that Zack makes can be written as for and relatively prime positive integers. Find .