arXiv · 2402.07853
A New Algorithm for Computing the Frobenius Number
Abstract
A number $\alpha$ has a representation with respect to the numbers $\alpha_1,...,\alpha_n$, if there exist the non-negative integers $\lambda_1,... ,\lambda_n$ such that $\alpha=\lambda_1\alpha_1+...+\lambda_n \alpha_n$. The largest natural number that does not have a representation with respect to the numbers $\alpha_1,...,\alpha_n$ is called the Frobenius number and is denoted by the symbol $g(\alpha_1,...,\alpha_n)$. In this paper, we present a new algorithm to calculate the Frobenius number. Also we present the sequential form of the new algorithm.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Abbas Taheri, Saeid Alikhani. 2024-02-12. A New Algorithm for Computing the Frobenius Number. https://arxiv.org/abs/2402.07853
Cite the original work for its findings. Save a collection to share your selection of sources.