Let k 1 , k 2 , … , be a sequence that is recursively defined as k n + 2 = k n + 1 + 2 k n , for all n ≥ 1 , with k 1 = k 2 = 1 . The infinite sum, S = 7 1 k 1 + 7 2 k 2 + 7 3 k 3 … , is a fraction of the form b a , where a and b are coprime integers. What is the value of 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.
The charactersitic equation of the recurrence relation is x 2 − x − 2 = ( x − 2 ) ( x + 1 ) = 0 with solutions 2 and − 1
Hence, k n = A 2 n + B ( − 1 ) n for some constants A and B
For n = 1 , k 1 = 1 = 2 A − B
For n = 2 , k 2 = 1 = 4 A + B
Solving for both equations, we get ( A , B ) = ( 3 1 , − 3 1 )
Therefore, k n = 3 1 ( 2 n − ( − 1 ) n )
S = i = 1 ∑ ∞ 5 i k i = 3 1 i = 1 ∑ ∞ 5 i 2 i − ( − 1 ) i = 3 1 i = 1 ∑ ∞ ( 5 2 ) i − ( − 5 1 ) i
= 3 1 ( 1 − 5 2 5 2 − 1 − ( − 5 1 ) − 5 1 ) = 3 1 ( 3 2 − ( − 6 1 ) ) = 1 8 5
Here the sequence can be written as 1 , 1 , 3 , 5 , 1 1 , 2 1 , 4 3 , 8 5 , 1 7 1 . . . . . . . .So, S = 5 1 1 + 5 2 1 + 5 3 3 + 5 4 5 + 5 5 1 1 . . . . . . Now we have to express it as a Geometric Progression to find sum to infinite terms. We observe that every second number is one less than the twice the number preceding it and every number on odd places is one more than twice the number preceding it. So, we separate the numbers on odd places and even places. Let S 1 , S 2 denote sum of odd and even places respectively. So, S 1 = 5 1 1 + 5 3 3 + 5 5 1 1 . . . . . . . . . . . . . and S 2 = 5 2 1 + 5 4 5 + 5 6 2 1 . . . . . . . . . . . . . Let us first compute S 1 . We intend to make it a GP. So we can rewrite S 1 as S 1 = ( 5 1 1 + 5 3 2 + 5 5 8 + 5 7 3 2 . . . . . ) + ( 5 1 0 + 5 3 1 + 5 5 3 + 5 7 1 1 . . . . . . . ) = ( 5 1 1 + 5 3 2 + 5 5 8 + 5 7 3 2 . . . . . ) + 5 2 1 ( 5 1 1 + 5 3 3 + 5 5 1 1 . . . . . . . ) = ( 5 1 1 + 5 3 2 + 5 5 8 + 5 7 3 2 . . . . . ) + 5 2 1 ( S 1 ) = ( 5 1 1 + 5 3 2 + 5 5 8 + 5 7 3 2 . . . . . ) + 5 2 1 ( ( 5 1 1 + 5 3 2 + 5 5 8 + 5 7 3 2 . . . . . ) + 5 2 1 ( S 1 ) ) . This becomes a GP with first term ( 5 1 1 + 5 3 2 + 5 5 8 + 5 7 3 2 . . . . . ) and common ratio 5 2 1 . Sum of infinite terms of GP= 1 − r a where a is first term and r is common ratio. Now let us first compute ( 5 1 1 + 5 3 2 + 5 5 8 + 5 7 3 2 . . . . . ) . Here apart from 5 1 1 other numbers are in GP with first term 5 3 2 and ratio 5 4 5 . So ( 5 1 1 + 5 3 2 + 5 5 8 + 5 7 3 2 . . . . . ) = 5 1 + 1 − 5 2 4 5 3 2 = 1 0 5 2 3 . So we have S 1 as a GP with first term 1 0 5 2 3 and ratio 5 2 1 . Therefore S 1 = 1 − 5 2 1 1 0 5 2 3 = 5 0 4 1 1 5 .Now S 2 = 5 2 1 + 5 4 5 + 5 6 2 1 . . . . . . . . . . . . . = ( 5 2 1 + 5 4 4 + 5 6 1 6 . . . . + 5 4 1 + 5 6 5 + 5 8 2 1 ) = ( 5 2 1 + 5 4 4 + 5 6 1 6 . . . . + 5 2 1 ( 5 2 1 + 5 4 5 + 5 6 2 1 . . . ) = ( 5 2 1 + 5 4 4 + 5 6 1 6 . . . . + 5 2 1 ( S 2 ) . As in the case of S 1 this is also a GP with first term 5 2 1 + 5 4 4 + 5 6 1 6 . . . . and common ratio 5 2 1 . Now let us compute 5 2 1 + 5 4 4 + 5 6 1 6 . . . . . This is a GP with first term 5 2 1 and common ratio 5 2 4 . Therefore 5 2 1 + 5 4 4 + 5 6 1 6 . . . . = 1 − 5 2 4 5 2 1 = 2 1 1 . So we have S 2 as a GP with first term 2 1 1 and ratio 5 2 1 . Therefore S 2 = 1 − 5 2 1 2 1 1 = 5 0 4 2 5 . Therefore we have S = S 1 + S 2 = 5 0 4 1 1 5 + 5 0 4 2 5 = 5 0 4 1 4 0 = 1 8 5 where 5 and 18 are co-prime. Hence the answer = 5 + 1 8 = 2 3 which is the required answer.
Did it similarity
The characteristic equation for the recurrence relation is x 2 − x − 2 = 0 . Hence x = 2 or x = − 1 . Therefore k n = a ( 2 n ) + b ( ( − 1 ) n )
Since k 1 = k 2 = 1 , we get a = 3 1 , b = − 3 1 . Hence k n = 3 1 ( 2 n ) − 3 1 ( ( − 1 ) n ) .
Hence we can proceed to find the infinite sum S . Now S = n = 1 ∑ ∞ 5 n k n = n = 1 ∑ ∞ 5 n 3 1 ( 2 n ) − 3 1 ( ( − 1 ) n ) = 3 1 n = 1 ∑ ∞ ( 5 2 ) n − 3 1 n = 1 ∑ ∞ ( 5 − 1 ) n = 3 1 × 1 − 5 2 5 2 − 3 1 × 1 − ( − 5 1 ) − 5 1 = 9 2 + 1 8 1 = 1 8 5 .
Hence a + b = 5 + 1 8 = 2 3 .
For a second-order linear recurrence equation of the form k n = α k n − 1 + β k n − 2 and k 1 = k 2 = 1 , the closed form for k n is given by
k n = a b ( a − b ) a n b ( 1 − b ) − b n a ( 1 − b ) ,
where a and b are the roots of the quadratic equation x 2 − α x − β = 0 .
Solving the quadratic equation x 2 − x − 2 = 0 will give us the roots 2 and − 1 .
Thus,
k n = 2 ( − 2 ) ( 2 − ( − 1 ) ) 2 n ( − 1 ) ( 1 − ( − 1 ) ) − ( − 1 ) n ( 2 ) ( 1 − 2 )
k n = 3 2 n − ( − 1 ) n
Given this formula for k n , we can easily solve the sum of the series S = 5 1 k 1 + 5 2 k 2 + 5 3 k 3 + . . . .
S = 3 1 ( 5 1 2 1 − ( − 1 ) 1 + 5 2 2 2 − ( − 1 ) 2 + 5 3 2 3 − ( − 1 ) 3 + … )
S = 3 1 ( 1 − 5 2 5 2 − 1 − ( 5 − 1 ) 5 − 1 )
S = 1 8 5
Thus, the answer is 5 + 1 8 = 2 3 .
notice that k n + 2 = k n + 1 + 2 k n ,we just multi S with 5 2 ,then we get 5 2 S = 5 2 2 k 1 + 5 3 2 k 2 … .
now ignore the 5 1 k 1 in S and add 5 2 S with S ,we get 5 7 S = 5 1 k 1 + 5 2 k 3 + 5 3 k 4 … . It's easy to see that 5 2 k 3 + 5 3 k 4 … is a part of 5 S = k 1 + 5 k 2 + 5 2 k 3 + 5 3 k 4 … .
now we get a equation: 5 7 S = 5 1 k 1 + 5 S − k 1 − 5 k 2 ,so 5 1 8 S = 1 , S = 1 8 5 ,finally a + b = 2 3
We first write the initial terms of the given series. They are 1,1,3,5,11,21,43,85,...
Observe that
1=1
1=1*2-1
3=1*4-1
5=1*8-3
11=1*16-5
k n = 2 n − 1 − k n − 1
Therefore,
S = i = 1 ∑ ∞ 5 n k n
S= i = 1 ∑ ∞ 5 i 2 i − 1 − k i − 1
where we consider k 0 to be 0 .
S= i = 1 ∑ ∞ 5 i 2 i − 1 - i = 1 ∑ ∞ 5 i k i − 1
S= i = 1 ∑ ∞ 5 i 2 i − 1 - 5 S
S = (A geometric Progression with first term 0.2 and common ratio 0.4) - 5 S
5 6 S = 1 − 0 . 4 0 . 2
or, S = 1 8 5
Therfore, the required answer is 23.
Note: The sum of a geometric progression with first term a and common ratio r is equal to 1 − r a
We can begin by looking for geometric sequences k n = k 0 ⋅ r n that follow the given recursive rule k n + 2 = k n + 1 + 2 k n .
For any such sequence, we have k 0 r n + 2 = k 0 r n + 1 + 2 k 0 r n , or r n + 2 = r n + 1 + 2 r n . Dividing by r n gives r 2 = r + 2 , the solutions to which are r = 2 , − 1 . So any geometric sequence with a common ratio of either 2 or − 1 will satisfy the recursive rule.
Let f n = 2 n and g n = ( − 1 ) n . Since these sequences individually satisfy the recursive rule, any linear combination thereof will do so as well. So we want to find values of a and b such that the sequence a f n + b g n is identical to the sequence k n as defined in the problem.
Since k 1 = k 2 = 1 , we need a f 1 + b g 1 = 1 and a f 2 + b g 2 = 1 . This becomes 2 a − b = 1 and 4 a + b = 1 , the solutions to which are a = 3 1 and b = − 3 1 . So an explicit formula for for k n is given by
k n = 3 1 ⋅ 2 n − 3 1 ( − 1 ) n .
The desired infinite sum is
S = n = 1 ∑ ∞ 7 n k n = n = 1 ∑ ∞ ( 3 1 ( 7 2 ) n − 3 1 ( − 7 1 ) n ) .
This can be split into a difference of two convergent geometric series:
3 1 n = 1 ∑ ∞ ( 7 2 ) n − 3 1 n = 1 ∑ ∞ ( − 7 1 ) n = 3 1 ( 5 2 ) − 3 1 ( − 8 1 ) = 4 0 7 .
So the answer is 7 + 4 0 = 4 7 .
S = k 1 / 7 + k 2 / 7 2 + … . Let it be equation 1. Now we divide the whole equation by 7. The result is S / 7 = k 1 / 7 2 + k 2 / 7 3 + … . Label this equation 2. Subtracting 2 from 1 we get 6 S / 7 = k 1 / 7 + ( k 2 − k 1 ) / 7 2 + ( k 3 − k 2 ) / 7 3 + … . 6 S / 7 = 1 / 7 + ( 2 k 1 / 7 3 + 2 k 2 / 7 4 + … ). Looking at the bracket part, we can write it in the form of S as 2 S / 7 2 .We get a single variable equation in S , that is 6 S / 7 = 1 / 7 + 2 S / 7 2 . Now solving for S gives S = 7 / 4 0 . Since we want a + b , the answer is 7 + 4 0 = 4 9 .
When working with infinite sums, we must be a bit careful about how we do arithmetic. In the above question, the most common approach was similar to the one shown above. We multiply the the sequence S = 7 k 1 + 4 9 k 2 + ⋯ by some value, subtract this from the original equation, and reduce the right hand side using the recurrence relation.
It is not always the case that with infinite sums we can add or subtract them in this manner. The reason we are allowed to do so in this instance is because all of the terms in the sum are positive, and we can show the series is bounded. To do this, we can show that k i < 3 i , and so \frac{k_1}{7^i} < \(\frac{3}{7}\right)^i , which means that the series is less than a geometric series with common ratio 7 3 < 1 , so it must converge.
The recursion k n + 2 = k n + 1 + 2 k n has the characteristic equation m 2 − m − 2 = 0 which gives the solution k n = A 2 n + B ( − 1 ) n for some constants A and B. Substituting the values of k for n=1 and n=2, we get an explicit solution to the recursion equation: k n = 3 2 n − ( − 1 ) n . Hence, S is given by 3 1 [ ( 7 2 + 7 2 2 2 + … ) − ( 7 − 1 + 7 2 1 2 − 7 3 1 + … ) ] = 3 1 ( 5 2 + 8 1 ) = 4 0 7 . Thus, the answer is 4 7 .
The key idea is to create a combination of S so that as many terms as possible cancel out.
We use the fact that k n + 2 − k n + 1 − 2 k n = 0 to cancel out most of the terms.
S = 7 k 1 + 7 2 k 2 + 7 3 k 3 + 7 4 k 4 + . . .
− 7 S = − ( 7 2 k 1 + 7 3 k 2 + 7 4 k 3 + . . . )
− 7 2 2 S = − ( 7 3 k 1 + 7 4 k 2 + . . . )
Adding up both sides we have 4 9 4 0 × S = 7 1 + 7 2 1 − 7 2 1 = 7 1
∴ S = 4 0 7
The series is 1/7,1/(7^2),3/(7^3),5/(7^4),11/(7^5),21/(7^6),43/(7^7),85/(7^8).......
We can split the above into two series: 1. 1/(7^1),3/(7^3),11/(7^5),43/(7^7)....... 2. 1/(7^2),5/(7^4),21/(7^6),85/(7^8).......
The sum of first series can be calculated in the following way:
S= 1/(7^1)+3/(7^3)+11/(7^5)+43/(7^7)+........
S*(1/(7^2))= 1/(7^3)+3/(7^5)+11/(7^7)+43/(7^9)+......
On subtracting the two equations we get,
S*(48/49)= 1/(7^1)+ 2/(7^3)+ 8/(7^5)+ 32/(7^7)+........
The above equation from the second term is a GP with first term as 2/(7^3) and common ratio as 4/(7^2). Thus we can find the sum for the above series and get S= (47x7)/(45x48)
Similarly, we can calculate the sum for the second series and get the sum= 49/(48x45)
On adding the above two series we get ((47x7)+ 49)/(48x45)= (54x7)/(45x48)= 7/40. Therefore, a+b=47
If
S = \frac{k_1}{7^1} + \frac{k_2}{7^2} + ...
, then by using the recursive definition,
S
=
0
+
7
1
k
1
+
7
2
k
2
+
7
3
k
2
+
7
4
k
3
+
7
5
k
4
+
.
.
.
+
7
3
2
k
1
+
7
4
2
k
2
+
7
5
2
k
3
+
.
.
.
. By grouping, we get:
S
=
7
1
k
1
+
7
2
k
2
+
7
3
2
k
1
+
7
9
(
7
3
k
2
+
7
4
k
3
+
7
5
k
4
+
.
.
.
)
=
2
4
3
5
8
+
4
9
9
(
S
−
7
1
)
. Putting
S
on one side, we get
S
=
4
0
7
⇒
4
7
2 S = 7 1 2 k 1 + 7 2 2 k 2 + …
7 S = k 1 + 7 1 k 2 + 7 2 k 3 + …
Since k n + 2 = k n + 1 + k n for all n ≥ 1 ,
By adding, 9 S = k 1 + 7 1 k 3 + 7 2 k 4 + … = k 1 + 4 9 S − 7 k 1 − k 2
Therefore, 4 0 S = 6 k 1 + k 2 = 7 ⇒ S = 4 0 7
First we solve the recurrence relation kn+2=kn+1 + 2 * kn, with k1=k2=1. Setting kn=a^n we get the characteristic equation: a^n+2 =a^n+1 + 2*a^n, which yields a^2-a-2=0. The roots are 2 and -1. That means that the solution of kn is: A1 * 2^n + A2 * (-1)^n . For n=1 and for n=2 we have the initial value 1, so we get that A1=1/3 and A2=-1/3. Setting bn=(kn/7)^n for n=1, 2, 3 … we get bn= 1/3 * (2/7)^n + 1/3 * (-1/7)^n . We want to calculate the infinite sum S=b1 + b2 + b3 + …. Since 2/7 + (2/7)^2 + (2/7)^ + … = 7/5 and (-1/7) + (-1/7)^2 + (-1/7) ^3 + (-1/7)^4 +… = -[ (1/7) + (1/7)^3 + (1/7)^5 +…] + [(1/7)^2 + (1/7)^4 + (1/7)^6 +…] = -7/48 + 1/48 = -6/48= -1/8 we finally get S=(1/3) * (2/5) + (-1/3) * (-1/8 ) =0.1750= 175/1000 =7/40=a/b, where a and b are co primes integers, so a+b=47.
It is clear that all the k i terms are positive, so k i are increasing and thus k n + 2 = k n + 1 + 2 k n ≤ 3 k n + 1 . It follows (by induction or otherwise) that 0 ≤ k i ≤ 3 i , hence the infinite sum converges to a value between 0 and 1 − 7 3 1 . Since all terms are positive, we are allowed to rearrange the terms.
Let S denote the infinite sum. Observe that
2 S 7 S 4 9 S = = = 7 − 1 1 + 7 0 1 + 7 0 1 + 7 1 2 + 7 1 1 + 7 1 3 + 7 2 2 + 7 2 3 + 7 2 5 + 7 3 6 + 7 3 5 + 7 3 1 1 + … … …
Hence 4 9 S − 7 S − 2 S = 7 , or S = 4 0 7 . Thus, a + b = 7 + 4 0 = 4 7 .
Note: Most students would not show that the sum S is finite. However, this is necessary to justify the validity of the next step.
Problem Loading...
Note Loading...
Set Loading...
Since S = 5 1 k 1 + 5 2 k 2 + 5 3 k 3 + 5 4 k 4 + . . . , we have the following:
(1) 2 S = 5 1 2 k 1 + 5 2 2 k 2 + 5 3 2 k 3 + 5 4 2 k 4 + . . .
(2) 5 S = k 1 + 5 1 k 2 + 5 2 k 3 + 5 3 k 4 + . . .
(3) 2 5 S = 5 k 1 + k 2 + 5 1 k 3 + 5 2 k 4 + . . .
Hence, it is clear that 2 5 S − 5 S − 2 S = 5 k 1 + k 2 − k 1 , or 1 8 S = 5 so S = 1 8 5 . Thus a + b = 2 3 .