Let n1<n2<n3<n4<n5 be positive integers such that n1+n2+n3+n4+n5=20. Then the number of such distinct arrangements (n1,n2,n3,n4,n5) is ______. [2014]
(7)
∵ n1,n2,n3,n4 and n5 are positive integers such that n1<n2<n3<n4<n5
Then for n1+n2+n3+n4+n5=20
If n1,n2,n3,n4 take minimum values 1,2,3,4 respectively, then n5 will be maximum 10.
∴ Corresponding to n5=10, there is only one solution
n1=1, n2=2, n3=3, n4=4.
Corresponding to n5=9, we can have only one solution
n1=1, n2=2, n3=3, n4=5 i.e., one solution.
Corresponding to n5=8, we can have, only solution
n1=1, n2=2, n3=3, n4=6
or n1=1, n2=2, n3=4, n4=5
i.e., 2 solutions.
For n5=7, we can have
n1=1, n2=2, n3=4, n4=6
or n1=1, n2=3, n3=4, n4=5
For n5=6, we can have
n1=2, n2=3, n3=4, n4=5
i.e., one solution.
∴ Thus there can be 7 solutions.