I use FizzBuzz as a warm-up question on interviews, so I have had time to ponder it quite a bit. As a thought experiment, I wondered if I could come up with an implementation that does not depend on run-time multiplication (or its inverse, division). I decided a very readable approach would be to use a circular look-up table.
There is a part of my brain that clings to the idea that the ALU is always the bottleneck. Though I know this isn't true, it's still nice to experiment with constraining myself on simple problems such as FizzBuzz, especially when I can find an elegant solution underneath.