We have to evaluate the expression
1⋅1P1+2⋅2P2+3⋅3P3+…+15⋅15P15
and compare it with qPr−s where 0≤s≤1.
After finding q,r,s we shall compute q+sCr−s.
First recall the definition of permutations:
nPr=(n−r)!n!.
In every term of our sum the two numbers are the same, i.e. r=n, so we get
kPk=(k−k)!k!=0!k!=k!.
Hence every term simplifies to k⋅k! and the entire left‐hand side becomes
∑k=115k⋅k!.
There is a standard identity:
∑k=1nk⋅k!=(n+1)!−1.
This can be proved quickly by mathematical induction, but we shall accept it as known.
Putting n=15 we obtain
∑k=115k⋅k!=(15+1)!−1=16!−1.
So the given equality becomes
qPr−s=16!−1.
Now s can be only 0 or 1.
If s=0 we would need qPr=16!−0=16!−1, which is not a factorial and very unlikely to be a permutation value.
Choosing s=1 gives
qPr=16!.
To realise a value of exactly 16! with a permutation, the simplest way is to take r=q.
Then
qPq=q!,
and the equation q!=16! forces
q=16,r=16.
Therefore we have found
q=16,r=16,s=1.
We are asked to compute
q+sCr−s.
Substituting the values just obtained, we get
q+sCr−s=16+1C16−1=17C15.
The binomial coefficient satisfies nCr=nCn−r, so
17C15=17C2.
Using the combination formula
nCr=r!(n−r)!n!,
we calculate
17C2=2!15!17!=2⋅15!17⋅16⋅15!=217⋅16=136.
Hence, the correct answer is Option 136.