When you store data on a computer, you have to retrieve that data. I/O is the biggest performance issue on any computer. So you store the key and the location in an index (a lookup), or you hash the key to a specific disk location and try to locate the record Mathematically.   Now the number of records a disk can hold is determined by the format. On hashing if the number of records a disk can hold corresponds to a 4K + 3 Prime, the number of searches is dramatically reduced. Who would have figured, it took a lot of work to prove that out in the earliest days of computing with Relational databases. I once published a software algorithm for CRC-16 error detection and correction that made a chip obsolete.   Odd ball ideas can have some interesting twists for sure. Still don't understand the anger on a fun post with a rather odd idea. I like Math's odd ideas.