Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site harvard.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!think!harvard!baron
From: baron@harvard.UUCP (Jeff Baron)
Newsgroups: net.puzzle
Subject: Re: Find a set of ...
Message-ID: <781@harvard.UUCP>
Date: Sun, 16-Mar-86 16:20:55 EST
Article-I.D.: harvard.781
Posted: Sun Mar 16 16:20:55 1986
Date-Received: Fri, 21-Mar-86 06:55:07 EST
References: <3201@sdcc3.UUCP>
Reply-To: baron@harvard.UUCP (Jeff baron)
Distribution: na
Organization: Aiken Comp Lab, Harvard
Lines: 13

In article <3201@sdcc3.UUCP> kemasa@sdcc3.UUCP (kemasa) writes:

>
>The question of a set of number whose sum = C with the maximum product.
>

Try to do this when the set of numbers equal to C can be composed only of
integers, ie. find the set of integers whose sum is equal to C and
whose product is as large as possible.

-- 
					Jeff Baron
					{allegra,genrad,ucbvax}!harvard!baron