On a problem of Frobenius for an almost consecutive set of integers.

From MaRDI portal





Let \(a_0,a_1,a_2,\ldots,a_k\) be positive integers such that \((a_0,a_1,\ldots,a_k) = 1\). The problem of Frobenius seeks the largest integer \(N\) for which the diophantine equation \[ a_0x_0 + a_1x_1 + \ldots + a_kx_k = n \] has no solution in non-negative integers. In this paper a simple algorithm for the solution of the problem is suggested for the case that \(a_0,a_1,\ldots,a_k\) are consecutive integers. The algorithm also provides a simple means to represent an integer \(n>N\).











This page was built for publication: On a problem of Frobenius for an almost consecutive set of integers.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4052211)