Finding the order of the multiplicative group (mod n)...zuh? SEP 17 2002
Weblogs are usually pretty easy for readers to get into. Lance Fortnow's Computational Complexity Web Log is probably the most difficult-to-read weblog I've ever come across. But that's OK because if you're into computational complexity, it's just the thing.
Speaking of which, I need to clean some things. My car mostly. The Web to the rescue once again: howtocleananything.com. I'm not sure if it'll be helpful or not, but I love that it exists. (Related: This to That gives advice on how to glue this thing to that thing.)