A New Algorithm for Computing the Frobenius Number
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910328515723264 |
|---|---|
| author | Taheri, Abbas Alikhani, Saeid |
| author_facet | Taheri, Abbas Alikhani, Saeid |
| contents | A number $α$ has a representation with respect to the numbers $α_1,...,α_n$, if there exist the non-negative integers $λ_1,... ,λ_n$ such that $α=λ_1α_1+...+λ_n α_n$. The largest natural number that does not have a representation with respect to the numbers $α_1,...,α_n$ is called the Frobenius number and is denoted by the symbol $g(α_1,...,α_n)$. In this paper, we present a new algorithm to calculate the Frobenius number. Also we present the sequential form of the new algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_07853 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A New Algorithm for Computing the Frobenius Number Taheri, Abbas Alikhani, Saeid Number Theory 01B39, 11D04 A number $α$ has a representation with respect to the numbers $α_1,...,α_n$, if there exist the non-negative integers $λ_1,... ,λ_n$ such that $α=λ_1α_1+...+λ_n α_n$. The largest natural number that does not have a representation with respect to the numbers $α_1,...,α_n$ is called the Frobenius number and is denoted by the symbol $g(α_1,...,α_n)$. In this paper, we present a new algorithm to calculate the Frobenius number. Also we present the sequential form of the new algorithm. |
| title | A New Algorithm for Computing the Frobenius Number |
| topic | Number Theory 01B39, 11D04 |
| url | https://arxiv.org/abs/2402.07853 |