RankRizz
JEE ADVANCED 2020 · PAPER 2+4 / −2HARDTRANSCRIBED

JEE Advanced 2020 Mathematics question — Products of coefficients and calculus-based sums

For nonnegative integers s and r, let
(sr)={s!r!(s−r)!ifr≤s0ifr>s\left(\begin{array}{c}s\\ r\end{array}\right) = \begin{cases}\frac{s!}{r!(s - r)!} & if r \leq s\\0 & if r > s\end{cases}
For positive integers 𝑚 and 𝑛, let
g(m,n)=∑p=0m+nf(m,n,p)(n+pp)g(m, n) = \sum_{p=0}^{m+n}\frac{f(m, n, p)}{\left(\begin{array}{c}n+p\\ p\end{array}\right)}
where for any nonnegative integer 𝑝,
f(m,n,p)=∑i=0p(mi)(n+ip)(p+np−i)f(m, n, p) = \sum_{i=0}^{p}\left(\begin{array}{c}m\\ i\end{array}\right)\left(\begin{array}{c}n+i\\ p\end{array}\right)\left(\begin{array}{c}p+n\\ p - i\end{array}\right)
Then which of the following statements is/are TRUE?

SOLUTION

We begin with the given definitions. For non-negative integers s,rs,r

(sr)={s!r!(s−r)!,r≤s0,r>s\left(\begin{array}{c}s\\ r\end{array}\right)= \begin{cases} \dfrac{s!}{r!(s-r)!}, & r\le s\\[4pt] 0, & r\gt s \end{cases}

For positive integers m,nm,n we have

g(m,n)=∑p=0m+nf(m,n,p)(n+pp)g(m,n)=\sum_{p=0}^{m+n}\dfrac{f(m,n,p)}{\left(\begin{array}{c}n+p\\ p\end{array}\right)}

where

f(m,n,p)=∑i=0p(mi)(n+ip)(p+np−i).f(m,n,p)=\sum_{i=0}^{p}\left(\begin{array}{c}m\\ i\end{array}\right) \left(\begin{array}{c}n+i\\ p\end{array}\right) \left(\begin{array}{c}p+n\\ p-i\end{array}\right).

Our objective is to evaluate g(m,n)g(m,n) and then verify the four statements.

Step 1 : Simplifying the inner summand

Rewrite the third binomial as (p+np−i)=(p+nn+i).\left(\begin{array}{c}p+n\\ p-i\end{array}\right)= \left(\begin{array}{c}p+n\\ n+i\end{array}\right).

Divide each term of the inner sum by the denominator of g(m,n)g(m,n):

Ti,p=(mi)(n+ip)(p+np−i)(n+pp).T_{i,p}=\dfrac {\displaystyle\left(\begin{array}{c}m\\ i\end{array}\right) \left(\begin{array}{c}n+i\\ p\end{array}\right) \left(\begin{array}{c}p+n\\ p-i\end{array}\right)} {\displaystyle\left(\begin{array}{c}n+p\\ p\end{array}\right)}.

Using factorial definitions,

(p+np−i)(n+pp)=(n+p)!(p−i)! (n+i)!⋅p! n!(n+p)!=p! n!(p−i)! (n+i)!.\dfrac{\left(\begin{array}{c}p+n\\ p-i\end{array}\right)} {\left(\begin{array}{c}n+p\\ p\end{array}\right)} =\dfrac{(n+p)!}{(p-i)!\,(n+i)!}\cdot \dfrac{p!\,n!}{(n+p)!} =\dfrac{p!\,n!}{(p-i)!\,(n+i)!}. Also (n+ip)=(n+i)!p! (n+i−p)!.\left(\begin{array}{c}n+i\\ p\end{array}\right)= \dfrac{(n+i)!}{p!\,(n+i-p)!}.

Therefore

Ti,p=(mi)(n+i)!p! (n+i−p)!  p! n!(p−i)! (n+i)!=(mi)n!(p−i)! (n+i−p)!.T_{i,p}= \left(\begin{array}{c}m\\ i\end{array}\right) \dfrac{(n+i)!}{p!\,(n+i-p)!}\; \dfrac{p!\,n!}{(p-i)!\,(n+i)!} = \left(\begin{array}{c}m\\ i\end{array}\right) \dfrac{n!}{(p-i)!\,(n+i-p)!}.

The denominator inside equals that of the binomial (np−i)\left(\begin{array}{c}n\\ p-i\end{array}\right), hence

Ti,p=(mi)(np−i).T_{i,p}= \left(\begin{array}{c}m\\ i\end{array}\right) \left(\begin{array}{c}n\\ p-i\end{array}\right).

Step 2 : Rewriting g(m,n)g(m,n) with the simplified term

Plugging Ti,pT_{i,p} into the definition of g(m,n)g(m,n):

g(m,n)=∑p=0m+n  ∑i=0p(mi)(np−i).g(m,n)=\sum_{p=0}^{m+n}\;\sum_{i=0}^{p} \left(\begin{array}{c}m\\ i\end{array}\right) \left(\begin{array}{c}n\\ p-i\end{array}\right).

Step 3 : Changing the order of summation

Put j=p−ij=p-i so that j≥0j\ge 0 and i+j=pi+j=p. The constraints 0≤i≤m0\le i\le m and 0≤j≤n0\le j\le n automatically guarantee 0≤p=i+j≤m+n0\le p=i+j\le m+n. Hence every ordered pair (i,j)(i,j) with 0≤i≤m, 0≤j≤n0\le i\le m,\,0\le j\le n appears exactly once.

Therefore the double sum factorises:

g(m,n)=∑i=0m(mi)∑j=0n(nj)=(∑i=0m(mi))(∑j=0n(nj)).g(m,n)=\sum_{i=0}^{m}\left(\begin{array}{c}m\\ i\end{array}\right) \sum_{j=0}^{n}\left(\begin{array}{c}n\\ j\end{array}\right) =\Bigg(\sum_{i=0}^{m}\left(\begin{array}{c}m\\ i\end{array}\right)\Bigg) \Bigg(\sum_{j=0}^{n}\left(\begin{array}{c}n\\ j\end{array}\right)\Bigg).

Step 4 : Using the binomial theorem

The well-known identity ∑k=0r(rk)=2r\sum_{k=0}^{r}\left(\begin{array}{c}r\\ k\end{array}\right)=2^{r} gives

g(m,n)=2m 2n=2 m+n.g(m,n)=2^{m}\,2^{n}=2^{\,m+n}.

Step 5 : Verifying the statements

A. g(m,n)=2 m+n=2 n+m=g(n,m).g(m,n)=2^{\,m+n}=2^{\,n+m}=g(n,m). True.

B. g(m,n+1)=2 m+n+1=2 m+1+n=g(m+1,n).g(m,n+1)=2^{\,m+n+1}=2^{\,m+1+n}=g(m+1,n). True.

C. g(2m,2n)=2 2m+2n=4 m+n,2 g(m,n)=2 m+n+1.g(2m,2n)=2^{\,2m+2n}=4^{\,m+n},\quad 2\,g(m,n)=2^{\,m+n+1}. For m+n>1m+n\gt 1 the two sides are unequal; hence the relation is not generally valid. False.

D. g(2m,2n)=2 2(m+n)=(2 m+n)2=(g(m,n))2.g(2m,2n)=2^{\,2(m+n)}=\big(2^{\,m+n}\big)^{2}=\big(g(m,n)\big)^{2}. True.

Final result
The correct statements are Option A, Option B and Option D.

Tagged Products of coefficients and calculus-based sums. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicProducts of coefficients and calculus-based sums
TypeMultiple correct