S2E7: Two eggs versus one building

In this episode we solve our first computer science problem in which we are asked to find the smallest number and the testing scheme of egg drops which can determine with absolute certainty the lowest floor of 100-story building a drop from which these eggs will not survive and will shatter into pieces. By now this problem is quite famous. To the best of our knowledge, in, at least, the Western literature, this problem first appeared in the 1992 book "Where Did The Bicycle Go?" by J. Konhauser and company and, later on, this same problem was published in 2011 in the book "Algorithmic Puzzles" by Anany and Maria Levitin, see the page 63 and the problem number 121 in that book. However, the reason why we would like to bring this problem to your attention is because we think that using that problem as the fodder, it is quite educational and illustrative to see how the "Reverse Order" problem-solving approach can be applied to the process of searching for solution of a computer science problem, which is a deviation from our traditional mathematics-only menu. Also, make sure to listen to my presentation of what I refer to as "Restricted Binary Notation" starting at 01:25:51.