JEE Main 2019 Mathematics question — Geometric progression and infinite GP
Let a1,a2,a3,…,a10 be in G.P. with ai>0 for i=1,2,…,10 and S be the set of pairs (r,k), r,k∈N (the set of natural numbers) for which logea1ra2klogea4ra5klogea7ra8klogea2ra3klogea5ra6klogea8ra9klogea3ra4klogea6ra7klogea9ra10k=0. Then the number of elements in S, is:
SOLUTION
Let the given geometric progression have first term a1=A and common ratio q, where, as stated, every ai>0. Hence, for every natural number n, we have the standard G.P. relation
an=Aqn−1.
We need logarithms of these terms, so we write
logean=loge(Aqn−1)=logeA+(n−1)logeq.
For simplicity, put
α=logeA,d=logeq.
Because the logarithms form an arithmetic progression, we may list them as
L1=α,L2=α+d,L3=α+2d,…,L10=α+9d,
where, in general,
Li=α+(i−1)d.
Now consider the three-by-three matrix inside the determinant. Every entry is of the form logeajraj+1k with suitable j. Using the logarithm law logexy=logex+logey together with logexr=rlogex, we get
To decide when this determinant vanishes, we first explore the structure of P. Substitute each Li=α+(i−1)d explicitly:
P=αα+3dα+6dα+dα+4dα+7dα+2dα+5dα+8d.
Look at the three row-vectors of P:
Row 1: (α,α+d,α+2d)
Row 2: (α+3d,α+4d,α+5d)=Row1+3d(1,1,1)
Row 3: (α+6d,α+7d,α+8d)=Row1+6d(1,1,1).
Thus each row differs from the previous one by the same vector3d(1,1,1). Consequently, the three rows are linearly dependent; in fact
Row3−2Row2+Row1=0.
Linear dependence of the rows implies
detP=0,
so rankP≤2.
The matrix Q is obtained from P by adding d(1,1,1) to each column, i.e.
Row 1 of Q is Row1+d(1,1,1),
Row 2 of Q is Row2+d(1,1,1),
Row 3 of Q is Row3+d(1,1,1).
Therefore every row of Q lies in the two-dimensional subspace spanned by
v1=(α,α+d,α+2d),v2=(1,1,1).
Hence rankQ≤2 and so
detQ=0.
Now compare the row spaces of P and Q. Because both are contained in the span of v1 and v2, they are the same two-dimensional subspace. Consequently, any linear combination of P and Q, i.e. rP+kQ, has all three rows lying in that same plane. This guarantees that
rank(rP+kQ)≤2⟹det(rP+kQ)=0
for every choice of the natural numbers r and k (indeed, for every real r,k).
Thus the determinant in the problem statement vanishes for all ordered pairs (r,k)∈N×N. The set
S={(r,k)∈N×N:detM=0}
therefore contains every such pair, and because N×N is infinite, so is S.
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.