I am reading Computer Science: An Overview Eleventh Edition By J. Glenn Brookshear
I believe this book was once assigned as optional reading material for CS50x
A typical dictionary in a word processor contains approximately 25,000 entries, which means an individual entry can be identified by an integer in the range of 0 to 24,499. This means that a particular entry in the dictionary can be identified by a pattern of only 15 bits.
How does the logic/math work on this?