Hostname: page-component-77c89778f8-sh8wx Total loading time: 0 Render date: 2024-07-21T21:13:30.344Z Has data issue: false hasContentIssue false
  • English
  • Français

Bounds for a Linear Diophantine Problem of Frobenius, II

Published online by Cambridge University Press:  20 November 2018

Yehoshua Vitek
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.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 28 , Issue 6 , 01 December 1976 , pp. 1280 - 1288
Copyright
Copyright © Canadian Mathematical Society 1976

References

1. Brauer, A., On a problem of partitions, Amer. J. Math. 64 (1942), 299–312.Google Scholar
2. Erdos, P. and Graham, R. L., On a linear diophantine problem of Frobenius, Acta Arith. 21 (1972), 399–408.Google Scholar
3. Lewin, M., A bound for a solution of a linear diophantine problem, J. London Math. Soc. 6 (1972), 61–69.Google Scholar
4. Mann, H., An addition theorem for sets of elements of abelian groups, Proc. Amer. Math. Soc. 4 (1953), 423.Google Scholar
5. Roberts, J. B., Note on linear forms, Proc. Amer. Math. Soc. 7 (1956), 465–469.Google Scholar
6. Vitek, Y., Bounds for a linear diophantine problem of Frobenius, J. London Math. Soc. (2) 10 (1975), 79–85.Google Scholar