De-Mystifying the Integer Multiplication Algorithm

In class, we saw an O(nlog23) time algorithm to multiply two n bit numbers that used an identity that seemed to be plucked out of thin air. In this note, we will try and de-mystify how one might come about thinking of this identity in the first place.