Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius

DOI10.1016/0022-314X(90)90150-PzbMath0695.10012WikidataQ123328324 ScholiaQ123328324MaRDI QIDQ909697

Jacques Dixmier

Publication date: 1990

Published in: Journal of Number Theory (Search for Journal in Brave)

zbMATH Keywords

Frobenius problemFrobenius numberlinear diophantine equation

Mathematics Subject Classification ID

Linear Diophantine equations (11D04)

Related Items (10)

The structure of higher sumsets ⋮ Addendum to ``Structure theorem for multiple addition ⋮ Weighted multi-connected loop networks ⋮ Unnamed Item ⋮ The Frobenius postage stamp problem, and beyond ⋮ Some additive applications of the isoperimetric approach ⋮ \(\omega\)-regular languages are testable with a constant number of queries ⋮ More on change-making and related problems ⋮ A multiple set version of the \(3k-3\) theorem ⋮ On consecutive subset sums

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds for a Linear Diophantine Problem of Frobenius, II
• A Bound for a Solution of a Linear Diophantine Problem
• On a linear diophantine problem of Frobenius
• On a Problem of Partitions

This page was built for publication: Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius