From: utzoo!decvax!harpo!duke!ucf-cs!goldfarb Newsgroups: net.math Title: Stamp Problem Article-I.D.: ucf-cs.708 Posted: Wed Jul 21 02:10:08 1982 Received: Sun Jul 25 05:07:49 1982 This is a little integer problem related to a mythical practical situation. Consider that it is only possible to paste one, two, or three stamps on an envelope. Then tell me which N different denominations of stamps are required to produce the longest con- tinuous range of attainable postage values on such letters start- ing at one cent with an increment of one cent. For example for N=2, 1 and 3 would combine to produce the values {1,2,3,4,5,6,7} which is better than 1 and 2 which would only yield {1,2,3,4,5,6}. I have solutions for N < 9. After that, my algo- rithm executes in time exceeding the MTBC (mean time between crashes). I am interested in seeing solutions and execution times for all values of N and especially those >= 9. Ben Goldfarb University of Central Florida ..duke!ucf-cs!goldfarb