You are on page 1of 6

Home Page

Title Page

A Pattern of Signs
Shailesh A Shirali
math@rishivalley.org

July 25, 2011

Page 1 of 6

Go Back

Abstract
Full Screen

We describe an amusing trail involving a pattern of signs. When applied to the sequences of squares, cubes, etc, the patterns yield unexpected results which look quite magical at rst sight. But the underlying algebra is very simple.

Close

Quit

Home Page

Take any four consecutive integers a, b, c, d. Then it is obvious that a + d = b + c; that is, the sum of the rst and last number equals the sum of the middle two numbers Let us write this relation as +a b c + d = 0. Note the sequence of signs: +, , , + . We shall write the above statement in the following form: The sign sequence +, , , + yields a sum of 0. if applied to any 4 consecutive integers

Title Page

For example, if the 4 consecutive integers are 12, 13, 14, 15 we have: +12 13 14 + 15 = 0. Now reverse all the signs in this string; we get the string , +, +, . Concatenating these two strings of length 4 together we get the following string:
Page 2 of 6

+, , , +, , +, +, , of length 8. Now here is a surprising fact:

Go Back

The sign sequence +, , , +, , +, +, if applied to any 8 consecutive squares yields a sum of 0.


Full Screen

Close

For example, take the 8 consecutive squares 9, 16, 25, 36, 49, 64, 81, 100. We have now: +9 16 25 + 36 49 + 64 + 81 100 = 0. Please verify this statement. Then try it out on other collections of 8 consecutive squares.

Quit

Home Page

Now take the string +, , , +, , +, +, and reverse all its signs; we get the string , +, +, , +, , , + . Concatenating these two strings of length 8 together, we get the following string: +, , , +, , +, +, , , +, +, , +, , , + , of length 16. Here is the next surprising fact: The sign sequence +, , , +, , +, +, , , +, +, , +, , , +

Title Page

Page 3 of 6

if applied to any 16 consecutive cubes yields a sum of 0. Here is an example: take the 16 consecutive cubes 27, 64, 125, 216, 343, 512, 729, 1000, 1331, 1728, 2197, 2744, 3375, 4096, 4913, 5832. Applying the sign sequence just given to these numbers we get: + 27 64 125 + 216 343 + 512 + 729 1000 1331 + 1728 + 2197 2744 + 3375 4096 4913 + 5832 = 0.

Go Back

Full Screen

Close

Try it out for other collections of 16 consecutive cubes! I guess you will be able to guess what comes next in this sequence of statements .... Why do we have such a pattern?

Quit

Explanation
Home Page

Dene f1 by f1 (n) = n (n + 1); obviously, f1 (n) = 1 for all n. Hence f1 (n) = f1 (n + 2),

Title Page

i.e., f1 (n) f1 (n + 2) = 0, which yields: n (n + 1) (n + 2) + (n + 3) = 0. Note a corollary to this: If g(n) is any linear expression in n, then the quantity g(n) g(n + 1) g(n + 2) + g(n + 3)
Page 4 of 6

is identically 0. The reason should be clear.

The sequence of squares


Go Back

Next, let f2 (n) = n2 (n + 1)2 (n + 2)2 + (n + 3)2 . Note that we have used the pattern of signs obtained at the end of the preceding step. It is obvious what will be the outcome of this formulation, even without doing any computation: the n2 terms will cancel out, while the linear terms will yield 0 by virtue of the comment made just above; so f2 (n) will reduce to a constant, whose value will be 12 22 + 32 = 4. Hence we have this identity: n2 (n + 1)2 (n + 2)2 + (n + 3)2 = 4.

Full Screen

Close

Quit

From this relation we get, for any n,


Home Page

n2 (n + 1)2 (n + 2)2 + (n + 3)2 = (n + 4)2 (n + 5)2 (n + 6)2 + (n + 7)2 , implying that the following relation is true for all n:

Title Page

n2 (n + 1)2 (n + 2)2 + (n + 3)2 (n + 4)2 + (n + 5)2 + (n + 6)2 (n + 7)2 = 0. As earlier, we have a corollary which follows naturally: If h(n) is any quadratic expression in n, then the quantity h(n) h(n + 1) h(n + 2) + h(n + 3) h(n + 4) + h(n + 5) + h(n + 6) h(n + 7) is identically 0.
Page 5 of 6

The sequence of cubes


Next we move the cubic case; let

Go Back

f3 (n) = n3 (n + 1)3 (n + 2)3 + (n + 3)3 (n + 4)3 + (n + 5)3 + (n + 6)3 (n + 7)3 . Note that we have used the pattern of signs obtained at the end of the preceding step. As earlier, it is obvious what will be the outcome of this formulation, even without doing any computation: the n3 terms will cancel out; the quadratic terms will yield 0 by virtue of the comment made just above; and so will the linear terms. So f3 (n) will reduce to a constant, whose value will be 13 23 + 33 43 + 53 + 63 73 = 48. Hence we have this identity: f3 (n) = f3 (n + 8),

Full Screen

Close

Quit

and so:
Home Page

n3 (n + 1)3 (n + 2)3 + (n + 3)3 (n + 4)3 + (n + 5)3 + (n + 6)3 (n + 7)3 (n + 8)3 + (n + 9)3 + (n + 10)3 (n + 11)3 + (n + 12)3 (n + 13)3 (n + 14)3 + (n + 15)3 = 0. It is obvious from this derivation that the process can be continued indenitely. K

Title Page

Page 6 of 6

Go Back

Full Screen

Close

Quit

You might also like