Sylvester sums on the Frobenius set in arithmetic progression with initial gaps

DOI10.1142/9789811272608_0005arXiv2210.17019MaRDI QIDQ6415580FDOQ6415580

Publication date: 30 October 2022

Abstract: Let

a_{1}, a_{2}, d o t s, a_{k}

be positive integers with

g c d (a_{1}, a_{2}, d o t s, a_{k}) = 1

. Frobenius number is the largest positive integer that is NOT representable in terms of

a_{1}, a_{2}, d o t s, a_{k}

. When

k g e 3

, there is no explicit formula in general, but some formulae may exist for special sequences

a_{1}, a_{2}, d o t s, a_{k}

, including, those forming arithmetic progressions and their modifications. In this paper we give explicit formulae for the sum of nonrepresentable positive integers (Sylvester sum) as well as Frobenius numbers and the number of nonrepresentable positive integers (Sylverster number) for

a_{1}, a_{2}, d o t s, a_{k}

forming arithmetic progressions with initial gaps.

This page was built for publication: Sylvester sums on the Frobenius set in arithmetic progression with initial gaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6415580)