I recently saw that Dr.Wang of China say that combination(2n,n) is sum of squares of combination(n,m) for m = 0 to n. The result was fantastic. I got jealous because the result was great and I could not get it despite combination(2n,n) being so close to my heart.
Now, Jesus helped me. And gave me a significant result.
I have a decent idea how combination(2n,n) progresses from 0 onwards and more and more. The sigma till n of combination(2n,n) by just the combination(2n,n), I feel is 1.3 always. However how numbers are higher up at say trillions of trillions etc. is unknown. Therefore, I conclude that till reasonable levels 1.3 is true. This finishes.
3 comments:
It is approximately 1.3 even at n = 10008. I have checked in Wolfram Alpha.
I recently saw that Dr.Wang of China say that combination(2n,n) is sum of squares of combination(n,m) for m = 0 to n.
The result was fantastic.
I got jealous because the result was great and I could not get it despite combination(2n,n) being so close to my heart.
Now, Jesus helped me. And gave me a significant result.
The jealousy with Dr.Wang is neutralized now.
I have a decent idea how combination(2n,n) progresses from 0 onwards and more and more.
The sigma till n of combination(2n,n) by just the combination(2n,n), I feel is 1.3 always.
However how numbers are higher up at say trillions of trillions etc. is unknown.
Therefore, I conclude that till reasonable levels 1.3 is true.
This finishes.
Post a Comment