An Optimal Lower Bound for the Frobenius Problem
| dc.creator | Aliev, Iskander | |
| dc.creator | Gruber, Peter | |
| dc.date | 2005-12-05 | |
| dc.date | 2006-03-29 | |
| dc.date.accessioned | 2026-07-07T06:54:50Z | |
| dc.date.available | 2026-07-07T06:54:50Z | |
| dc.description | Given $N$ positive integers $a_1, ..., a_N$ with $\gcd(a_1, ..., a_N)=1$, let $f_N$ denote the largest natural number which is not a positive integer combination of $a_1, ..., a_N$. This paper gives an optimal lower bound for $f_N$ in terms of the absolute inhomogeneous minimum of the standard $(N-1)$-simplex. | |
| dc.description | 10 pages | |
| dc.identifier | https://arxiv.org/abs/math/0512083 | |
| dc.identifier | http://arxiv.org/abs/math/0512083 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/106081 | |
| dc.subject | Number Theory | |
| dc.subject | 11D85; 11H31; 52C17 | |
| dc.title | An Optimal Lower Bound for the Frobenius Problem | |
| dc.type | text |