a = 1 ∑ 1 0 b = a ∑ 1 0 c = b ∑ 1 0 ( a × b + c )
What is the number of terms in the series given above?
Details and Assumptions:
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Excel vba code:
s = 0
For a = 1 To 10
For b = a To 10
For c = b To 10
s = s + 1
Next c, b, a
MsgBox s
Here is an algorithm which does your required work;
1 2 3 4 5 6 |
|
Isn't that so simple.!?
What is the combinatorics approach to this? In particular, note that ( 3 1 2 ) = 2 2 0 .
I don't think it can be generalized in this way for any integer n such that the series is: a = 1 ∑ n b = a ∑ n c = b ∑ n ( a × b + c ) = ( 1 × 1 + 1 ) + ( 1 × 1 + 2 ) + . . . Moreover I am NOT requiring the sum rather I wanna know the total number of terms of that series.
Algebraic: Basically, with a=1, c is from 1-10, plus 2-10, plus 3-10, etc... is 10+9+8...+1 terms with a=2, c is from 2-10, 3-10, 4-10, etc... --> is 9+8+7...+1 terms 1 ten, 2 nines, 3 eights, 4 sevens, 5 sixes. You can go all the way to ten or multiply that by 2 since the equation will be symmetrical. (10+9 2+8 3+7 4+6 5)*2
We can show that C(12,3) is the answer. For each triplet (a,b,1,c1) from C(12,3) we take triplet (a,b1-1,c1-2) and b1-1>=a, c1-2>=b so it is part of our sum.
(n+1)3-n3=3n2+3n+1
summa((0,n)3n2+3n+1)=(n+1)3
summa((0,n)3n2+3n)=(n+1)3-(n+1)=n(n+1)(n+2)
Problem Loading...
Note Loading...
Set Loading...
Python one-liner