On a problem of Frobenius in three numbers
| dc.creator | Miled, Abdelwaheb | |
| dc.date | 2009-02-02 | |
| dc.date | 2009-05-25 | |
| dc.date.accessioned | 2026-07-07T13:17:26Z | |
| dc.date.available | 2026-07-07T13:17:26Z | |
| dc.description | For three positive integers ai, aj, ak pairwise coprime, we present an algorithm that find the least multiple of ai that is a positive linear combination of aj, ak. The average running time of this algorithm is O(1). Using this algorithm and the chinese remainder theorem leads to a direct computation of the Frobenius number f(a1, a2, a3). | |
| dc.description | 5 pages | |
| dc.identifier | https://arxiv.org/abs/0902.0084 | |
| dc.identifier | http://arxiv.org/abs/0902.0084 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/231113 | |
| dc.subject | Discrete Mathematics | |
| dc.title | On a problem of Frobenius in three numbers | |
| dc.type | text |