1 ! 3 ! + 2 ! 4 ! + 3 ! 5 ! + ⋯ + 4 8 ! 5 0 ! = ?
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.
I have a similar solution:
2 ∗ 3 + 3 ∗ 4 + 4 ∗ 5 + 5 ∗ 6 + . . . + 4 9 ∗ 5 0 = n = 1 ∑ 4 8 ( n + 1 ) ( n + 2 )
= n = 1 ∑ 4 8 n 2 + 3 n + 2 = n = 1 ∑ 4 8 n 2 + n = 1 ∑ 4 8 3 n + n = 1 ∑ 4 8 2
= n = 1 ∑ 4 8 n 2 + 3 n = 1 ∑ 4 8 n + 2 ( 4 8 )
= 6 1 ( 4 8 + 1 ) ( 2 ∗ 4 8 + 1 ) ( 4 8 ) + 3 ∗ 2 4 8 ∗ ( 4 8 + 1 ) + 9 6 = 4 1 6 4 8
Is a shortcut to this summation just add up 1 2 and we get 1 2+2 3+...49 50.
So we have the summation of factorial function X(m), In our case m=2 and h=1. limits 1 to 50 which result in X(3)/(3). Since m=2, (51 50 49)/3 = 41650 now we substract 1*2 and obtain 41648
Realy nice way to find
We can write this as
2 × 3 + 3 × 4 + 4 × 5 + ⋯ + 4 9 × 5 0
= ( ( 2 3 ) + ( 2 4 ) + ( 2 5 ) + ⋯ + ( 2 5 0 ) ) ⋅ 2
= 2 ( ( 3 5 1 ) − ( 2 2 ) ) = 4 1 6 4 8
Where we used the hockey stick identity from the transition from the second to third line.
Nice Solution :D
IV , for n = 4, ( 6 4 A + 1 6 B + 4 C + D ) = 6 8 .
Subtracting I from II, II from III and III from IV, we afford:
VII , ( 3 7 A + 7 B + C ) = 3 0 .
Subtracting V from VI and VI from VII, we have:
Your solution is actually the best, even better than the way I did it because your solution can solve almost any higher degree arithmetical progression.
excellent effort
tell me smthng abt degree of arithmetical progression , and how u cme to no abt it being a 3 degree polinomial ???
Log in to reply
Because the ratio is a first degree polynomial. You can figure out that every time you are increasing with x + 1 first you have 0 then increase with 1 then you have 1 and increase with 2, then you have 3 and increase with 3 then you have 6 and increase with 4 and so on... so ratio is first degree => sum is 2 degrees higher
You're talking about how did I figure it out the sequence was a second-degree arithhmetical progression or why did I say the sum of terms is a third-degree one?
He did not explain why. Please read http://www.trans4mind.com/personal_development/mathematics/series/sumNaturalSquares.htm To have a better understanding of the solution.
To better understand this solution, read http://www.trans4mind.com/personal_development/mathematics/series/sumNaturalSquares.htm.
The general term is
(n + 2)!/n! = (n + 2)(n +1) = n^2 + 3 n + 2 ,
where n = 1 , 2 , 3, ......... , 48
Sum of (n^2) = n(n + 1)(2 n + 1)/6 = (48)(49)(97)/6 = 38024
Sum of (3 n) = (3) n(n + 1) = (3)(48)(49) = 3528
Sum of (2) =2 n = (2)(48) = 96
The total sum = 38024 + 3528 + 96 = 41648
using namespace std; int main() { int a=0; int z=1; int y=1; int x=1; for(x=1;x<=48;x++) { while(x==1) { y=(x+1) (x+2); cout << y << "\t" << endl; z=a+y; break;} while(x>=2 && x<=48) { y=(x+1) (x+2); if (x==2) z=a+y; else { z+=y;} cout << y << "\t" << z << endl; break; } a=y; } cin.ignore(); cin.ignore(); return 0; }
2 3+3 4+•••+49 50=1/3((-1 2 3+2 3 4)+(-2 3 4+3 4 5)+•••+(-48 49 50+49 50 51))=1/3(-1 2 3+49 50*51)=41648
This sum can be thought of as Sigma of (r+2)!/r! =(r+1)*(r+2) This is a simple telescopic setup. Upon solving, we get 1/3(49 * 50 * 51-1 * 2 * 3) =41648
Problem Loading...
Note Loading...
Set Loading...
This expression can be rewritten as
3 ∗ 2 + 4 ∗ 3 + 5 ∗ 4 + 6 ∗ 5 + . . . + 5 0 ∗ 4 9 =
n = 2 ∑ 4 9 n ( n + 1 ) = − 2 + n = 1 ∑ 4 9 n ( n + 1 ) =
− 2 + n = 1 ∑ 4 9 n 2 + n = 1 ∑ 4 9 n = − 2 + 6 4 9 ( 4 9 + 1 ) ( 2 ∗ 4 9 + 1 ) + 2 4 9 ( 4 9 + 1 ) =
− 2 + ( 4 9 ) ( 2 5 ) ( 3 3 ) + ( 4 9 ) ( 2 5 ) = ( 4 9 ) ( 2 5 ) ( 3 4 ) − 2 = 4 1 6 4 8 .