An application of an optimal behaviour of the greedy solution in number theory
Date
1993
Authors
Vizvári, B.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
3
views
views
17
downloads
downloads
Citation Stats
Series
Abstract
Let a1, a2, ..., an be relative prime positive integers. The Frobenius problem is to determine the greatest integer not belonging to the set {Σj=1 najxj :x∈Z+ n}. The Frobenius problem belongs to the combinatorial number theory, which is very rich in methods. In this paper the Frobenius problem is handled by integer programming which is a new tool in this field. Some new upper bounds and exact solutions of subproblems are provided. A lot of earlier results obtained with very different methods can be discussed in a unified way.
Source Title
Periodica Mathematica Hungarica
Publisher
Akademiai Kiado Rt.
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English