A riddle from The Riddler where brute-force simulation does not pay: For a given integer N, pick at random without replacement integers between 1 and N by prohibiting consecutive integers until all possible entries are exhausted. What is the frequency of selected integers as N grows to infinity? A simple implementation of the random experiment