Home > math, math education > I accept mathematical bribes

## I accept mathematical bribes

March 30, 2015

Last Friday I traveled to American University and gave an evening talk, where I met Jeffrey Hakim, a mathematician and designer who openly bribed me.

Don’t worry, it’s not that insidious. He just showed me his nerdy math wallet and said I could have one too if I blogged about it. I obviously said yes. Here’s my new wallet:

It’s made of the same kind of flexible plastic they use on the outside of buildings. Or something. I expect it will last for many years.

You might notice there is writing and pictures on my new wallet! They are mathematical, which is why I don’t feel bad about accepting this bribe: it’s all in the name of education and fun with mathematics. Let me explain the front and back of the wallet.

The front is a theorem:

Here’s the thing, I’ve proven this. I have even assigned it to my students in the past to prove. We always use induction. This kind of identity is kind of made for induction, no? Don’t you think?

Well Jeffrey Hakim had an even better idea. His proof of Nicomachus’s Theorem is represented as a picture on the back of the wallet:

It took me a couple of minutes to see why this is a proof.

Here’s what I’d like you all to do: go think about why this is a proof of the above identity. Come back if you can’t figure it out, but if you can, just go ahead and pat yourself on your back and don’t bother reading the rest of this blogpost because it’s just going to explain the proof.

I’ll give you all a moment…

OK cool here’s why this is a proof.

First, convince yourself that this “pattern,” of building a frame of square boxes around the above square, can be continued. In other words, it’s a square of 4 1×1 boxes, framed by 2×2 boxes, framed by 3×3 boxes, and so on. It could go on forever this way, because if you focus on one side of the outside of the third layer, there are 4 3×3 boxes, so length $4 \cdot 3$, and we need it to also be the length inside the 4th frame, which has 3 boxes of length 4. Since $4\cdot 3 = 3\cdot 4$, we’re good. And that generalizes when it’s the $n$th layer, of course, since the outside of the $n$th layer will have $n+1$ boxes, each of length $n,$ making the inside of the $n+1$st have $n$ boxes, each of length $n+1$.

OK, now here’s the actual trick. What is the area of this box?

I claim there are two ways to measure the area, and one of the ways will give you the left hand side of Nicomachus’s Theorem but the other way will give you the right hand side of Nicomachus’s Theorem.

To be honest, it’s just one bit more complicated than that. Namely, the first way gives you something that’s 4 times bigger than the left hand side of Nicomachus’s Theorem and the second way gives you something 4 times bigger than the right hand side of Nicomachus’s Theorem.

Why don’t you go think about this for a few minutes, because the clue might be all you need to figure it out.

Or, perhaps you just want me to go ahead and explain it. I’ll do that! That’s why I got the wallet!

OK, now imagine isolating the top right quarter of the above figure. Like this:

That’s a square, obviously, so its area is the square of the length of any side. But if you go along the bottom, the length is obviously $1 + 2 + 3 + 4,$ which means the area is the square of that, $(1 + 2 + 3 + 4)^2.$

And since we know we can generalize the original figure to go up to $n$ instead of just 4, one quarter of the figure will have area $(1 + 2 + 3 + 4 + \dots + n)^2,$ which is to say the entire figure will have area $4(1 + 2 + 3 + 4 + \dots + n)^2.$

That’s 4 times the right-hand side of the theorem, so we’re halfway done!

Next, we will compute the area of the original figure a different way, namely by simply adding up and counting all the differently colored squares that make it up. Assume that we continue changing colors every time we get a new layer.

So, there are 4 1×1 squares, and there are 8 2×2 squares, and there are 12 3×3 squares, and there are 16 4×4 squares. In the generalized figure, there would be $4n$ $n\times n$ squares.

So if you look at the area of the generalized figure which is all one color, say the $n$th color, it will be of the form $4\cdot n \cdot n^2 = 4 \cdot n^3.$

That means the overall generalized figure will have total area:

$4 \cdot 1^3 + 4 \cdot 2^3 + 4 \cdot 3^3 + \dots + 4 \cdot n^3 = 4 \cdot (1^3 + 2^3 + 3^3 + \dots + n^3).$

Since that’s just 4 times the left-hand side of the theorem, we’re done.

Notes:

• this would be a fun thing to do with a kid.
• there’s more math inside the wallet which I haven’t gotten to yet.
• After staring at the picture for another minutes, I just realized the total area of the whole (generalized) thing is obviously $(n\cdot (n+1))^2,$ which is to say that either the left-hand side or right-hand side of the original identity is one fourth of that. Cool!
Categories: math, math education
1. March 30, 2015 at 8:44 am

There is a stupid, but universal way, “to prove them all” since the LHS and RHS are polynomials in $n$ of degree four (this is the hard bit, but sufficient to be done once and forever)), check for $n = 1, 2, 3, 4, 5$

Liked by 1 person

• March 30, 2015 at 8:49 am

True, and similar to a question Aunt Pythia answered a couple of days ago.

Liked by 1 person

• March 31, 2015 at 11:51 am

Sorry for my ignorance – who is Aunt Pythia?

Like

• March 31, 2015 at 6:21 pm

Slightly easier is to check it for n=0,1,2,3,4.

Like

2. March 30, 2015 at 9:02 am

Nice picture, I never knew this identity was named after a Greek guy! For what it’s worth, I found the sum of cubes part slightly more intuitive when you focus on just one quadrant of the picture. You just have to separate out odds and evens. The odds are easy: one 1 by 1 box, three 3 by 3 boxes, five 5 by 5 boxes, etc. Now look at the evens: you have one whole 2 by 2 box along with two half-2 by 2 boxes, so two 2 by 2 boxes total. Then you have three whole 4 by 4 boxes along with two half-4 by 4 boxes (so four total), and so on.

Liked by 1 person

3. March 30, 2015 at 9:58 am

My apology for double posting.

Liked by 1 person

4. March 30, 2015 at 10:43 am

Nice. Thanks for making an exception for this item and, hopefully, many similar ones in the future.

I don’t know what you meant, exactly, by “this would be a fun thing to do with a kid.” I feel pretty confident advising most readers that it is against the law in most states to make a child into a wallet, mathematically decorated or otherwise. I checked and, surprisingly, it is even illegal in Canada (though maybe the beauty of the result illustrated is factored into sentencing up there?)

To be a nit-picky old fart, I think this still involves induction to formally extend it to arrays of all sizes. Also, I get more understanding of why the result holds by imagining the blocks from the RHS regrouping themselves to form cubes. Which also involves induction to extend, of course.

Liked by 1 person

5. March 30, 2015 at 1:19 pm

Another proof I really like:
Express the RHS as $\binom{n+1}{2}^2$. Then the RHS counts the number of rectangles that fit inside an $n\times n$ grid (by specifying the 4 boundaries).

To see that the LHS counts the same quantity is a bit trickier. The key is that $k^3$ counts the number rectangles whose minimum side length is exactly $n+1-k$. I don’t know yet of a succinct way to describe what each of the factors of $k$ count, but nevertheless, I like the picture, and I love the theorem.

Awesome post, Cathy!

Liked by 1 person

6. March 30, 2015 at 11:16 pm

Are there other instances of when power sums are powers of other powers sums? Or what are all the algebraic relations between the power sums? By power sum I mean sum of a particular power of the first n integers. I recall there are newtons identities but I think they involve the symmetric polynomials.

Like

7. March 31, 2015 at 11:44 am

Amazing wallet! The proof on the wallet is really nice.

Like

8. March 31, 2015 at 5:52 pm

Nice.