On a problem of Frobenius in three numbers
Discrete Mathematics
2009-05-25 v2
Abstract
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).
Cite
@article{arxiv.0902.0084,
title = {On a problem of Frobenius in three numbers},
author = {Abdelwaheb Miled},
journal= {arXiv preprint arXiv:0902.0084},
year = {2009}
}
Comments
5 pages