The sum 1 2 2 2 3 + 2 2 3 2 5 + 3 2 4 2 7 + ⋯ + 2 0 2 2 1 2 4 1 can be written as b a where a and b are positive coprime 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.
Your generalization may be correct, but it remains unproved. An easy proof is by mathematical induction:
Suppose that for n, ∑ i = 1 n i 2 ( i + 1 ) 2 2 i + 1 = ( n + 1 ) 2 ( n + 1 ) 2 − 1
This works if we substitute n = 1, as you have shown. We then go with the induction step:
∑ i = 1 n i 2 ( i + 1 ) 2 2 i + 1 + ( n + 1 ) 2 ( n + 2 ) 2 2 n + 2 = ∑ i = 1 n + 1 i 2 ( i + 1 ) 2 2 i + 1
( n + 1 ) 2 ( n + 1 ) 2 − 1 + ( n + 1 ) 2 ( n + 2 ) 2 2 n + 2 = ( n + 2 ) 2 ( n + 2 ) 2 − 1
( n + 1 ) 2 ( n + 2 ) 2 ( n + 1 ) 2 ( n + 2 ) 2 − ( n + 2 ) 2 + ( n + 1 ) 2 ( n + 2 ) 2 2 n + 2 = ( n + 2 ) 2 ( n + 2 ) 2 − 1
( n + 1 ) 2 ( n + 2 ) 2 ( n + 1 ) 2 ( n + 2 ) 2 − ( n + 2 ) 2 + 2 n + 2 = ( n + 2 ) 2 ( n + 2 ) 2 − 1
( n + 1 ) 2 ( n + 2 ) 2 ( n + 1 ) 2 ( ( n + 2 ) 2 − 1 ) = ( n + 2 ) 2 ( n + 2 ) 2 − 1
( n + 2 ) 2 ( n + 2 ) 2 − 1 = ( n + 2 ) 2 ( n + 2 ) 2 − 1
So by the principle of mathematical induction, we have proven your generalization.
Log in to reply
I don't quite follow the 4th to 5th step of this.
The numerator is:
( n + 1 ) 2 ( n + 2 ) 2 − ( n + 2 ) 2 + 2 n + 2 ( n + 1 ) 2 ( n + 2 ) 2 − n 2 − 4 n − 4 + 2 n + 2 ( n + 1 ) 2 ( n + 2 ) 2 − n 2 − 2 n − 2
However in your next step you have written:
( n + 1 ) 2 ( ( n + 2 ) 2 − 1 ) which is equal to ( n + 1 ) 2 ( n + 2 ) 2 − n 2 − 2 n − 1
Did I make a mistake?
Log in to reply
You're right - How does the penultimate step make sense?
Thanks!
In your first induction step, you added the wrong ( n + 1 ) t h term on the left side of the equation. It should be as follows:
( n + 1 ) 2 ( n + 2 ) 2 2 ( n + 1 ) + 1 = ( n + 1 ) 2 ( n + 2 ) 2 2 n + 2 + 1 = ( n + 1 ) 2 ( n + 2 ) 2 2 n + 3
we can write the above sum of terms as- n = 1 ∑ 2 0 n 2 ( n + 1 ) 2 2 n + 1
this term n 2 ( n + 1 ) 2 2 n + 1 can be broken into two separate terms through partial fraction
n 2 ( n + 1 ) 2 2 n + 1 = n 2 A + ( n + 1 ) 2 B
taking n=0 will give A=1 and taking n=-1 will give B=-1
this means we can now write the above summation as-
n = 1 ∑ 2 0 n 2 1 − ( n + 1 ) 2 1
Now it's quite easy to see that on putting the values of n=1 to n=20 all the terms except n=1 and n=20 will be cancelled off i.e.
( 1 1 − ( 2 ) 2 1 ) + ( 2 2 1 − ( 3 ) 2 1 ) ................. + ( 1 9 2 1 − ( 2 0 ) 2 1 ) + ( 2 0 2 1 − ( 2 1 ) 2 1 )
Finally only two terms will remain ( 1 1 − ( 2 1 ) 2 1 )
On solving it will give 4 4 1 4 4 0
Add them and you will get 881....answer!!
3 can be written as 2^2 - 1^1 5 can be written as 3^2 - 2^2 7 can be written as 4^2 - 3^2 9 can be written as 5^2 - 4^2
Log in to reply
wat did ^ this symbol mean?helpme!
Curse me !! I did it and pressed the show solution button wrongly and couldnt get my deserved points.
exclusively superb
How does (2n+1)/(n^2(n+1)^2) equal ((n+1)^2 - 1)/((n+1)^2)?
Log in to reply
Never mind -- I hadn't seen the above post with the induction proof.
My solution to solve this problem is "pattern recognition". So, this my steps:
First, see the patern by adding one by one of the sequence above (sum n -th term of sequence). Initialize that sum of 1 -st term is 4 3 , then the sum 2 -nd term is you add 1 -st and 2 -nd term of sequence first, that are 1 1 2 2 3 and 2 2 3 2 5 , sum must be 9 8 simplified from 3 6 3 2 .
Next, you can continue the summing of the 3 -rd term, sum of 1 1 2 2 3 , 2 2 3 2 5 , and 3 2 4 2 7 . So, sum is 1 6 1 5 , the simplified from 4 8 4 5 . Continue, your addtion, and you can see the pattern below.
The patter of sum n -th term of sequence are 4 3 , 9 8 , 1 6 1 5 , . . . . . . . . . . . . . So, you can see the patern now, that the sum of sequence above is the sum until 40 -th term. The pattern are the denominator (the square of n + 1 , ∗ n ∗ from 1 , 2 , . . . . ) and the numenator (sum of odd number from 3 to 4 1 , you can use arithmetic progression).
Finally, sum is ( n + 1 ) 2 s u m o f o d d n u m b e r = f r a c 4 4 0 4 4 1 . a is 440 and b 441, then a + b is 4 0 0 + 4 4 1 = 8 8 1 .
good, but you have not proven that the pattern continues.
gd job
Good
great (y)
( n + 1 ) 2 s u m o f o d d n u m b e r s = 4 4 1 4 4 0 I think this is what you mean in step 4..
Since the nth term of the equation can be written as
r 2 × ( 1 + r 2 ) 1 + 2 r = r 2 1 − ( 1 + r ) 2 1
putting r=1,2,3,4.....20
1 2 1 − 2 2 1 + 2 2 1 − 3 2 1 + . . . . . . . . . . . + 1 9 2 1 − 2 0 2 1 + 2 0 2 1 − 2 1 2 1
Common term will cancel
so we have 1 − 2 1 2 1 = 4 4 1 4 4 1 − 1 = 4 4 1 4 4 0
= 8 8 1
This technique is called "telescoping"
exllent
Yes, this is exactly how, I solved it.
The same
Note: This solution is similar to the ones posted below, but I still decided to write it because I felt it would be much clearer in LaTeX. I would be inserting motivations within the solution itself in [ ] brackets.
Motivation 1 As the series is named Telescoping, we ought to look out for patterns (cancellation of terms) in this question.
Solution
Observe that all terms in the question can be expressed as x 2 ( x + 1 ) 2 2 x + 1 . Expanding this [why? because we are looking for patterns or way to simply the expression, so expansion might do the trick], we get x 2 ⋅ ( x 2 + 2 x + 1 ) 2 x + 1 .
[Notice that we have 2 similar expression in the denominator and numerator of the fraction. This expression is simply 2 x + 1 .] So, how can we construct variable(s) such that we obtain a telescoping sequence? Here comes the trick! :) Simply add and subtract x 2 to the numerator to obtain x 2 ( x 2 + 2 x + 1 ) ( 2 x + 1 + x 2 ) − x 2 . After doing this, note that we can simplify the expression further by cancelling the common terms top and bottom of the fraction! We get, x 2 ( x 2 + 2 x + 1 ) ( 2 x + 1 + x 2 ) − x 2 = x 2 1 − ( x 2 + 2 x + 1 ) 1
Recalling x 2 + 2 x + 1 = ( x + 1 ) 2 , this simplifies further into x 2 1 − ( x + 1 ) 2 1 .
Therefore, fitting this back into our question we get, 1 2 1 − 2 2 1 + 2 2 1 − 3 2 1 + . . . + 2 0 2 1 − 2 1 2 1 . All terms cancel out to obtain: 1 2 1 − 2 1 2 1 = 4 4 1 4 4 0 . We are done :)
BEAUTIFUL.
good show.
such a clear explanation! seriously awesome!
The explanation is succinct and comprehensible. Thank you for it.
:) Thanks for good comments, guys :)
inspiring show
yippee!!!! did it the same way.... :D
Good Solution
AWESOME
First, recognize the pattern of the sum and you will get n = 1 ∑ 2 0 n 2 ( n + 1 ) 2 2 n + 1 This can be decomposed using partial fractions. After doing this you should have n = 1 ∑ 2 0 n 2 1 − ( n + 1 ) 2 1 Then plug in n = 1 , 2 , 3 , . . . , 2 0 We end up with ( 1 − 4 1 ) + ( 4 1 − 9 1 ) + ( 9 1 − 1 6 1 ) + . . . + ( 2 0 2 1 − 2 1 2 1 ) After cancelling, we are left with 1 − 2 1 2 1 = 4 4 1 4 4 0 So, the final answer is 4 4 0 + 4 4 1 = 8 8 1
The whole expression can be expressed as:
∑ i = 1 a 2 ( a + 1 ) 2 a + ( a + 1 )
where n = 20.
Simplifying the expression,
It becomes ∑ i = 1 a 2 ( a + 1 ) 2 2 a + 1
Using partial fractions to allow to telescope the series:
( a 2 ) ( a + 1 ) 2 2 a + 1 = a 2 A + a + 1 B + ( a + 1 ) 2 C
( a 2 ) ( a + 1 ) 2 2 a + 1 = a 2 ( a + 1 ) 2 A ( a + 1 ) 2 + B [ a ( a + 1 ) ] + C a 2
2 a + 1 = A ( a + 1 ) 2 + B [ a ( a + 1 ) ] + C a 2
If we let a = 0, A = 1; if we let a = -1, C = -1
Having obtained A and C, we will get B, and B = 0.
The partial fraction of a 2 ( a + 1 ) 2 2 a + 1
is
a 2 ( a + 1 ) 2 2 a + 1 = a 2 1 + 0 + ( a + 1 ) 2 − 1
a 2 ( a + 1 ) 2 2 a + 1 = a 2 1 − ( a + 1 ) 2 1
As this allows us to telescope the series, for n = 20
∑ i = 1 a 2 1 − ( a + 1 ) 2 1 = [ 1 − ( a + 1 ) 2 1 ] = 1 − 4 4 1 1 = 4 4 1 4 4 1 − 4 4 1 1 = 4 4 1 4 4 0
If a = 440, and b = 441:
4 4 0 + 4 4 1 = 8 8 1
needlessly complex....
n = 1 ∑ 2 0 ( n 2 ) ( n + 1 ) 2 2 n + 1 = n = 1 ∑ 2 0 n 2 1 − n = 1 ∑ 2 0 ( n + 1 ) 2 1 = n = 1 ∑ 2 0 n 2 1 − n = 2 ∑ 2 1 ( n 2 ) 1 = 1 − 2 1 2 1 = 4 4 1 4 4 0 = B A → A + B = 8 8 1
i just try to sum 3/2^2+5/2^2*3^2 and i get 8/9
then i try 3/2^2+5/2^2 3^2+7/3^2 4^2 and i get 15/16
then i try 3/2^2+5/2^2 3^2+7/3^2 4^2+9/4^2*5^2 and i get 24/25 until i figure out it is strange enough
i think the conclusion is (n^2-1)/n^2 with n is the largest denominator ex: 7/3^2*4^2 >>>n is 4
then 41/(20^2*21^2) n is 21 then the result is 21^2-1/21^2=440/441=a/b
a+b=440+441=881
A Classical case OF " TELESCOPIC SERIES"
FIRST, WE NEED TO FIND OUT Tn..
Tn=(2n+1)/{(n^2)*(n+1)^2}....
on rearranging the Tn can be presented as .....
Tn= 1/n^2 - 1/(n+1)^2
now put n=1.... we get T(1)=1 - 1/4
now put n=2.... we get T(2)= 1/4 - 1/9
.......and so on till T(20)= 1/400 - 1/441
Now add the following and notice that the terms get cancelled in a TELESCOPIC WAY ..(hence the name)..
finally you get....the sum as 1 - 1/441 = 440/441 ...(a/b) a+b = 440 + 441 = 881.....ANSWER...
the problem can be stated as = 1 ∗ 4 3 + 4 ∗ 9 5 + . . . . . + 4 4 1 4 1 1 ∗ 4 4 − 1 + 4 ∗ 9 9 − 4 + . . . . . + 4 1 4 4 1 − 4 0 0 1 − 4 1 + 4 1 + 9 1 − 9 1 − . . . . . + 4 0 0 1 − 4 4 1 1 1 − 4 4 1 1 = 4 4 1 4 4 0 So a+b=841
a typo in the first and second line in first line it is 400 * 441 and in second line it is 400 * 441
Since this sequence look kind of complicated, let's look term by term.
First, we look at the first fraction 1 1 2 2 3 . This is equal to 4 3
Next, we look at the sum of the first two fractions, 2 2 3 2 5 + 4 3 = 3 6 5 + 4 3 = 9 8
The sum of the first three fractions is 1 6 1 5 , and so on.
We can continue calculating some more.
The sum of the first n terms of this sequence is, for n = 1 , 2 , 3 , 4 , … ,
4 3 , 9 8 , 1 6 1 5 , 2 5 2 4 , 3 6 3 5 , … .
We notice two things about this sequence.
1) The numerator is always one less than the denominator. 2) The denominator is always a perfect square and it is increasing by 1 perfect square each time - 4, 9, 16, 25...
Since we want the sum of the first twenty terms, our denominator should be ( 2 0 + 1 ) 2 = 4 4 1 following the sequence. Our numerator should, therefore, be 4 4 1 − 1 = 4 4 0
Adding, we have 4 4 1 + 4 4 0 = 8 8 1
I would encourage you to learn how to use Induction to help you establish the validity of the patterns that you found.
Log in to reply
Thanks.
ok thnanks
The general term is 2x+1/x^2(x+1)^2
which can be written as 2x+1+x^2-x^2/x^2(x^2+2x+1)
so we got 1/x^2-1/x^2+2x+1 =1/x^2-1/(x+1)^2
After we cancelled the term we got 1/1^2-1/21^2
which is equal to 440/441 a+b=881
First, you need to find a pattern by adding in this formation.
1 1 ∗ 2 2 3 = 4 3
4 3 + 2 2 ∗ 3 2 5 = 9 8
9 8 + 3 2 ∗ 4 2 7 = 1 6 1 5
As you can see, the pattern for the denominators is ( t + 1 ) 2 where t is the term number. The numerator is found by subtracting one from the denominator. Since 41 is the 20th term, the sum is 4 4 1 4 4 0 , which is co-prime. 4 4 0 + 4 4 1 = 8 8 1 .
all the fractional numbers of the series can be generalized to a^2 - b^2/ (a^2 . b^2 )..... is anything else required , euler .... ;)
You can see that the term of this sum can be write like that: (2n+1)/[n^2(n+1)^2]
It´s a good idea to separate this to: (2n+1)/[n^2(n+1)^2] = a/n^2 + b/(n+1)^2 , doing the equation you can find that a=1 and b=-1. So you have sum of (1/n^2 - 1/(n+1)^2) of n=1 to n=20 doing that you have 440/441, and 440+441= 881
The general term is 2x+1/x^2(x+1)^2 which can be written as 2x+1+x^2-x^2/x^2(x^2+2x+1) so we got 1/x^2-1/x^2+2x+1 =1/x^2-1/(x+1)^2 After we cancelled the term we got 1/1^2-1/21^2 which is equal to 440/441 a+b=881
[3/1^2 2^2]+[5/2^2 3^2]+[7/3^2 4^2]+---------------------------+[41/20^2 21^2]=
3 can be written as (4-1),similarly 5=9-4, 7=16-9 respectively.
[(4-1)/4 1]+[(9-4)/9 4]+[(16-4)/16 9]+---------------------------+[(441-400)/441 400]=
1-(1/4)+(1/4)-(1/9)+(1/9)-(1/16)+(1/16)+----------------------(1/400)+(1/400)-(1/441)=
common terms cancels out & we left with
1-(1/441)=(441-1)/441=440/441=a/b
a+b=440+441=881, is the required answer.
Sorry I did not see Michael David Sy solution befor. Mine is the same method put with displaystyle.
The solution by Happy Melodies is really nice and shows his intelligence. How ever I thought of
giving a solution that can apply to Telescopic series in general. It is known as splitting into partial fractions.
F
o
r
t
h
i
s
p
r
o
b
l
e
m
t
h
e
n
t
h
t
e
r
m
i
s
:
−
n
2
∗
(
n
+
1
)
2
2
n
+
1
S
o
:
−
n
2
∗
(
n
+
1
)
2
2
n
+
1
=
n
A
+
n
2
B
+
n
+
1
C
+
(
n
+
1
)
2
D
w
h
e
r
e
w
e
n
e
e
d
t
o
f
i
n
d
o
u
t
t
h
e
v
a
l
u
e
s
o
f
r
a
t
i
o
n
a
l
s
A
,
B
,
C
,
D
.
M
u
l
t
i
p
l
y
i
n
g
b
o
t
h
s
i
d
e
s
b
y
n
2
∗
(
n
+
1
)
2
w
e
g
e
t
2 n + 1 = A n ∗ ( n + 1 ) 2 + B ( n + 1 ) 2 + C n 2 ∗ ( n + 1 ) + D n 2
E
q
u
a
t
i
n
g
n
3
,
n
2
,
n
,
a
n
d
c
o
n
s
t
a
n
t
t
e
r
m
s
o
f
b
o
t
h
t
h
e
s
i
d
e
s
,
w
e
g
e
t
:
−
0
=
(
A
+
C
)
∗
n
3
,
0
=
(
2
A
+
B
+
C
+
D
)
∗
n
2
,
2
n
=
(
A
+
2
B
)
∗
n
,
1
=
B
.
g i v e s A + C = 0 , 2 A + B + C + D = 0 , A + 2 B = 2 , B = 1 . A = 0 , A = − C = 0 , 0 + 1 + 0 + D = 0 − − > D = − 1
n 2 ∗ ( n + 1 ) 2 2 n + 1 = n 2 1 − ( n + 1 ) 2 1 t h e s e a r e t w o p a r t i a l f r a c t i o n s .
n
=
1
∑
2
1
n
2
1
−
n
=
1
∑
2
1
(
n
+
1
)
2
1
=
1
+
n
=
2
∑
2
1
n
2
1
−
n
=
1
∑
2
0
(
n
+
1
)
2
1
−
2
1
2
.
1
B
u
t
n
=
2
∑
2
1
n
2
1
=
n
=
1
∑
2
0
(
n
+
1
)
2
1
=
1
+
[
0
]
−
2
1
2
1
=
1
−
4
4
1
1
=
4
4
1
4
4
0
=
b
a
a
+
b
=
4
4
0
+
4
4
1
=
8
8
1
If u remember, in your school days, you must have made the observation that: (note that * means 'squared') 1+3 = 2* 1+3+5=3* 1+3+5+7=4* and so on.. So, 5 = 3 -2 7=4 -3
So the first term is = (2 -1 )/1 2 =1/1* - 1/2* the second term = 1/2* - 1/3*
So consecutive terms cancel and finally we're left with 1- 1/21*=440/441 Hence, 881 is the answer
Some corrections! the second line should have 1+3 = 2* 1+3+5 =3* 1+3+5+7=4* and so on..
Also, the fourth line should have: first term= (2 -1 )/1 2 = 1/1* - 1/2* second term =1/2* - 1/3* Sorry guys, i guess there was some bug.
if you observe the pattern, it is of the form (i + (i+1))/(i^2)(i+1)^2. then we end up at the expression (2i+1)/(i(i+1))^2. then we add and subtract i^2 in the numerator. thus we can simplify the numerator to (i+1)^2 - i^2. thus we can seperate the fraction into, (1/i^2) - (1/(i+1)^2).
for i=1: (1/1^2) - (1/2^2) for i=2: (1/2^2) - (1/3^2) .... .. .. . . for i=20: (1/20^2) - (1/21^2)
adding all of which we end up at : (1/1^2) - (1/21^2) = ((21^2 - 1)/21^2) = 440/441
a=440 b=441 a+b = 881 :)
Since k 2 ( k + 1 ) 2 2 k + 1 = k 2 1 − ( k + 1 ) 2 1 , the sum telescopes to 1 2 1 − 2 1 2 1 = 4 4 1 4 4 0
Well no * *. Even then, you still get .997732, of which, fraction convert does NOT give a fraction.
Log in to reply
which is why you use a ti-89 t
Log in to reply
And I used Visual Studios on my laptop. It refused to output past .997732, even using a long float. (that should have been enough to go to at least 5 more places)
You may end up with forgetting about what is the last term you had added just now....
the solution is "shockingly" easy "dangerously" elegent .......
Problem Loading...
Note Loading...
Set Loading...
It would be laborious for us to calculate the sum, so instead of that, let us try to trace the pattern.
1 2 2 2 3 = 4 3
1 2 2 2 3 + 2 2 3 2 5 = 9 8
1 2 2 2 3 + 2 2 3 2 5 + 3 2 4 2 7 = 1 6 1 5
So, now, we can generalize the sums above as follows.
1 2 2 2 3 + 2 2 3 2 5 + 3 2 4 2 7 + . . . + n 2 ( n + 1 ) 2 2 n + 1 = ( n + 1 ) 2 ( n + 1 ) 2 − 1
Therefore,
1 2 2 2 3 + 2 2 3 2 5 + 3 2 4 2 7 + . . . + 2 0 2 2 1 2 4 1 = 2 1 2 2 1 2 − 1 = 4 4 1 4 4 0
Comparing the fraction with b a , we get a = 4 4 0 and b = 4 4 1 Thus, a + b = 8 8 1