another partition question
- From: niklaus@xxxxxxxxx
- Date: Tue, 7 Oct 2008 06:46:45 -0700 (PDT)
how many sols we have for a + b +c + d + e = n 0<=a<=k, 0<=b<=k
same bounds for all the elements ? Had it been 1 <=a<= k i could use
the coefficient of the generating function
The problem could be changed as "number of non negative solns of n
into k parts such that each part is from a set of elements."
product of ( 1/(1-x^i)) for 1<=i<=k , the coefficient of x^n gives
the number of solns
a) Now if we have 0<=i the generating function blow up because of 1/
(1-x^0) = 1/0 , so how do we tackle this in terms of generating
functions.
b) If it had be positive partitions i could have used p(n,k) =
p(n-1,k-1 ) + p(n-k,k) but when there is 0 allowed , i get something
like p(n,k) = p(n,k-1)(add a 0 ) + p (n-1,k) (u can increase one of
the terms by 1 ). Now when increasing any of the terms by 1, we are
over computing because the element +1 needn't be in set. Any
suggestions how to remove or a better recurrence?
.
- Follow-Ups:
- Re: another partition question
- From: Ray Koopman
- Re: another partition question
- From: Gerry Myerson
- Re: another partition question
- Prev by Date: Re: -- extending a homeomorphism
- Next by Date: Re: Solution manual to Engineering Mechanics - Statics,Dynamics (11th ) by R.C.HIBBELER
- Previous by thread: shoes china paypal www.paypalsell.com shoes paypal
- Next by thread: Re: another partition question
- Index(es):
Relevant Pages
|