An upper bound for the h-range of the postage stamp problem

DOI10.4064/aa-54-4-301-306zbMath0705.11004OpenAlexW991172029MaRDI QIDQ3484904

Øystein J. Rødseth

Publication date: 1990

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/206260

zbMATH Keywords

postage stamp problemReichweiteextremal h-range

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Linear Diophantine equations (11D04)

Related Items (8)

On Frobenius numbers for symmetric (not complete intersection) semigroups generated by four elements ⋮ Weighted multi-connected loop networks ⋮ An optimal lower bound for the Frobenius problem ⋮ Bounds on generalized Frobenius numbers ⋮ Frobenius problem for semigroups \(\mathbf S(d_1,d_2,d_3)\). ⋮ The asymptotic distribution of Frobenius numbers ⋮ The postage stamp problem: The extremal basis for \(k=4\) ⋮ The Postage Stamp Problem: An algorithm to determine the $h$-range on the $h$-range formula on the extremal basis problem for $k=4$

This page was built for publication: An upper bound for the h-range of the postage stamp problem