On a problem of Frobenius in three numbers - Computer Science > Discrete MathematicsReportar como inadecuado




On a problem of Frobenius in three numbers - Computer Science > Discrete Mathematics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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.



Autor: Abdelwaheb Miled

Fuente: https://arxiv.org/







Documentos relacionados