Let n1<n2<n3<n4<n5 be positive such that n1+n2+n3+n4+n5=20. The numbers of such distinct arrangements (n1, n2, n3, n4, n5) is
The correct option is
C
7
Given,
n1<n2<n3<n4<n5
n1+n2+n3+n4+n5=20
Now, we will solve this by using combination method.
When we arrange n5 carry forward moves from 0 to 4, the arrangement looks like-
4(C0)+4(c1)4+4(C2)3+4(C3)2+(4(C4))1=[∵n(Cr)=n!/r!(n−r)!]
=1+1+2+2+1
=7
So, the number of distinct arrangement are seven.
Hence, the correct answer is option (C).