What Patterns Emerge from Comparing Sygma Formulas?

  • Thread starter Thread starter Natasha1
  • Start date Start date
  • Tags Tags
    Patterns
Natasha1
Messages
494
Reaction score
9
I have a tricky question here...

Please just feed in any comments, anything you can spot that I can't

I have been asked to compare the formulae of Sygma (k=1 until n value) of k, Sygma (k=1 until n value) of k(k+1) and Sygma (k=1 until n value) of k(k+1)(k+2)?

Hence comparing these...

Sygma (k=1 until n value) of k = 1/2 n(n+1)
Sygma (k=1 until n value) of k(k+1) = 1/3 n(n+1)(n+2)
Sygma (k=1 until n value) of k(k+1)(k+2) = 1/4 n(n+1)(n+2)(n+3)

I have been asked to comment on these as much as I possibly can? :confused: Can anyone help?
 
Last edited:
Physics news on Phys.org
poo, no one has a clue :rolleyes:
 
Here you go, Natasha.

Natasha1 said:
I have a tricky question here...
Please just feed in any comments, anything you can spot that I can't

I have been asked to compare the formulae of Sygma (k=1 until n value) of k, Sygma (k=1 until n value) of k(k+1) and Sygma (k=1 until n value) of k(k+1)(k+2)?
Hence comparing these...
Sygma (k=1 until n value) of k = 1/2 n(n+1)
Sygma (k=1 until n value) of k(k+1) = 1/3 n(n+1)(n+2)
Sygma (k=1 until n value) of k(k+1)(k+2) = 1/4 n(n+1)(n+2)(n+3)
I have been asked to comment on these as much as I possibly can? :confused: Can anyone help?

Here is a helpful observation: k(k+1)\cdot\cdot\cdot(k+j)=\frac{(k+j)!}{(k-1)!} and \sum_{k=1}^{n}\frac{(k+j)!}{(k-1)!}=\frac{n(n+j+1)!}{(j+2)n!}
Note that k, k(k+1), and k(k+1)(k+2) are given by \frac{(k+j)!}{(k-1)!} for j=0,1,\mbox{ and }2, respectively, so that

\sum_{k=1}^{n} k = \frac{n(n+0+1)!}{(0+2)n!} = \frac{n(n+1)}{2},

\sum_{k=1}^{n} k(k+1) = \frac{n(n+1+1)!}{(1+2)n!} = \frac{n(n+1)(n+2)}{3},

and

\sum_{k=1}^{n} k(k+1)(k+2) = \frac{n(n+2+1)!}{(2+2)n!} = \frac{n(n+1)(n+2)(n+3)}{4}.
-Ben
 
Last edited:
Ben,

That is REALLY nice!
 
Can anyone see anything else please? :rolleyes:
 
thanks super Ben!
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top