Just curious, but suppose I have a set of numbers, 1 through 15, in numerical order. Is there an equation which can determine the number of searches it would take using a binary search to find a specific item? i.e., I know it takes 4 searches if I am searching for the number 1, but if I want 5? 14? Is there a better way of doing this than w/ pencil and paper?