The value of n = 1 ∑ ∞ 3 n 2 n can be expressed in the form 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.
that was really cool and easier way.....tkx
I instantly differentiate the infinite G.P then multiply it with 2n which is much faster and can be done orally, this method is good for some A.G.P series.
Log in to reply
Can you elaborate your method @Krishna Sharma
Log in to reply
We first note that n = 0 ∑ ∞ x n = 1 − x 1 for ∣ x ∣ < 1 .
Differentiating both sides of this equation, (the left side term-by-term), gives us that
n = 1 ∑ ∞ n x n − 1 = ( 1 − x ) 2 1 ⟹ n = 1 ∑ ∞ n x n = ( 1 − x ) 2 x .
Setting x = 3 1 and multiplying by 2 then gives us the desired sum, i.e.,
n = 1 ∑ ∞ 2 ∗ n ( 3 1 ) n = 2 ∗ ( 1 − 3 1 ) 2 3 1 = ( 3 2 ) 2 3 2 = 2 3 .
Too good, sir! But I just wanted to know if we can use this technique in all such type of questions related to progressions
that was really nice
This Problem Is For Both Senior And Tertiary Level?
My name for such sequences is "Arithmetic-Geometric Progression". I am not aware of a worldwide term given to such sequences.
The extensions of it are related to partial fractions, telescoping sums, taylor series, etc.
Log in to reply
Well, I gave such an unusual name because just think of the time when you came across such problem for the first time, didn't you think of cancelling the n's on denominator and numerator..., well even if you cancel them in this question, you are going to get the same answer i.e 3/2.
By expanding out the sum and letting it equal S , we have: S = 3 2 + 9 4 + 2 7 6 + 8 1 8 … By multiplying both sides by 2 3 , the equation more simply becomes 2 3 S = 1 + 3 2 + 9 3 + 2 7 4 …
Now consider the expansion ( 1 − x ) − 2 = 1 + 2 x + 3 x 2 + 4 x 3 … , by setting x = 3 1 , It simply expands to ( 1 − 3 1 ) − 2 = 1 + 3 2 + 9 3 + 2 7 4 … = 3 2 S Hence, ( 3 2 ) − 2 = 2 3 S ⟹ S = 2 3
There is a very simple way to solve this. That is using euclidean algorithm. The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number.
So in this case, a-b= 1 because and b are co-prime integers (GCD=1)
Problem Loading...
Note Loading...
Set Loading...
Let S = ∑ 1 ∞ 3 n n = 3 1 + 9 2 + 2 7 3 + 8 1 4 + . . . . . . .
Then 3 1 S = 9 1 + 2 7 2 + 8 1 3 + . . . . . . .
Thus S − 3 1 S = 3 1 + 9 1 + 2 7 1 + 8 1 1 + . . . .
⟹ 3 2 S = 1 − 3 1 3 1 = 2 1 ⟹ S = 4 3 .
So the desired sum is 2 S = 2 3 , and thus a − b = 3 − 2 = 1 .