RankRizz
JEE MAIN 2018 · 16 APR ONLINE+4 / −1MEDIUMTRANSCRIBED

JEE Main 2018 Mathematics question — Arithmetic progression

Let 1x1,1x2,…,1xn\frac{1}{x_1}, \frac{1}{x_2}, \ldots, \frac{1}{x_n} (xi≠0x_i \neq 0 for i = 1, 2, ..., n) be in A.P. such that x1=4x_1 = 4 and x21=20x_{21} = 20. If n is the least positive integer for which xn>50x_n \gt 50, then ∑i=1n(1xi)\sum_{i=1}^{n}\left(\frac{1}{x_i}\right) is equal to:

SOLUTION

We are told that the quantities 1x1,1x2,…,1xn\dfrac1{x_1},\dfrac1{x_2},\ldots ,\dfrac1{x_n} form an arithmetic progression (A.P.).

In any A.P., if the first term is denoted by aa and the common difference by dd, then the kthk^{\text{th}} term is given by the formula

ak=a+(k−1)d.a_k=a+(k-1)d.

Here the first term of the A.P. of reciprocals is

a=1x1=14,a=\dfrac1{x_1}=\dfrac14,

because x1=4.x_1=4.

We are also given x21=20,x_{21}=20, therefore

a21=1x21=120.a_{21}=\dfrac1{x_{21}}=\dfrac1{20}.

Using the general term formula for k=21k=21 we write

120=a+(21−1)d.\dfrac1{20}=a+(21-1)d.

Substituting a=14a=\dfrac14 we obtain

120=14+20d.\dfrac1{20}=\dfrac14+20d.

We isolate dd step by step:

20d=120−14,20d=\dfrac1{20}-\dfrac14,

20d=120−520=−420=−15,20d=\dfrac1{20}-\dfrac5{20}=-\dfrac4{20}=-\dfrac15,

d=−1/520=−1100.d=\dfrac{-1/5}{20}=-\dfrac1{100}.

Thus the common difference of the reciprocals is negative: d=−1100.d=-\dfrac1{100}. Because the reciprocals decrease by 1100\dfrac1{100} each step, the actual xix_i increase with ii.

Next we must find the least positive integer nn for which xn>50.x_n\gt 50. The condition xn>50x_n\gt 50 is equivalent to

1xn<150.\dfrac1{x_n}\lt \dfrac1{50}.

Again using the general term formula for reciprocals we write

1xn=a+(n−1)d=14+(n−1) ⁣(−1100)=14− n−1 100.\dfrac1{x_n}=a+(n-1)d=\dfrac14+(n-1)\!\left(-\dfrac1{100}\right)=\dfrac14-\dfrac{\,n-1\,}{100}.

We demand

14− n−1 100<150.\dfrac14-\dfrac{\,n-1\,}{100}\lt \dfrac1{50}.

To compare the fractions conveniently we convert everything to the common denominator 100100:

14=25100,150=2100.\dfrac14=\dfrac{25}{100},\qquad \dfrac1{50}=\dfrac{2}{100}.

Hence the inequality becomes

25100− n−1 100<2100.\dfrac{25}{100}-\dfrac{\,n-1\,}{100}\lt \dfrac{2}{100}.

Multiplying by 100100 (a positive number, so the sense of the inequality is preserved) we get

25−(n−1)<2.25-(n-1)\lt 2.

Now simplify step by step:

25−n+1<2,25-n+1\lt 2,

26−n<2,26-n\lt 2,

−n<−24.-n\lt -24.

When we multiply both sides by −1-1 we must reverse the inequality sign:

n>24.n\gt 24.

The least positive integer satisfying this is clearly

n=25.n=25.

Therefore the required sum of reciprocals involves the first 2525 terms of the A.P.

For the sum of the first nn terms of an A.P. we repeatedly use the well-known formula

Sn=n2(2a+(n−1)d),S_n=\frac{n}{2}\Bigl(2a+(n-1)d\Bigr),

or, equivalently, Sn=n2(a1+an).S_n=\dfrac{n}{2}(a_1+a_n). Either form is correct; we shall employ the first.

Substituting n=25,  a=14,  d=−1100n=25,\;a=\dfrac14,\;d=-\dfrac1{100} we write

S25=252(2⋅14+(25−1) ⁣(−1100)).S_{25}=\frac{25}{2}\Bigl(2\cdot\dfrac14+(25-1)\!\left(-\dfrac1{100}\right)\Bigr).

Compute each part carefully. First,

2⋅14=12.2\cdot\dfrac14=\dfrac12.

Next,

(25−1)d=24(−1100)=−24100=−625.(25-1)d=24\left(-\dfrac1{100}\right)=-\dfrac{24}{100}=-\dfrac6{25}.

Adding these two contributions yields

2a+(n−1)d=12−625.2a+(n-1)d=\dfrac12-\dfrac6{25}.

To combine the fractions, convert 12\dfrac12 to the denominator 100100 for convenience:

12=50100,625=24100.\dfrac12=\dfrac{50}{100},\qquad \dfrac6{25}=\dfrac{24}{100}.

Hence

12−625=50100−24100=26100=1350.\dfrac12-\dfrac6{25}=\dfrac{50}{100}-\dfrac{24}{100}=\dfrac{26}{100}=\dfrac{13}{50}.

We can now complete the sum:

S25=252(1350)=25×132×50=325100=134.S_{25}= \frac{25}{2}\left(\dfrac{13}{50}\right)=\dfrac{25\times13}{2\times50}=\dfrac{325}{100}=\dfrac{13}{4}.

Thus the value of ∑i=1n(1xi)\displaystyle\sum_{i=1}^{n}\left(\dfrac1{x_i}\right) is 134.\dfrac{13}{4}.

Hence, the correct answer is Option C.

Tagged Arithmetic progression. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicArithmetic progression
TypeMultiple choice