n = 1 ∑ 2 0 1 6 1 3 + 2 3 + 3 3 + ⋯ + n 3 1 + 2 + 3 + ⋯ + n
If the value of this sum is B A , where A and B are coprime positive integers, find A + B .
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.
Great explanation!
Bonus:( Slightly tougher ;-) n → ∞ lim ( 1 7 + 2 7 + ⋯ + n 7 ) ( 1 2 + 2 2 + ⋯ + n 2 ) ( 1 4 + 2 4 + ⋯ + n 4 ) = 1 5 k + 1 k = ?
Log in to reply
Six. Hint : Apply riemann sums .
Log in to reply
Yeah .. Exactly ( ∫ 0 1 x 7 d x ) ( ∫ 0 1 x 2 d x ) ( ∫ 0 1 x 4 d x ) = ( 8 1 ) ( 3 1 ) ( 5 1 ) = 1 5 8 ⟹ k = 7
Log in to reply
@Rishabh Jain – Nope. You made a mistake. Try again, think about taking out a power from the denominator.
Log in to reply
@Pi Han Goh – Summation can be represented as: n → ∞ lim n 1 ⎝ ⎜ ⎜ ⎜ ⎜ ⎛ r = 1 ∑ ∞ ( n r ) 7 ( r = 1 ∑ ∞ ( n r ) 2 ) ( r = 1 ∑ ∞ ( n r ) 4 ) ⎠ ⎟ ⎟ ⎟ ⎟ ⎞ and hence the above form.. Isn't it right??
Log in to reply
@Rishabh Jain – (r/n)^6, and not (r/n)^7
Log in to reply
@Pi Han Goh – Then that n 1 will not come. And the required form will not be generated.!!
Log in to reply
@Rishabh Jain – Oh wait ...silly me. I thought of some other theorem and got messed up. Yup you're right! You should this as a problem!! =D
Log in to reply
@Pi Han Goh – Surely... I'll post it after modification and making it a bit scary ;-) ..(after my exams!!)
@Pi Han Goh – There's a typo in your comment :P
"You should post this as a problem!! =D"
Can you help me in this too?? n → ∞ lim n 1 ln ( n n n ! ( 2 n ) ! ) I wrote it as : n → ∞ lim n 1 ln ⎝ ⎜ ⎛ n times n ⋅ n ⋅ n ⋯ n ( 2 n ) ( 2 n − 1 ) ( 2 n − 2 ) ⋯ ( 2 n − ( n − 1 ) ) ⎠ ⎟ ⎞ = n → ∞ lim n 1 r = 0 ∑ n − 1 ln ( 2 − n r ) = ∫ 0 1 ln ( 2 − x ) d x = ln 4 − 1 Have I done correct or have I commited some mistake??
Log in to reply
@Rishabh Jain – Yes, your work is correct.
Those cross things made it look perfect.
Same way dude!!! An easy problem.
Is not the summation simply 1/2033136? So A +B = 2033137
Log in to reply
Please elaborate
Log in to reply
@Arulx Z I think Greg means you directly sub n=2016 into the simplified equation 2/n(n+1), which will give you 1/2033136. Why is that wrong?
Log in to reply
@Teng Chou Nathan Mar – The answer is actually 1 ⋅ 2 2 + 2 ⋅ 3 2 + 3 ⋅ 4 2 + ⋯ + 2 0 1 6 ⋅ 2 0 1 7 2 . So simply substituting 2016 won't help.
Greg is right here . Arul don't you think the summation of this series will be less then one ? Denominator >> numerator . The part you did wrong was , you took summation (2÷(n)(n+1)) as the nth term and started added it , hence you got a number > 1
Great use of telescoping! I was fool enough to do the whole induction shenanigan.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 |
|
1 2 |
|
The summation amounts to 1/1+(1+2)/(1+2)^2+(1+2+3)/(1+2+3)^2+...(1+2+3+...+n)/(1+2+3+...+n)^2 = 1+1/3+1/6+...+1/(n(n+1)/2). Notice that for increasing values of n there is a pattern in the sum: 1, 4/3, 6/4, 8/5, ..., 2n/(n+1). Therefore, the sum to n=2016 is 2(2016)/(2016+1) = 4032/2017. 4032+2017 = 6049.
The pattern I saw was 1, 4/3, 9/6, 16/10, ..., n^2/(1+2+...+n) which equals n^2/(n(n+1)/2) = 2n^2/(n(n+1) = 2n/(n+1)
Problem Loading...
Note Loading...
Set Loading...
By referencing sum of n, n², or n³ , we have
1 + 2 + 3 + ⋯ + n 1 3 + 2 3 + 3 3 + ⋯ + n 3 = = 2 n ( n + 1 ) 4 n 2 ( n + 1 ) 2 = ( 2 n ( n + 1 ) ) 2
Thus, taking the ratio of the two expressions gives
1 3 + 2 3 + 3 3 + ⋯ + n 3 1 + 2 + 3 + ⋯ + n = = = = 2 n ( n + 1 ) ÷ ( 2 n ( n + 1 ) ) 2 2 n ( n + 1 ) ÷ ( 2 n ( n + 1 ) ) 2 1 ÷ ( 2 n ( n + 1 ) ) n ( n + 1 ) 2
By partial fractions - cover up rule , we have n ( n + 1 ) 2 = n 2 − n + 1 2 .
Now let's evaluate the sum!
= = = = = = n = 1 ∑ 2 0 1 6 1 3 + 2 3 + 3 3 + ⋯ + n 3 1 + 2 + 3 + ⋯ + n n = 1 ∑ 2 0 1 6 n ( n + 1 ) 2 n = 1 ∑ 2 0 1 6 ( n 2 − n + 1 2 ) 2 n = 1 ∑ 2 0 1 6 ( n 1 − n + 1 1 ) 2 [ ( 1 1 − 2 1 ) + ( 2 1 − 3 1 ) + ( 3 1 − 4 1 ) + ⋯ + ( 2 0 1 5 1 − 2 0 1 6 1 ) + ( 2 0 1 6 1 − 2 0 1 7 1 ) ] 2 [ ( 1 1 − 2 1 ) + ( 2 1 − 3 1 ) + ( 3 1 − 4 1 ) + ⋯ + ( 2 0 1 5 1 − 2 0 1 6 1 ) + ( 2 0 1 6 1 − 2 0 1 7 1 ) ] 2 ( 1 − 2 0 1 7 1 ) = 2 ( 2 0 1 7 2 0 1 6 ) = 2 0 1 7 4 0 3 2
In the penultimate steps, the terms cancel out in pairs (this is known as a telescoping sum ).
Since the summation is equal to 2 0 1 7 4 0 3 2 and the fraction is already stated in its lowest form, then A = 4 0 3 2 , B = 2 0 1 7 ⇒ A + B = 6 0 4 9 .