Generalized Frobenius Number of Three Variables
Abstract
For k ≥ 2 , we let A = (a1, a2, …, ak) be a k-tuple of positive integers with (a1, a2, …, ak) =1 and, for a non-negative integer s, the generalized Frobenius number of A, g(A;s) = g(a1, a2, …, ak;s), the largest integer that has at most s representations in terms of a1, a2, …, ak with non-negative integer coefficients. In this article, we give a formula for the generalized Frobenius number of three positive integers (a1,a2,a3) with certain conditions.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.