1 ⋅ 2 ⋅ 3 + 2 ⋅ 3 ⋅ 4 + 3 ⋅ 4 ⋅ 5 + ⋯ + 9 8 ⋅ 9 9 ⋅ 1 0 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.
Bonus :Prove that ∑ n ( n + 1 ) ( n + 2 ) … ( n + k ) = k + 2 n ( n + 1 ) ( n + 2 ) … ( n + k ) ( n + k + 1 )
Log in to reply
Write it as: ( k + 2 ) 1 ∑ n ( n + 1 ) ⋯ ( n + k ) ( ( n + k + 1 ) − ( n − 1 ) ) = ( k + 2 ) 1 ( ∑ ( n ( n + 1 ) ⋯ ( n + k + 1 ) − ∑ ( n − 1 ) ( n ) ⋯ ( n + k ) ) A T e l e s c o p i c S e r i e s = k + 2 n ( n + 1 ) ( n + 2 ) … ( n + k ) ( n + k + 1 )
Are you sure about that JEE inspired question which you posted (Just asking!!) ??
Log in to reply
Super cool!Thanks, BTW I've named the above sum 'Arulxz's Sum' :3
What do you want to know about that JEE question?Is there any calculation mistake or any other mistake.Please rectify me if any :)
Log in to reply
@Rohit Udaiwal – I have a vague idea that you might have missed something.. But I cannot find a nice form of that radical.... So I have now no option but to reveal your solution to that question... Let's see....
@Rohit Udaiwal – Nice Rohit :3
Log in to reply
@Arulx Z – Thanks Arulx.I could think of that sum only because of you.It is therefore,dedicated to you :)BTW is Arulx your real name?
Log in to reply
@Rohit Udaiwal – Thanks :) My real name is Yasharyan Gaikwad. I prefer being anonymous online but since Brilliant is a trusted forum, I revealed it.
Did the same :)
The formulae for finding sum of n 3 or n 2 .or n are (as per my knowledge )valid when we begin from 1 isn't there any problem when you are beginning from 2 . Please correct me where I am wrong .
Log in to reply
Yes you are right... But here it doesn't matter since first term of summation is zero (Put n = 1 and you can notice that) that's why I skipped that step.. :-)
Log in to reply
Oooo!Now I understood. Thank you.
Did the same way(:
The required sum can be expressed as : y = n = 1 ∑ 9 8 n ( n + 1 ) ( n + 2 )
We can express it as difference of two consecutive terms(so that we can solve it by method of differences) by multiplying and dividing it with difference of next term after ( n + 2 ) which will continue the same pattern and term before the term n that will continue the same pattern:
y = 4 1 n = 1 ∑ 9 8 n ( n + 1 ) ( n + 2 ) [ n + 3 − ( n − 1 ) ]
⇒ y = 4 1 n = 1 ∑ 9 8 n ( n + 1 ) ( n + 2 ) ( n + 3 ) − ( n − 1 ) ( n ) ( n + 1 ) ( n + 2 )
⇒ 4 y = 1 . 2 . 3 . 4 − 0 . 1 . 2 . 3 + 2 . 3 . 4 . 5 − 1 . 2 . 3 . 4 + 3 . 4 . 5 . 6 − 2 . 3 . 4 . 5 . . . . . . + 9 8 . 9 9 . 1 0 0 . 1 0 1 − 9 7 . 9 6 . 9 5 . 9 4
= 9 8 . 9 9 . 1 0 0 . 1 0 1
Hence, y = 4 1 ∗ 9 8 . 9 9 . 1 0 0 . 1 0 1 = 2 4 4 9 7 5 5 0
This is a nice alternative solution!! =D
Did the same......
Did the same.. :)
Just curious, it seems like you can still like problems even though the function was removed. How did you do that? Hope you can answer.
S = 1 ˙ 2 ˙ 3 + 2 ˙ 3 ˙ 4 + 3 ˙ 5 ˙ 6 + . . . + 9 8 ˙ 9 9 ˙ 1 0 0 = n = 1 ∑ 9 8 n ( n + 1 ) ( n + 2 ) = n = 1 ∑ 9 8 ( n 3 + 3 n 2 + 2 n ) = ( 2 9 8 ( 9 9 ) ) 2 + 3 × 6 9 8 ( 9 9 ) ( 1 9 7 ) + 2 × 2 9 8 ( 9 9 ) = 4 9 ( 9 9 ) ( 4 9 ( 9 9 ) + 1 9 7 + 2 ) = 2 4 4 9 7 5 5 0
Note that ( n − 1 ) ⋅ n ⋅ ( n + 1 ) = n ( n 2 − 1 ) . Therefore, 0 ⋅ 1 ⋅ 2 + 1 ⋅ 2 ⋅ 3 + 2 ⋅ 3 ⋅ 4 + ⋯ + 9 8 ⋅ 9 9 ⋅ 1 0 0 = 1 ⋅ ( 1 2 − 1 ) + 2 ⋅ ( 2 2 − 1 ) + 3 ⋅ ( 3 2 − 1 ) + ⋯ + 9 9 ⋅ ( 9 9 2 − 1 ) = ( 1 3 + 2 3 + ⋯ + 9 9 3 ) − ( 1 + 2 + ⋯ 9 9 ) = ( 1 + 2 + ⋯ + 9 9 ) 2 − ( 1 + 2 + ⋯ 9 9 ) = 4 9 5 0 2 − 4 9 5 0 = 4 9 4 9 ⋅ 4 9 5 0 = 2 4 4 9 7 5 5 0 .
Notes: I added the term 0 ⋅ 1 ⋅ 2 for convenience. It does not affect the sum.
Also, I assumed as a known fact that ∑ n 3 = ( ∑ n ) 2 .
I Did not notice your answer and posted mine on the exact same line. By the way, can u tell me why (as in which theorem or which proof?) 1^3+2^3.....+n^3=(1+2+3....+n)^2.
I just noticed the pattern and used it in the answer.
Also, correct your second line of the solution it is 1 (1^2-1) and not 1 (1^1-1) and similarly there is correction in the next term too.
Log in to reply
A nice proof can be given based on the multiplication table:
× 1 2 3 4 ⋮ 1 1 2 3 4 2 2 4 6 8 3 3 6 9 1 2 4 4 8 1 2 1 6 … ⋱
Consider the square consisting of the first n columns of the first n rows. The sum of all entries in this square is ( 1 + 2 + ⋯ + n ) ⋅ ( 1 + 2 + ⋯ + n ) = ( i = 1 ∑ n i ) 2 . Thus, the sum of the colored entries in the table above is ( 1 + 2 + 3 + 4 ) 2 = 1 0 2 = 1 0 0 .
We can also divide that square into n L-shaped regions, as indicated above. The sum of the numbers in the n th L-shaped region is n + 2 n + 3 n + ⋯ + n 2 + ⋯ + 3 n + 2 n + n = n ( 1 + 2 + 3 + ⋯ + n + ⋯ + 3 + 2 + 1 ) = n ( 2 ( ∑ n ) − n ) = n ( 2 ⋅ 2 1 n ( n + 1 ) − n ) = n ⋅ n 2 = n 3 .
Thus the sum of the numbers in the square is,
-- on one hand equal to ( ∑ n ) 2 ;
-- on the other hand equal to the sum of the first n L-shaped regions, i.e. ∑ n 3 .
An ingenious solution indeed! :-)
T n = n ( n + 1 ) ( n + 2 )
T n = 4 1 n ( n + 1 ) ( n + 2 ) [ ( n + 3 ) − ( n − 1 ) ]
4 1 [ n ( n + 1 ) ( n + 2 ) ( n + 3 ) - ( n − 1 ) ( n ) ( n + 1 ) ( n + 2 ) ]
Now, Solving this telescopic series,we get
= 4 9 9 × 9 8 × 1 0 0 × 1 0 1
= A n s . 2 4 4 9 7 5 5 0
I used the formula: x⁴/4 + 3x³/2 + 11x²/4 +3x/2 . x=98 , Answer is 24497550 . But they have easier solution on that :)
It equals 6 ( ( 3 3 ) + ( 3 4 ) + ( 3 5 ) + . . . + ( 3 1 0 0 ) ) = 6 ( 4 1 0 1 ) = 4 1 0 1 × 1 0 0 × 9 9 × 9 8
We have:
(
n
−
1
)
(
n
)
(
n
+
1
)
=
n
3
−
n
Now using the above formula the equation becomes:
2
3
−
2
+
3
3
−
3
.
.
.
.
.
.
.
.
.
.
.
.
9
9
3
−
9
9
=
(
1
+
2
+
3
+
4
.
.
.
.
.
.
.
+
9
9
)
2
−
1
−
4
9
4
9
=
4
9
5
0
2
−
4
9
5
0
=
2
4
4
9
7
5
5
0
I noted a pattern that 1 3 + 2 3 . . . . . . + n 3 = ( 1 + 2 + 3 . . . . + n ) 2 and used the same above.This may already be a theorem or something that i have never heard of.
Problem Loading...
Note Loading...
Set Loading...
n = 2 ∑ 9 9 ( ( n − 1 ) n ( n + 1 ) ) = n = 2 ∑ 9 9 ( n 3 − n ) ( ∑ n 3 = ( 2 n ( n + 1 ) ) 2 , ∑ n = ( 2 n ( n + 1 ) ) ) = 2 n ( n + 1 ) ( 2 n ( n + 1 ) − 1 ) = 4 ( n − 1 ) n ( n + 1 ) ( n + 2 ) ∣ n = 9 9 = 2 4 4 9 7 5 5 0