We apply bisection to the interval [0,1][0, 1][0,1]. What is the minimum number of cuts needed to get an interval of length strictly less than 10−310^{-3}10−3?
