On a problem of Frobenius in three numbers - Computer Science > Discrete MathematicsReport as inadecuate




On a problem of Frobenius in three numbers - Computer Science > Discrete Mathematics - Download this document for free, or read online. Document in PDF available to download.

Abstract: For three positive integers ai, aj, ak pairwise coprime, we present analgorithm that find the least multiple of ai that is a positive linearcombination of aj, ak. The average running time of this algorithm is O1.Using this algorithm and the chinese remainder theorem leads to a directcomputation of the Frobenius number fa1, a2, a3.



Author: Abdelwaheb Miled

Source: https://arxiv.org/



DOWNLOAD PDF




Related documents