Connections in Math: the two kinds of random

This article explores the concept of compression in information theory, specifically the difference between statistical compression (Shannon entropy) and structural compression (Kolmogorov complexity). The author uses the example of the digits of pi to illustrate how statistical compression can be misleading and how structural compression reveals the underlying simplicity of the digits.