One thing that was missing was the beauty and skill the Kaplans bring to this event each year. (There was a health problem, and rest needed to recuperate, so they couldn't make it.) I expect them to be back - as good as ever - next year, and hope to

*once again*have the best time

*ever*next July.

**Mornings**

We got to all participate in a big math circle together each morning.

On

**Monday**, Sam Lichtenstein led us in an exploration of how much overhang you can get on a stack of dominoes. I had seen images of this sort of thing before, so I didn't start out hugely excited. But as we worked on it, my interest and excitement grew. I never felt like I had complete clarity on the physics involved, but we did come up with a mathematical solution that satisfied me.

On

**Tuesday**, Nathan got us working on a puzzle that started out with a hydra on our lawn. You probably know that if you cut off a hydra's head, it will grow two heads in place of the one. Our lawn began at the bottom left corner of a chessboard with an infinite number of spots upward and to the right. The hydra was in that first spot, and when we chopped its head off, it grew two new ones - one to its right, and one just above it. We could chop off one of those and again get heads to the right and above that one. The other head was now blocked, though.

We used Othello boards to model the situation, and had lawns as shown. We got those two squares cleared and worked hard to clear the next diagonal. No one had yet done it when we gathered back together to discuss it. We went back and forth enthusiastically between trying to figure out how to do it, and trying to figure out a way to prove that we couldn't do it. Seems to me that's one sign of a good problem. A few of the high school age students attended morning sessions, and one of them wrote up a lovely solution to this problem - very clear and lively, with excellent illustrations.

On

**Wednesday**, Amanda led us in exploring Rational Tangles. Many of us had played with this amazing puzzle/game before, but I think everyone loved having another chance to explore. You need four volunteers, two ropes, and a caller. The dancers start, each holding a rope end, with the ropes parallel. On "turn 'em round", the group rotates 90 degrees, so everyone is in the position where the person to their left had been standing. On "do si do", the person at the back left holds up their rope and comes forward, with the person at the front left going under and to the back. The ropes get all tangled up after a few random calls. And if you know the number secret, you can

*always*get them untangled! The mathematical thought that goes with this is delightfully tangled.

On

**Thursday**, Amanda led us through some interesting number puzzles. A number is

*one*derful if it it composed of all ones in some (integer) base. 3 is

*one*derful because it is represented as 11 in base two. Which numbers are

*one*derful? Along with this exploration, we looked at divisibility rules:

*Why*is a number divisible by 9 when its digits add up to a multiple of 9? What are the divisibility tests for 2, 3, 4, 5, and 6, and why do they work? 7 is the first number that has no really simple divisibility test. We came up with a great test together, by using modular arithmetic.

Suppose we have a number abc (where a, b, and c are the digits). Algebraically, our number = 100a+10b+c. Modular arithmetic is a way to pay attention only to the remainders. 100 is equivalent to 2 mod 7, since 100 = 7*14+2. (This is usually written using a three bar equal sign. I'll use a regular = with a 7 subscript for the rest of this post.) So 100a+10b+c =

_{7}2a+3b+c. Let's look at just two digits. 10a+b =

_{7}3a+b. If we multiply both sides by two, we change what we're looking at, but we don't change whether or not it's a multiple of 7. So now let's look at 6a+2b =

_{7}-a+2b = -1*(a-2b). Once again, we can ignore the multiplier if we're just interested in whether or not we have a multiple of 7. One more step: Imagine a number with many digits, where the last digit is b. Use an A to represent the rest, so Ab means 10A+b. The same logic we used above applies, and if A-2b is a multiple of 7, so is the original number. (And if one is not a multiple of 7 the other also is not.)

So our test has us take off the last digit, multiply it by 2, and subtract it from the number formed by the remaining digits. Is 123456789 a multiple of 7? 12345678-18 = 12345660, 1234566 -2*0 = 1234566, 123456-12 = 123444, 12344-8 = 12336, 1233-12 = 1221, 122-2=120, which is not divisible by 7. That means 123456789 is not a multiple of 7. Wild! (Did I do that right? Please correct me if I messed up.)

I'm going to end this too long post here. Maybe later I can describe Friday's circle, and some of the evening entertainments.

I remember working on a proof of the test of divisibility by 7 at the session I attended 3 or 4 years ago. I kept getting hung up on the same thing repeatedly. A few days after I left, I sat down, started fresh, and nailed it.

ReplyDeleteIf memory serves, once you get the structure of the 7 test clear, it can be used to develop divisibility tests for other prime divisors. It's been a while since I've looked at that, however.

sounds awesome! wish i had been there to see rational tangles. i have read about that a few times now and still need to see it to fully get it!

ReplyDeleteBowman, you'll be at twitter math camp, right? You all could play with it there. Kate has seen it done. Take a few ropes. Or if it's started already, buy some clothesline (not the best rope for this, but doable, I'd think) at a Walgreens or something. I would be tickled to hear about you all playing with this.

ReplyDeleteBowman, did you get to do it at TMC? I think I read that Fawn did it there?

ReplyDelete