Estimate how many checks are required if our dictionary contains 118,000 words.
2n - 1 = 118 000
---> 2n = 118 001
---> log( 2n ) = log( 118 001 )
---> n·log( 2 ) = log( 118 001 )
---> n = log( 118 001 ) / log ( 2 )
---> n = 16.848 ...
---> n = 17
