Some Experimental Results on the Frobenius Problem
From MaRDI portal
Abstract: We study the Frobenius problem: given relatively prime positive integers , find the largest value of t (the Frobenius number) such that has no solution in nonnegative integers . Based on empirical data, we conjecture that except for some special cases the Frobenius number can be bounded from above by .
Cites work
- A Linear Diophantine Problem
- A Minimal-Path Algorithm for the "Money Changing Problem"
- An algorithm for a solution of a problem of Frobenius.
- Bounds for a Linear Diophantine Problem of Frobenius
- Computing the Ehrhart polynomial of a convex lattice polytope
- Lattice translates of a polytope and the Frobenius problem
- On a Problem of Partitions
- On the linear diophantine problem of Frobenius
- On the linear diophantine problem of Frobenius.
Cited in
(5)
This page was built for publication: Some Experimental Results on the Frobenius Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317273)