On the linear diophantine problem of Frobenius (Q1335265)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the linear diophantine problem of Frobenius
scientific article

    Statements

    On the linear diophantine problem of Frobenius (English)
    0 references
    0 references
    28 September 1994
    0 references
    Concerning the Frobenius problem with \(n=3\) a new lower bound and another proof of a well known upper bound for the largest non representable integer \(g=g(a_ 1,a_ 2,a_ 3)\) is given. Further the author discusses a polynomial time algorithm for the computation of \(g\) and some open problems.
    0 references
    linear diophantine equations
    0 references
    Frobenius problem
    0 references
    new lower bound
    0 references
    upper bound
    0 references
    polynomial time algorithm
    0 references

    Identifiers