Coefficient of x3 in (1+x)m is (3m).
Hence the coefficient contributed by the terms (1+x)3+(1+x)4+…+(1+x)99 equals
∑m=399(3m).
Using the identity ∑r=0N(kr)=(k+1N+1), we get
∑m=399(3m)=(4100).
The last term (1+kx)100 contributes (3100)k3 to the coefficient of x3.
Therefore the required total coefficient is
(4100)+(3100)k3.
According to the question, this must equal (43n+4101)(3100).
Dividing by (3100) gives
(3100)(4100)+k3=43n+4101.
Simplify (3100)(4100):
3!97!100!4!96!100!=4!96!3!97!=246×97=497.
Hence
497+k3=43n+4101.
Multiplying by 4:
97+4k3=172n+101⟹4k3=172n+4.
Dividing by 4 gives the key relation
k3−1=43n.
This means k3≡1(mod43) and n=43k3−1∈N.
We need the smallest natural k giving a positive n.
Test successive values of k (mod 43):
k=1:k3=1(⇒n=0,not allowed)
k=2:23=8=1
k=3:33=27=1
k=4:43=64≡21 (mod 43)
k=5:53=125≡39 (mod 43)
k=6:63=216≡1 (mod 43).
Thus the smallest suitable k is k=6.
For this value,
n=4363−1=43215=5.
Hence p=k=6 and
p+n=6+5=11.
Option B which is: 11