 Given an input "k", compute "r"(2"k"+1).If "k" were to appear in the sequence ("a""i"), this would cause the sequence ("q""i") to increase by 2−"k"-1, but this cannot happen once all the elements of ("q""i") are within 2−"k"-1 of each other.Thus, if "k" is going to be enumerated into "a""i", it must be enumerated for a value of "i" less than "r"(2"k"+1).