You are not logged in.
Pages: 1
Let N be a no. of 4 digit numbers a b c d . where the digit satisfy the condition
(i) a<b<c<d
(ii) a>b>c>d
(iii) a<=b<=c<=d
(iv) a>=b>=c>=d
these are 4 different cases
then find total no. N in each cases
Offline
Hi;
i) This is the number of solutions to a+b+c+d =r with a<b<c<d and 10>a>0, 10>b,c,d>=0
ii) This is the number of solutions to a+b+c+d =r with a>b>c>d and 10>a>0, 10>b,c,d>=0
iii) This is the number of solutions to a+b+c+d =r with a<=b<=c<=d and 10>a>0, 10>b,c,d>=0
iv)This is the only one that has any theory connected with it that I am aware of. The generating function is:
The coefficient of x^4 = 714 so there 714 numbers like that. The formula is:
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
thanks bobbym
but how you get these things
Offline
Hi;
i,ii,iii are known to me because I do a lot of work with generating functions. Basically they had to be counted by a computer program. The binomials were surmised by playing spot the pattern.
iv) has a theoretical background. It comes from books. How it is derived exactly I do not know.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
thanks bobbym . is there is any link in which all things are present
Offline
Hi;
I would have used it and I did look. For the fourth one there is a mention of it at the OEIS but that requires that you already have the answer by some other method.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Pages: 1