Generalized Frobenius Number of Three Variables (2309.09149v2)
Abstract: For $ k \geq 2 $, we let $ A = (a_{1}, a_{2}, \ldots, a_{k}) $ be a $k$-tuple of positive integers with $\gcd(a_{1}, a_2, \ldots, a_k) =1$ and, for a non-negative integer $s$, the generalized Frobenius number of $A$, $g(A;s) = g(a_1, a_2, \ldots, a_k;s)$, the largest integer that has at most $s$ representations in terms of $a_1, a_2, \ldots, a_k$ with non-negative integer coefficients. In this article, we give a formula for the generalized Frobenius number of three positive integers $(a_1,a_2,a_3)$ with certain conditions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.