It’s been a while since there has been any math on the blog, so I figured I’d share a recent (trivial) mathematical fact I came upon while passing the time. A less noble goal is that I hope some of you will find it interesting enough to think about it for a while. In other words, I’m too lazy to keep working on it but I hope some others will fall into my trap and let me know the answer.
Several nights ago, a friend of mine was procrastinating on the Internet — something I hear people do from time to time. He chanced upon a random (nerdy) web comic where the author declared that
I think basically everyone knows the Pythagorean triple
but I had never come across (or wondered privately) whether the pattern continued. A small group of us got together to determine an answer. Indeed, one can find consecutive integers whose squares add up to the sum of the next
squares. For example,
In general, the problem is to find which solves the equation
Of course must depend on
. Solving this equation is pretty simple using the following identities:
Using these identities correctly in our equation produces the polynomial
Plugging in produces
which forces the choice , i.e.
. So, indeed, we can find a sequence of
consecutive integers so that the squares of the first
of them add up to the sum of the squares of the last
.
Now, it’s also true that
It is an exercise left to the reader to figure out the general pattern for cubes, if it exists, and then generalize. Homework is due next week.
February 23, 2009 at 9:40 am |
x^4/4+x^3/2+x^2/4=(x(x+1)/2)^2
February 24, 2009 at 12:31 am |
Oooooh, cool!
March 3, 2009 at 2:44 am |
Just dropping by.Btw, you website have great content!
______________________________
Professionally Written And Inspirational Wedding Speeches And Toasts…
March 9, 2009 at 3:04 pm |
Unfortunately, there’s no solution to i^3 + (i+1)^3 + (i+2)^3 + (i+3)^3 = (i+4)^3 + (i+5)^3 in integers; the polynomial is irreducible. This remains true if we add an extra term on the LHS. I think we should only expect finitely many such cubic identities; the resulting Diophantine in k and m probably has genus 1.
March 11, 2009 at 6:26 am |
No link to http://abstrusegoose.com/63 ?
March 12, 2009 at 12:43 pm |
How do you ascertain that m|k ?
March 18, 2009 at 12:57 pm |
I know that this is off topic but I am host of a mathematics podcast
Combinations
and Permutations that I think that your readership may find
interesting. On the last episode we have covered the four color theorem and some new ideas for mathematical journals. You can find the podcast on iTunes or through our host. Give us a listen, you
will not be disappointed
March 23, 2009 at 11:32 pm |
That link to abstruse goose was actually what started this thing. I was reading the whole archive of it in an attempt to avoid work, saw that formula, and then succeeded in avoiding more work by working on it. The other Peter and I were talking about it for a bit, and afterwards we both came up with this answer.
March 25, 2009 at 4:40 pm |
Qiaochu, I was allowing that the pattern no longer had to be anything like the original. For instance, perhaps one cannot guarantee that all the terms will be consecutive — i.e. maybe the cubes on the left and right sides of the equation may be separated by some large gap. Also the number of terms on each side might not be linearly related any longer.
And thanks for the link Peter. I wasn’t sure what comic it was that started the whole discussion in the first place.
March 25, 2009 at 6:55 pm |
Vineet,
There are quite a few arguments for why we know that
is what it is. I simply made a quick guess when I was working on the problem and it turned out to be correct. But here is an answer that might be more to your satisfaction: note that
is a quadratic polynomial in
where the coefficients are
,
, and
. Applying the quadratic formula (and applying some algebra), one arrives with two solutions, the one derived in the post, and
which we don’t really want to consider anyway — it is silly because the terms squared in each sum will end up being symmetric around zero.
March 26, 2009 at 1:48 am |
@Peter
Yeah, got it. k = m(m+2), and hence k=(alpha)m.
I actually wrote my query wrong, I meant m|k.
Thanks.
March 31, 2009 at 10:47 pm |
Nice post!
May 11, 2009 at 4:26 am |
[...] Fun With Sums Peter Luthy at The Everything Seminar [...]
August 17, 2010 at 1:51 pm |
Hi Peter,
HOW LONG HAS IT BEEN SINCE WE HAD OUR LAST COCKTAIL IN MANHATTAN? Well over 10 years I would guess. How have you been? hOPEFULLY YOU ARE THE PETER WHO WAS MY SALES REP MANY HAPPY YEARS AGO
BUNNY