Frobenius postage stamp problem | Frobenius problem | stamp problem

Consider a set A_n = {a_1, a_2, ..., a_n} of n positive integer-denomination postage stamps sorted such that 1 = a_1=0 and sum_(i = 1)^n x_i

coin problem | greedy algorithm | harmonious graph | integer relation | knapsack problem | stamp folding | Stöhr sequence | subset sum problem