arXiv · 2210.17019
Sylvester sums on the Frobenius set in arithmetic progression with initial gaps
Abstract
Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Frobenius number is the largest positive integer that is NOT representable in terms of $a_1,a_2,\dots,a_k$. When $k\ge 3$, there is no explicit formula in general, but some formulae may exist for special sequences $a_1,a_2,\dots,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,\dots,a_k$ forming arithmetic progressions with initial gaps.
Explore related subjects
Keep this discovery
Takao Komatsu. 2022-10-31. Sylvester sums on the Frobenius set in arithmetic progression with initial gaps. https://doi.org/10.1142/9789811272608_0005
Cite the original work for its findings. Save a collection to share your selection of sources.