Weighted Sylvester sums on the Frobenius set in more variables
Abstract
Let a1,a2,…,ak be positive integers with (a1,a2,…,ak)=1. Let NR= NR(a1,a2,…,ak) denote the set of positive integers nonrepresentable in terms of a1,a2,…,ak. The largest nonrepresentable integer NR, the number of nonrepresentable positive integers Σn∈ NR1 and the sum of nonrepresentable positive integers Σn∈ NRn have been widely studied for a long time as related to the famous Frobenius problem. In this paper by using Eulerian numbers, we give formulas for the weighted sum Σn∈ NRλnnμ, where μ is a nonnegative integer and λ is a complex number. We also examine power sums of nonrepresentable numbers and some formulae for three variables. Several examples illustrate and support our results.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.