In 1951, Robert M. Fano, a professor at MIT, assigned his information theory students a deceptively simple-sounding problem as a final term paper: find the most efficient way to represent numbers, letters, or symbols using binary code.
What he didn't reveal was that this was an open problem - one that even Fano himself and Claude Shannon had been wrestling with for years.
One of Fano’s students, David A. Huffman, rose to the challenge. He not only solved the problem but discovered a theoretically optimal solution under certain constraints. This solution - now known as Huffman coding - is the basis for many modern file compression algorithms, including those used in ZIP, JPEG, and MP3 formats.