This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: product 2), and (1,1) (with product 1). There are several lists of positive integers that add up to 3, and they yield several di erent products: (3) (with product 3), (2,1) (with product 2), and (1,1,1) (with product 1). If n is a positive integer, what is the maximum product that can be formed of a list of positive integers that sum to n? You can continue working on this problem at: https://wwwcgi.cdf.toronto.edu/~heap/cgibin/Solvent/wiki.pl?Problem_Solving_Home_Page Use your CDF login as the userid and your student number as the password. 1 Hint 1, organize: Even for fairly small number n , your will have quite a large list of numbers that sum to n . Do you have some organizing principle for your lists? Hint 2, economize: Are there some lists that you can remove from consideration right away? 2...
View
Full
Document
 Fall '10
 DannyHeap
 Computer Science

Click to edit the document details