Things continue to begin
Sep. 3rd, 2009 10:48 pmI have to say, I'm still a bit amazed that it's "Here's a one-week crash course, go teach". Come Monday the kids are going to walk into class and I'm going to be an instructor. Somehow. Evidently it works, as, well, this is what they've been doing for quite a while, and they say they get good results with it. They have given us quite a lot of resources, of course.
I found a centipede in my room. Can't say I'm a fan of that. Speaking of my room, I've actually got it to myself for a few days, as my roommate engineered a room swap with someone else who hasn't arrived yet.
More people are arriving, obviously, so we now have quite a few more people for Smash, and yet we're nowhere close to the perpetual Smash game, it seems. Oh well. Also in addition to Kyle who does play Brawl tournaments, apparently we have some first-year who used to. Wow.
Also: Did I by any chance mention, when I visited Michigan for recruitment, a cool math student I met by the name of Aubrey who at the time had a broken wrist from doing parkour? ...no, it seems, I didn't. Well, turns out he lives here! Neat! Except not this semester, because he's going to be in Australia.
That lower bound, as small as it is, is now very close to *actually* proven. After fixing the major bug in my code mentioned below, I realized I had better actually prove the algorithm correct, and I hit a bit of a snag at the case of converting multiplication to addition. Fortunately, addition absolutely sucks compared to multiplication, so this should never be relevant. Unfortunately, I didn't have a proof. Well, I had one, but it seemed like it was possibly circular (though I didn't think the circularity was real); then I realized it was wrong anyway. Fortunately, I now have an actual proof (basically just AM-GM, really[0] :P ) that proves that case mostly irrelevant, and I may not even have to do any recalculation (depends on the exact data; I'll have to check).
So now all that remains is to compile the list of possible exceptions (easy) and then, if I want (which I do), check which ones actually are exceptions. Yay. And then to start writing all this up.
-Harry
[0]So I'm looking at this inequality I need to prove, and I think, how the hell do I do this? And I remember Tom telling me, basically only the inequalities you need are Cauchy-Schwarz and AM-GM. Well, I try a bit of Cauchy-Schwarz and can't get anywhere, but hey! AM-GM does the trick. Yay.
I found a centipede in my room. Can't say I'm a fan of that. Speaking of my room, I've actually got it to myself for a few days, as my roommate engineered a room swap with someone else who hasn't arrived yet.
More people are arriving, obviously, so we now have quite a few more people for Smash, and yet we're nowhere close to the perpetual Smash game, it seems. Oh well. Also in addition to Kyle who does play Brawl tournaments, apparently we have some first-year who used to. Wow.
Also: Did I by any chance mention, when I visited Michigan for recruitment, a cool math student I met by the name of Aubrey who at the time had a broken wrist from doing parkour? ...no, it seems, I didn't. Well, turns out he lives here! Neat! Except not this semester, because he's going to be in Australia.
That lower bound, as small as it is, is now very close to *actually* proven. After fixing the major bug in my code mentioned below, I realized I had better actually prove the algorithm correct, and I hit a bit of a snag at the case of converting multiplication to addition. Fortunately, addition absolutely sucks compared to multiplication, so this should never be relevant. Unfortunately, I didn't have a proof. Well, I had one, but it seemed like it was possibly circular (though I didn't think the circularity was real); then I realized it was wrong anyway. Fortunately, I now have an actual proof (basically just AM-GM, really[0] :P ) that proves that case mostly irrelevant, and I may not even have to do any recalculation (depends on the exact data; I'll have to check).
So now all that remains is to compile the list of possible exceptions (easy) and then, if I want (which I do), check which ones actually are exceptions. Yay. And then to start writing all this up.
-Harry
[0]So I'm looking at this inequality I need to prove, and I think, how the hell do I do this? And I remember Tom telling me, basically only the inequalities you need are Cauchy-Schwarz and AM-GM. Well, I try a bit of Cauchy-Schwarz and can't get anywhere, but hey! AM-GM does the trick. Yay.
