On a problem of Frobenius in three numbers

Details On a problem of Frobenius in three numbers On a problem of Frobenius in three numbers

2009-02-02

arxiv.org/abs/0902.0084v2

Computer Science

Discrete Mathematics

5 pages

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

On a problem of Frobenius in three numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On a problem of Frobenius in three numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a problem of Frobenius in three numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-158890