Article contents
Bounds for a Linear Diophantine Problem of Frobenius, II
Published online by Cambridge University Press: 20 November 2018
Extract
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
- Copyright
- Copyright © Canadian Mathematical Society 1976
References
- 3
- Cited by