The polynomial part of a restricted partition function related to the Frobenius problem
Abstract
Given a set of positive integers A = a1,...,an, we study the number pA (t) of nonnegative integer solutions (m1,...,mn) to m1 a1 + ... mn an = t. We derive an explicit formula for the polynomial part of pA.
0
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.