JEE Advanced 2020 Mathematics question — Products of coefficients and calculus-based sums
For nonnegative integers s and r, let (sr)={r!(s−r)!s!0ifr≤sifr>s For positive integers 𝑚 and 𝑛, let g(m,n)=∑p=0m+n(n+pp)f(m,n,p) where for any nonnegative integer 𝑝, f(m,n,p)=∑i=0p(mi)(n+ip)(p+np−i) Then which of the following statements is/are TRUE?
SOLUTION
We begin with the given definitions.
For non-negative integers s,r
(sr)=⎩⎨⎧r!(s−r)!s!,0,r≤sr>s
For positive integers m,n we have
g(m,n)=∑p=0m+n(n+pp)f(m,n,p)
where
f(m,n,p)=∑i=0p(mi)(n+ip)(p+np−i).
Our objective is to evaluate 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).
Divide each term of the inner sum by the denominator of g(m,n):
Ti,p=(n+pp)(mi)(n+ip)(p+np−i).
Using factorial definitions,
(n+pp)(p+np−i)=(p−i)!(n+i)!(n+p)!⋅(n+p)!p!n!=(p−i)!(n+i)!p!n!.
Also
(n+ip)=p!(n+i−p)!(n+i)!.
The denominator inside equals that of the binomial (np−i), hence
Ti,p=(mi)(np−i).
Step 2 : Rewriting g(m,n) with the simplified term
Plugging Ti,p into the definition of g(m,n):
g(m,n)=∑p=0m+n∑i=0p(mi)(np−i).
Step 3 : Changing the order of summation
Put j=p−i so that j≥0 and i+j=p.
The constraints 0≤i≤m and 0≤j≤n automatically guarantee
0≤p=i+j≤m+n.
Hence every ordered pair (i,j) with 0≤i≤m,0≤j≤n appears exactly once.