Create an automaton with at most six states that will determine whether or not a binary number is a multiple of 3 (read least-significant-digit first). Many people succeded with six. A number figured out five. One other student had an answer with four, but mine had but 3. (I actually liked the four one better, it kept track of equivalence mod 3 instead of just equivalence to 0 like mine). I am the only Undergrad in the class.
IQP still sucks the big cock. Not writing AT FUCKING ALL, but at this point my role is largely editorial. I really hope the Senior Committee Meeting conflicts with my IQP meeting so I can skip it.
PS - Doc sends his best.