Re: Subset sum question
- From: grpadmin@xxxxxxxxx
- Date: Wed, 1 Oct 2008 13:31:49 -0700 (PDT)
On Sep 27, 11:03 am, Dennis Freinz <geranium_ti...@xxxxxxxxxxx> wrote:
To Gerhard Paseman,
I think I understand your construction. Let me make a sample, so you
can see whether I understand what you have written.
N = 3
There are 3 sum-targets, for example: 15, 30 and 60
15 = 8 + 7 = 3 + 12
30 = 16 + 14 = 6 + 24
60 = 32 + 28 = 12 + 48
S = 8, 7, 3, 12, 16, 14, 6, 24, 32, 28, 12, 48
Hmm, it seems quite hard to get all the numbers to be different. 12
appears twice. I've tried several samples, but always duplicates wind
up. Maybe my scheme is to simple: 30 = 15 * 2, 60 = 15 * 4
But this multiplication is what you meant, right?
Thanks :)
As Jym and Matt elsewhere replied, the multiplication isn't the point
so much
as coming up with examples where lots of subsets have the same sum.
However, it is still not clear what you want. Do you want an example
like
those given to show there may be many subsets of a set with the same
sum?
Or are you looking at something similar to what Tim is suggesting
regarding
partitions?
Again, rephrasing the question would be the most help.
Gerhard Paseman, 2009.10.01
.
- Follow-Ups:
- Re: Subset sum question
- From: Dennis Freinz
- Re: Subset sum question
- From: Dennis Freinz
- Re: Subset sum question
- Prev by Date: Google Chrome: Insult at Best
- Next by Date: Re: graduate school in theoretical computer science
- Previous by thread: Google Chrome: Insult at Best
- Next by thread: Re: Subset sum question
- Index(es):
Relevant Pages
|