Thank You for your continued support and contributions!

Your math is beyond me.

In this case (though not in general) we can assume that the object of our search exists in the set we're searching. So, a set with only one member needs to be searched zero times to find a particular member (there's only one!).

Page created in 0.086 seconds with 50 queries.