Differences of powers of consecutive integers

Patrick Vennebush of Math Jokes 4 Mathy Folks recently wrote about the following procedure that yields surprising results. Choose some positive integer n. Now, starting with n+1 consecutive integers, raise each integer to the nth power. Then take pairwise differences by subtracting the first number from the second, the second from the third, and so on, resulting in a list of only n numbers. Do the same thing again, resulting in n-1 numbers, and repeat until you are left with a single number.

For example, suppose we choose n=4, and start with the five consecutive integers 23, 24, 25, 26, 27. We raise them all to the fourth power, giving us


Now we take pairwise differences: 331776 - 279841 = 51935, then 390625 - 331776 = 58849, and so on, and we get the new list


Repeating the difference procedure gives




OK, so we get 24. So what?

Well, if you try enough examples, you may notice a surprising pattern. I’ll let you play with it for a while. Over the course of a few future posts I’ll explain the pattern and prove that it always holds—but the proof will be a really cool combinatorial one, with pretty pictures!

About Brent

Associate Professor of Computer Science at Hendrix College. Functional programmer, mathematician, teacher, pianist, follower of Jesus.
This entry was posted in arithmetic, pattern and tagged , , , , . Bookmark the permalink.

16 Responses to Differences of powers of consecutive integers

  1. venneblock says:

    I can’t wait to see your proof. But mostly, I’m psyched to use \LaTeX in this reply. I’m really rusty, though; let me test my powers of recall and try a joke:
    \frac{111111111}{9:53 p.m.}

    • Brent says:

      To use \LaTeX you have to write something like $ latex \sqrt{\pi}$ but without the space after the initial dollar sign, that is, just stick the word “latex” right after the opening dollar sign.

    • Brent says:

      Hmm, I don’t get it… but don’t tell me yet…

      • venneblock says:

        This sentence is a test for this whole \LaTeX thing. \sqrt{-1} like it!

        As for the joke, no spoiler yet — I’m hoping you find a solution to it that is as cool as the one you’ve promised for this problem!

      • venneblock says:

        Let me know when you need a hint. But I’ll probably hold off on relieving the suspense until you post the pretty pictures you promised.

  2. A combinatorial proof with pretty pictures!? Yay!

  3. Playing with Wolfram Alpha and using x^4 to start, I see that regardless of x, the first of the n + 1 consecutive integers (in this case with n = 4), the last pair will have a difference of 24, because the repeated pairwise subtractions will eliminate all the terms involving x and leave the difference of constants only. Hence, we can get the same result by taking the pairwise differences of n + 1 consecutive perfect nth powers. starting with 0^n and finishing with n^n.

    Starting with n = 1, this gets very interesting indeed.

  4. enderw88 says:

    I used a few LISP forms to calculate the first 15 values. The final number depends only on the exponent, not the seed integers picked. The value is “fibonacci” like in that if you start with n_1=1, v_1=1, n_2=2 v_2=2, n_3=3, v_3=6… the v_n=n_n v_{(n-1)}

    Here re the first 24 v’s:
    ((1) (2) (6) (24) (120) (720) (5040) (40320) (362880) (3628800) (39916800)
    (479001600) (6227020800) (87178291200) (1307674368000) (20922789888000)
    (355687428096000) (6402373705728000) (121645100408832000)
    (2432902008176640000) (51090942171709440000) (1124000727777607680000)
    (25852016738884976640000) (620448401733239439360000))

  5. Funny how a flawed calculation can get you to do a lot of unnecessary work. At any rate, my initial hypothesis from your saying that you had a combinatorial proof coupled with 24 showing up in your example was correct: for a given power n and ANY n + 1 consecutive perfect nth powers starting with 0^n and finishing with n^n, following the rules will always reduce everything to n!

    I’ll be interested in seeing the visual proof.

    • venneblock says:

      Michael, your “typo” (in quotes, because it’s not really an error) makes it look like you’re excited that the result is always n, when I know you mean n-factorial. This reminds me of the MathCounts coordinator who was moderating the Countdown Round and screamed, “What’s the value of FIVE?” The problem kids were supposed to solve was, “What is the value of 5!?”

      Like you, I’m very excited to see the visual proof!

  6. @venneblock: I never get THAT excited about n.

  7. Lev says:

    The pattern is the Pascal’s triangle with alternating algebraic sign in front of the coefficient. For n=4 you get: (a+4)^{4}-4 \cdot (a+3)^4+6 \cdot (a+2) - 4 \cdot (a+1)^4 + a^4 while a is the starting integer. šŸ™‚ Where do you get such cool brainteasers?

  8. Pingback: Differences of powers of consecutive integers, part II | The Math Less Traveled

  9. Pingback: Making our equation count | The Math Less Traveled

Comments are closed.