Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T07:22:31.925Z Has data issue: false hasContentIssue false

Bounds for a Linear Diophantine Problem of Frobenius, II

Published online by Cambridge University Press:  20 November 2018

Yehoshua Vitek*
Affiliation:
Israel Institute of Technology, Haifa, Israel
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let A = ﹛a0, a1, … , a3﹜ be a set of relatively prime integers such that 0 < a0 < a1 < … < as = n. Let ϕ (A) denote the smallest integer such that, for N ≧ ϕ (A), the equation

should always have a solution in nonnegative integers.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1976