Problem:
Let be a set of intervals defined recursively as follows:
- Initially, is the only interval in .
- If and , then both .
(Note that can contain intervals such as , which contain a single integer.) An integer is chosen uniformly at random from the range . What is the expected number of intervals in which contain ?
, 2020
Solution
Solution:
The answer is given by computing the sum of the lengths of all intervals in and dividing this value by , where the length of an interval is given by . An interval may be categorized based on how many times must be split to attain it. An interval that is derived from splitting times will be called a -split.
The only -split is , with a total length of . The -splits are and , with a total length of . As long as none of the -splits have length , the -splits will have the same total length. Since the length of the intervals is reduced by half each time (rounded down), we find that the sum of the lengths of the -splits is for .
Note that the -splits consist of intervals of length and intervals of length . Then the -splits consist of intervals of length , with total length . The total interval length across all splits is equal to , so our answer is