Sage: Ticket #17040: Add Frobenius number and solutions to Sage
https://trac.sagemath.org/ticket/17040
<p>
Linear Diophantine equations are cool. Turns out there are <em>some</em> algorithms for computing the <a class="ext-link" href="http://reference.wolfram.com/language/tutorial/Frobenius.html"><span class="icon"></span>Frobenius number</a> as well, though I am surprised Mma claims to have a good one for big <code>n</code> - maybe it's just brute force.
</p>
<p>
Putting under number theory but if you can think of a better component, be my guest.
</p>
en-usSagehttps://trac.sagemath.org/chrome/site/logo_sagemath_trac.png
https://trac.sagemath.org/ticket/17040
Trac 1.1.6kcrismanThu, 25 Sep 2014 16:03:36 GMT
https://trac.sagemath.org/ticket/17040#comment:1
https://trac.sagemath.org/ticket/17040#comment:1
<p>
Presumably the papers mentioned <a class="ext-link" href="http://mathoverflow.net/questions/23153/frobenius-number-for-three-numbers"><span class="icon"></span>here</a> will be useful - Wagon is pretty proud of the algorithm in Mma, but the paper points out lattE would work as well, and we have access to some such polytope things...
</p>
Ticket