Actually that's the maximum number of guesses needed (assuming you're aware of the binary search concept), not the minimum. The minimum is 1. This is a trick question and you have failed the first interview question and have been shown the door... Good illustration of why the questions are, in fact, ridiculous unless they are just used as a "jumping off" point for discussion (which is rarely what happens, IME).
But of course, the safe answer would be to explain it in the verbose way and not just shout out "TEN".
The a-ha solution to this puzzle is to realize that every participant but one has to lose exactly once. Each game has only one loser, so you need 5622 games.
Your method overestimates the number of games needed because you start counting at 0. (Think about the simple case where N=2.) Even if you started counting at 1, your method wouldn't in general give an exact answer (and would typically under- or over-estimate depending on whether you started counting at 1 or 0, respectively), but if you had a nice power of two (say, 2^d on the nose), then the sum from 1 to d of 2^(d-k) would give you exactly 2^d -1, which agrees with the a-ha answer.
Thus the probability of you correctly guessing the correct number within any finite number of guesses is zero.
Seems to me like they're asking for integers, but suppose they mean reals. Depending on the distribution, you can still guess the right number with positive probability. It could be dominated by 500!
But if the answer is binary then the question is "is it larger than 500" and then no, you can't ever be right in one guess.
http://en.wikipedia.org/wiki/Random_close_pack#For_spheres
IIRC, there's a passage in Conway and Sloane's comprehensive review of sphere-packing (the same Sloane as EIS, http://oeis.org/)
http://www.amazon.com/gp/product/0387985859/ref=dp_proddesc_...
that says "much of our effort in this book is to find a packing, in arbitrary spaces, that is as efficient as the simple tetrahedral packing is in R^3".
Ah, but who said anything about the balloons being full?
Log_2 1000.
"How many balloons would fit in this room?"
.64 * length * width * height (distance measurements roughly in feet).
"How do you weigh an elephant without using a scale?"
Displacement of the zoo environment's pool.
"If you had 5,623 participants in a tournament, how many games would need to be played to determine the winner?"
Let d = Log_2 N. Sum 2^(d-k) for k = 0 ... d
""You have three boxes. One contains only apples, one contains only oranges, and one contains both apples and oranges. The boxes have been incorrectly labeled so that no label accurately identifies the contents of any of the boxes. Opening just one box, and without looking inside, you take out one piece of fruit. By looking at the fruit, how can you immediately label all of the boxes correctly?"
The fact that no label is correct reduces the degrees of freedom by one, making the problem solvable.
"How many ..."
The packing efficiency of randomly organized spheres is .64. Know this number. Fear it.