Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site oddjob.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxn!ihnp4!oddjob!matt
From: matt@oddjob.UUCP (Matt Crawford)
Newsgroups: net.puzzle
Subject: Re: Find a set of ... [New and Improved]
Message-ID: <1217@oddjob.UUCP>
Date: Fri, 28-Feb-86 01:09:24 EST
Article-I.D.: oddjob.1217
Posted: Fri Feb 28 01:09:24 1986
Date-Received: Sat, 1-Mar-86 03:49:54 EST
References: <1057@decwrl.DEC.COM> <9081@ucla-cs.ARPA>
Reply-To: matt@oddjob.UUCP (Matt Crawford)
Organization: U. Chicago, Astronomy & Astrophysics
Lines: 13
Summary: 

In article <9081@ucla-cs.ARPA> verma@ucla-cs.UUCP (Thomas S. Verma ) writes:
>
>        Find a bag/set of natural numbers which sum to N and have a
>        maximal product.
>                                                TS Verma

I already posted the answer to the "bag" half.  I have an
algorithm which solves the "set" half, but so far no explicit
representation of the solution.  Come on, let's not always see
the same hands!
_____________________________________________________
Matt		University	crawford@anl-mcs.arpa
Crawford	of Chicago	ihnp4!oddjob!matt