RankRizz
JEE MAIN 2019 · 10 JAN S2+4 / −1MEDIUMTRANSCRIBED

JEE Main 2019 Mathematics question — Geometric progression and infinite GP

Let a1,a2,a3,…,a10a_1, a_2, a_3, \ldots, a_{10} be in G.P. with ai>0a_i > 0 for i=1,2,…,10i = 1, 2, \ldots, 10 and SS be the set of pairs (r,k)(r, k), r,k∈Nr, k \in N (the set of natural numbers) for which ∣log⁡ea1ra2klog⁡ea2ra3klog⁡ea3ra4klog⁡ea4ra5klog⁡ea5ra6klog⁡ea6ra7klog⁡ea7ra8klog⁡ea8ra9klog⁡ea9ra10k∣=0\begin{vmatrix} \log_e a_1^r a_2^k & \log_e a_2^r a_3^k & \log_e a_3^r a_4^k \\ \log_e a_4^r a_5^k & \log_e a_5^r a_6^k & \log_e a_6^r a_7^k \\ \log_e a_7^r a_8^k & \log_e a_8^r a_9^k & \log_e a_9^r a_{10}^k \end{vmatrix} = 0. Then the number of elements in SS, is:

SOLUTION

Let the given geometric progression have first term a1=Aa_1=A and common ratio qq, where, as stated, every ai>0a_i>0. Hence, for every natural number nn, we have the standard G.P. relation

an=Aq n−1.a_n=Aq^{\,n-1}.

We need logarithms of these terms, so we write

log⁡ean=log⁡e ⁣(Aq n−1)=log⁡eA+(n−1)log⁡eq.\log_e a_n=\log_e\!\left(Aq^{\,n-1}\right)=\log_e A+\left(n-1\right)\log_e q.

For simplicity, put

α=log⁡eA,d=log⁡eq.\alpha=\log_e A, \qquad d=\log_e q.

Because the logarithms form an arithmetic progression, we may list them as

L1=α,  L2=α+d,  L3=α+2d,  …,  L10=α+9d,L_1=\alpha,\; L_2=\alpha+d,\;L_3=\alpha+2d,\;\ldots,\;L_{10}=\alpha+9d,

where, in general,

Li=α+(i−1)d.L_i=\alpha+\left(i-1\right)d.

Now consider the three-by-three matrix inside the determinant. Every entry is of the form log⁡eaj raj+1 k\log_e a_j^{\,r}a_{j+1}^{\,k} with suitable jj. Using the logarithm law log⁡exy=log⁡ex+log⁡ey\log_e xy=\log_e x+\log_e y together with log⁡exr=rlog⁡ex\log_e x^r=r\log_e x, we get

log⁡eaj raj+1 k=rlog⁡eaj+klog⁡eaj+1=rLj+kLj+1.\log_e a_j^{\,r}a_{j+1}^{\,k}=r\log_e a_j+k\log_e a_{j+1}=rL_j+kL_{j+1}.

Writing out all nine entries produces

M=(rL1+kL2rL2+kL3rL3+kL4rL4+kL5rL5+kL6rL6+kL7rL7+kL8rL8+kL9rL9+kL10).M=\begin{pmatrix} rL_1+kL_2 & rL_2+kL_3 & rL_3+kL_4\\[4pt] rL_4+kL_5 & rL_5+kL_6 & rL_6+kL_7\\[4pt] rL_7+kL_8 & rL_8+kL_9 & rL_9+kL_{10} \end{pmatrix}.

Observe that each entry is linear in rr and kk, so we can separate the whole matrix into a linear combination of two fixed matrices:

M=rP+kQ,M=rP+kQ,

where

P=(L1L2L3L4L5L6L7L8L9),Q=(L2L3L4L5L6L7L8L9L10).P=\begin{pmatrix} L_1 & L_2 & L_3\\ L_4 & L_5 & L_6\\ L_7 & L_8 & L_9 \end{pmatrix}, \qquad Q=\begin{pmatrix} L_2 & L_3 & L_4\\ L_5 & L_6 & L_7\\ L_8 & L_9 & L_{10} \end{pmatrix}.

Our determinant is therefore

det⁡M=det⁡ ⁣(rP+kQ).\det M=\det\!\left(rP+kQ\right).

To decide when this determinant vanishes, we first explore the structure of PP. Substitute each Li=α+(i−1)dL_i=\alpha+(i-1)d explicitly:

P=(αα+dα+2dα+3dα+4dα+5dα+6dα+7dα+8d).P=\begin{pmatrix} \alpha & \alpha+d & \alpha+2d\\ \alpha+3d & \alpha+4d & \alpha+5d\\ \alpha+6d & \alpha+7d & \alpha+8d \end{pmatrix}.

Look at the three row-vectors of PP:

Row 1: (α,  α+d,  α+2d)\bigl(\alpha,\;\alpha+d,\;\alpha+2d\bigr)

Row 2: (α+3d,  α+4d,  α+5d)=Row1+3d (1,1,1)\bigl(\alpha+3d,\;\alpha+4d,\;\alpha+5d\bigr)=\text{Row}_1+3d\,(1,1,1)

Row 3: (α+6d,  α+7d,  α+8d)=Row1+6d (1,1,1).\bigl(\alpha+6d,\;\alpha+7d,\;\alpha+8d\bigr)=\text{Row}_1+6d\,(1,1,1).

Thus each row differs from the previous one by the same vector 3d (1,1,1)3d\,(1,1,1). Consequently, the three rows are linearly dependent; in fact

Row3−2Row2+Row1=0.\text{Row}_3-2\text{Row}_2+\text{Row}_1=0.

Linear dependence of the rows implies

det⁡P=0,\det P=0,

so rank⁡P≤2\operatorname{rank}P\le 2.

The matrix QQ is obtained from PP by adding d (1,1,1)d\,(1,1,1) to each column, i.e.

Row 1 of QQ is Row1+d (1,1,1),\text{Row}_1+d\,(1,1,1),

Row 2 of QQ is Row2+d (1,1,1),\text{Row}_2+d\,(1,1,1),

Row 3 of QQ is Row3+d (1,1,1).\text{Row}_3+d\,(1,1,1).

Therefore every row of QQ lies in the two-dimensional subspace spanned by

v1=(α,  α+d,  α+2d),v2=(1,1,1).v_1=\bigl(\alpha,\;\alpha+d,\;\alpha+2d\bigr), \qquad v_2=(1,1,1).

Hence rank⁡Q≤2\operatorname{rank}Q\le 2 and so

det⁡Q=0.\det Q=0.

Now compare the row spaces of PP and QQ. Because both are contained in the span of v1v_1 and v2v_2, they are the same two-dimensional subspace. Consequently, any linear combination of PP and QQ, i.e. rP+kQrP+kQ, has all three rows lying in that same plane. This guarantees that

rank⁡ ⁣(rP+kQ)≤2⟹det⁡ ⁣(rP+kQ)=0\operatorname{rank}\!\left(rP+kQ\right)\le 2\quad\Longrightarrow\quad\det\!\left(rP+kQ\right)=0

for every choice of the natural numbers rr and kk (indeed, for every real r,kr,k).

Thus the determinant in the problem statement vanishes for all ordered pairs (r,k)∈N×N(r,k)\in\mathbb N\times\mathbb N. The set

S={(r,k)∈N×N:det⁡M=0}S=\bigl\{(r,k)\in\mathbb N\times\mathbb N:\det M=0\bigr\}

therefore contains every such pair, and because N×N\mathbb N\times\mathbb N is infinite, so is SS.

Hence, the correct answer is Option A.

Tagged Geometric progression and infinite GP. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicGeometric progression and infinite GP
TypeMultiple choice