Try this problem from Duke Math Meet 2009 Problem 6 based on Count of Sparse Subsets. This problem was asked in the team round. Call a set S sparse if every pair of distinct elements of S differ by more than 1. Find the number of sparse subsets (possibly empty) of {1, 2, . . […]