I have loved Mathematics ever since I can remember - its interesting patterns, astonishing results, and elegant proofs. As a kid, I spent a lot of time playing with numbers, finding more and more silly patterns, and looking for the rules that would explain them. I would spend hours at end on my explorations, like a child trying to collect the prettiest sea shells on the beach.
The more I learnt, the more I wanted to explore, but I never really dived into the depths; I just waded as deep as my basic education would let me. And to this day, I'm still the child who gets excited by pretty sea shells on the shore of Mathematics. Let me show you a typical sea shell I found the other day, but first I'll tell you the story of how I found it.
It's a long story, which begins when I was checking some calculations and computed, among other things, the squares of 119 and 169. I noticed that 1192 + 1202 = 1692, and I started thinking about other such examples.
One generalization is of course Pythagorean triplets
a2 + b2 = c2
and we already know how to generate them using
a = m2 - n2, b = 2mn, c = m2 + n2
For m = 12, n = 5, we get our equation above.
But I was now considering another possible generalization, of this form:
Sum of (m + 1) consecutive squares on the left side equals sum of m consecutive squares on the right. Some examples:
For m = 1:
202 + 212 = 292
1192 + 1202 = 1692
For m = 2:
1082 + 1092 + 1102 = 1332 + 1342
For m = 3:
212 + 222 + 232 + 242 = 252 + 262 + 272
A further generalization is to take squares with a constant difference d, instead of consecutive squares. Some examples:
For d = 2, m = 3:
92 + 112 + 132 + 152 = 122 + 142 + 162
1652 + 1672 + 1692 + 1712 = 1922 + 1942 + 1962
For d = 5, m = 2:
82 + 132 + 182 = 142 + 192
A little investigation shows that given any m and d, there is a solution for every integer p such that m(m + 1)p(p + d) is a square. For the case where d = 1 i.e. for consecutive squares, this means that given any m, there is a solution for every integer p such that the product of mth and pth Triangular numbers is a Square. How pretty is that!
Let r = p(m + 1), s = m(p + d), and z = gcd(r, s)
Let a = sqrt(r/z), b = sqrt(s/z)
Let k = zb(a + b) - md, n = za(a + b)
Then the sum of squares of the (m + 1) numbers
k, k + d, k + 2d, ..., k + md
equals the sum of squares of the m numbers
n + d, n + 2d, ..., n + md
So, for example, d = 2, m = 15, p = 3 gives us that the sum of squares of odd numbers from 105 to 135 equals the sum of squares of even numbers from 110 to 138.
Also, d = 1, m = 1, p = 49 gives us the equation we started with, 1192 + 1202 = 1692.
And this finally brings us to the sea shell that I was talking about.
For d = 1, and for any m, putting p = m gives us:
The sum of first (m + 1) squares starting at m(2m + 1) equals the sum of next m squares.
Thus, for m = 1, we get
32 + 42 = 52
For m = 2,
102 + 112 + 122 = 132 + 142
For m = 3,
212 + 222 + 232 + 242 = 252 + 262 + 272
For m = 4,
362 + 372 + 382 + 392 + 402 = 412 + 422 + 432 + 442
For m = 5,
552 + 562 + 572 + 582 + 592 + 602 = 612 + 622 + 632 + 642 + 652
And so on, ad infinitum.
That's a nice little sparkling sea shell, isn't it? :)
While looking at the equation 1192 + 1202 = 1692, I remembered that 82 + 152 = 172, and I realized that I could rewrite the above equation in a more pleasing form, as
(72x82) + (82x152) + (152x72) = (132x132)
Why do I like it? Because it is of the form
(a x b) + (b x c) + (c x a) = (d x d)
where a, b, c, and d are squares of integers! The left hand side of this equation has a sweet symmetry, and I'm a total dope for symmetry. A friend pointed out that we could just take square root on both sides, and get
72 + 82 + 7x8 = 132
and that using the same idea as above, we can actually write
72 + 82 + 7x8 = 32 + 42 + (3x4)2
which was unexpected to me, and not as pleasing; I felt that it was not as aesthetically neat as the previous one. Beauty lies, my friend reminded me, in the eyes of the beholder.
No comments:
Post a Comment