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\).
Recommendations
- Some problems concerning the Frobenius number for extensions of an arithmetic progression
- The linear diophantine problem of Frobenius for subsets of arithmetic sequences
- The Frobenius problem for modified arithmetic progressions
- scientific article; zbMATH DE number 5557899
- scientific article; zbMATH DE number 4006336
- On a problem of Frobenius.
- scientific article; zbMATH DE number 3176160
- scientific article; zbMATH DE number 3983264
- scientific article; zbMATH DE number 1320681
- scientific article; zbMATH DE number 1295502
Cited in
(6)- Extremal Frobenius numbers in a class of sets
- An algorithm for a linear Diophantine equation and a problem of Frobenius
- Skolem's solution to a problem of Frobenius
- The Frobenius problem for classes of polynomial solvability.
- An algorithm for the Frobenius problem
- scientific article; zbMATH DE number 5557899 (Why is no real title available?)
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)