What I mean by modulo
This is an idea that I use often but don't express, because it's a little technical. However, I'm also really excited I am about it, so I'll try to explain it in this blog post. In math, modulo—or "mod"—is an operation that gives the remainder when one integer is divided by another. In other words, a (mod n) = b , means that when you divide a by n , the remainder is b . This can also be stated as a and b are the same—except for differences accounted for or explained by n . So for example, 5 mod 2 = 1 and 2 mod 5 = 2 . The shape of this operation is taking something out and looking at what's left. The question that I am asking myself when I try to "mod" something out of my experience is "What is there other than this?," and because the answer is always "a lot," I employ several different strategies for quantifying the a lot, such as looking for the holding (i.e., "what's my relationship to this?"), pr...