Sylvester power and weighted sums on the Frobenius set in arithmetic progression

From MaRDI portal
Publication:2133405




Abstract: Let a1,a2,dots,ak be positive integers with gcd(a1,a2,dots,ak)=1. Frobenius number is the largest positive integer that is NOT representable in terms of a1,a2,dots,ak. When kge3, there is no explicit formula in general, but some formulae may exist for special sequences a1,a2,dots,ak, including, those forming arithmetic progressions and their modifications. In this paper, we give formulae for the power and weighted sum of nonrepresentable positive integers. As applications, we show explicit expressions of these sums for a1,a2,dots,ak forming arithmetic progressions.









This page was built for publication: Sylvester power and weighted sums on the Frobenius set in arithmetic progression

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