10 algorithms for long arithmetic
The coin problem (Frobenius problem) is a mathematical problem that asks what is the largest monetary amount that cannot be obtained using only coins of specified denominations.
This notebook features Mathematica functions for working with and visualizing C-semigroups in N², using the Normaliz package. Normaliz is an open-source tool for computations in affine monoids, lattice polytopes, and rational cones (https://www.normaliz.uni-osnabrueck.de/).
Calculators for basic needs for solving problems related to matrices and graphs
Add a description, image, and links to the frobenius topic page so that developers can more easily learn about it.
To associate your repository with the frobenius topic, visit your repo's landing page and select "manage topics."