Opened 6 years ago

Last modified 6 years ago

## #17040 new enhancement

# Add Frobenius number and solutions to Sage

Reported by: | kcrisman | Owned by: | |
---|---|---|---|

Priority: | minor | Milestone: | sage-6.4 |

Component: | number theory | Keywords: | |

Cc: | Merged in: | ||

Authors: | Reviewers: | ||

Report Upstream: | N/A | Work issues: | |

Branch: | Commit: | ||

Dependencies: | Stopgaps: |

### Description

Linear Diophantine equations are cool. Turns out there are *some* algorithms for computing the Frobenius number as well, though I am surprised Mma claims to have a good one for big `n`

- maybe it's just brute force.

Putting under number theory but if you can think of a better component, be my guest.

**Note:**See TracTickets for help on using tickets.

Presumably the papers mentioned here 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...