This is a preview. Log in through your library . Abstract We extend the famous diophantine Frobenius problem to a ring of polynomials over a field 𝑘. Similar to the classical problem we show that the ...

We consider the following integer feasibility problem: Given positive integer numbers $a_{0}, a_{1},...., a_{n}$, $with gcd(a_{1},..., a_{n}) = 1$ and $a = (a_{1 ...