Positive integers n 1 < n 2 < n 3 < n 4 < n 5 are such that n 1 + n 2 + n 3 + n 4 + n 5 = 2 0 . Find the number of distinct tuples of ( n 1 , n 2 , n 3 , n 4 , n 5 ) .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Set n2=n1+t1,n3=n2+t2,n4=n3+t3,n5=n4+t4 where all ti's>0. You get 5n1+4t1+3t2+2t3+t4=0. It's trivial to check that it has 7 solutions in positive integers.
Problem Loading...
Note Loading...
Set Loading...
as minimum value of n (i) can be i,
let n(i) = i+a (i). where all ai's >=0. so we get
a1+a2+a3+a4+a5=5
for any partition of 5 (eg. 5=0+0+0+0+5) there corresponds only one solution to above eqn. hence number of solution is same as number partitions of 5, which is 7.