On a linear diophantine problem for geometrical type sequences

DOI10.1016/0012-365X(87)90116-6zbMath0615.10021OpenAlexW2002372178WikidataQ59561146 ScholiaQ59561146MaRDI QIDQ1820807

Endre Boros

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90116-6

zbMATH Keywords

Frobenius problemFrobenius numberlinear diophantine equationalmost geometric progression

Mathematics Subject Classification ID

Integer programming (90C10) Linear Diophantine equations (11D04)

Related Items (2)

A relation between the knapsack and group knapsack problems ⋮ An application of an optimal behaviour of the greedy solution in number theory

Cites Work

• Improving a method of search for solving polynomial equations
• Bounds for a Linear Diophantine Problem of Frobenius
• On a linear diophantine equation
• On the linear diophantine problem of Frobenius.
• A Bound for a Solution of a Linear Diophantine Problem
• On a linear diophantine problem of Frobenius
• On a Linear Diophantine Problem
• On a Problem of Partitions II
• On a Problem of Partitions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a linear diophantine problem for geometrical type sequences