Related papers: The generalized Frobenius problem via restricted p…

Let $N \geq 2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. The Frobenius number of this $N$-tuple is defined to be the largest positive integer that has no representation as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are…

Given relatively prime positive integers a_1,...,a_n, the Frobenius number is the largest integer that cannot be written as a nonnegative integer combination of the a_i. We examine the parametric version of this problem: given a_i=a_i(t) as…

The Frobenius number of relatively prime positive integers $a_1, \ldots, a_n$ is the largest integer that is not a nononegative integer combination of the $a_i.$ Given positive integers $a_1, \ldots, a_n$ with $n \ge 2,$ the set of…

The classical Frobenius problem is to compute the largest number g not representable as a non-negative integer linear combination of non-negative integers x_1, x_2, ..., x_k, where gcd(x_1, x_2, ..., x_k) = 1. In this paper we consider…

The famous linear diophantine problem of Frobenius is the problem to determine the largest integer (Frobenius number) whose number of representations in terms of $a_1,\dots,a_k$ is at most zero, that is not representable. In other words,…

We study a generalization of the \emph{Frobenius problem}: given $k$ positive relatively prime integers, what is the largest integer $g_0$ that cannot be represented as a nonnegative integral linear combination of these parameters? More…

We study the Frobenius problem: given relatively prime positive integers $a_1,...,a_d$, find the largest value of t (the Frobenius number) such that $\sum_{k=1}^d m_k a_k = t$ has no solution in nonnegative integers $m_1,...,m_d$. Based on…

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,…

In this paper we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integral combination of given relatively prime (strictly) positive integers (known as…

Given coprime positive integers $a_1 < ...< a_d$, the Frobenius number $F$ is the largest integer which is not representable as a non-negative integer combination of the $a_i$. Let $g$ denote the number of all non-representable positive…

Given positive integers $a_1,...,a_n$ with $\gcd(a_1,...,a_n) = 1$, we call an integer t representable if there exist nonnegative integers $m_1,...,m_n$ such that $t = m_1 a_1 + ... + m_n a_n$. In this paper, we discuss the linear…

The so-called Frobenius number in the famous linear Diophantine problem of Frobenius is the largest integer such that the linear equation $a_1 x_1+\cdots+a_k x_k=n$ ($a_1,\dots,a_k$ are given positive integers with $\gcd(a_1,\dots,a_k)=1$)…

Let $A=(a_1, a_2, ..., a_n)$ be relative prime positive integers with $a_i\geq 2$. The Frobenius number $g(A)$ is the greatest integer not belonging to the set $\big\{ \sum_{i=1}^na_ix_i\ |x_i\in \mathbb{N}\big\}$. The general Frobenius…

Given relative prime positive integers $A=(a_1, a_2, ..., a_n)$, the Frobenius number $g(A)$ is the largest integer not representable as a linear combination of the $a_i$'s with nonnegative integer coefficients. We find the ``Stable"…

In this paper we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integral combination of given relatively prime (strictly) positive integers (known as…

Let $N \geq2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. Frobenius number of this $N$-tuple is defined to be the largest positive integer that cannot be expressed as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are…

Given a set of positive integers A = {a_1,...,a_n}, we study the number p_A (t) of nonnegative integer solutions (m_1,...,m_n) to m_1 a_1 + ... m_n a_n = t. We derive an explicit formula for the polynomial part of p_A.

Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Frobenius number is the largest positive integer that is NOT representable in terms of $a_1,a_2,\dots,a_k$. When $k\ge 3$, there is no explicit formula in…

For given coprime positive integers $a$ and $b$, the classical Frobenius coin problem asked to find the largest number that cannot be expressed in the form $ax+by$ for nonnegative integers $x$ and $y$, also known as the Frobenius number.…

Let $A=(a_1, a_2, \ldots, a_n)$ be a sequence of relative prime positive integers with $a_i\geq 2$. The Frobenius number $F(A)$ is the largest integer not belonging to the numerical semigroup $\langle A\rangle$ generated by $A$. The genus…