Question
Question: What is the least value of \(n\) such that \(\left( {1 + 3 + {3^2} + \cdots + {3^n}} \right)\) excee...
What is the least value of n such that (1+3+32+⋯+3n) exceeds 2000 ?
A) 7
B) 5
C) 8
D) 6
Solution
We have to first observe that the given expression expressed in the bracket is a geometric progression with starting term one. We will have to find the sum of the given geometric progression and compare it with the given limit of the integer.
Complete step-by-step answer:
The given expression is (1+3+32+⋯+3n).
Observe that the series is a geometric progression with the first term of the series being 1 and the common ratio for the series being r=3 .
We have to find the least value of n such that the sum (1+3+32+⋯+3n) exceeds the number 2000 .
For a geometric progression with first term a and the common ratio r, the sum is given as follows:
Sn=r−1a(rn−1)
In the given expression we have a=1,r=3 thus the sum is given by:
⇒ Sn=3−11(3n−1)
We have to find the value of n such that the maximum value is 2000 .
Therefore, we will put that as the sum.
Hence, we get the following:
⇒ 2000=23n−1
That means we get,
⇒ 4001=3n
We know that 37>2000 .
Therefore, the least value of n=7 .
Hence, the correct option is A.
Note: Notice that first we established the type of the series that is expressed in. later we found the sum of the given series so that we can express the sum in general form. After that we will use the general expression and the given sum limit to find the bound.