Re: New Combination problem

On Jan 15, 8:25 am, "Dana" <ddelo...@xxxxxxxxxxxxx> wrote:
Any ideas here?  See item # 15.

http://mathworld.wolfram.com/PartitionFunctionQ.html

--
Dana

<hyperalgori...@xxxxxxxxx> wrote in message

news:5da721a4-96ce-4cba-b2ae-3976c9ddb359@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx



hi..

anybody has tried this kind of problem.
n={1,2,3,0}
r=2
so permutation is n^r=16.
the problem is to find out the possible no: of distinct sum like.
(1,2)=3 and (1,3)=4 are distinct sum while
(1,2)=3 and (0,3)=3 are not distinct sum- Hide quoted text -

- Show quoted text -

hi Dana

thanks for ur information. but it is partioning problem. my posted
problem is abt u have a set of numbers and want to find what are the
distinct sums? whats their distribution of occurance if we add three
of them, four of them and n of them like (1,1,1,2)=(0,1,2,2)?
.