An interesting coincidence: it was recently (2019) discovered that the fastest way to multiply two n-bit integers, in time O(n log n), involves 1729-dimensional Fourier transforms: <a href="https://hal.archives-ouvertes.fr/hal-02070778" rel="nofollow">https://hal.archives-ouvertes.fr/hal-02070778</a>. It is quite surprising that the asymptotically best way to perform such an elementary operation should be tied to Ramanujan’s famous taxicab number.<p>(Technically, it works for any number of dimensions >= 1729, but the proof fails for dimensions less than that. Future work might bring the bound down, or better explain why that bound is necessary.)