scientific article; zbMATH DE number 3619982
From MaRDI portal
Publication:4182585
Denote by \(D_j(b)\) the number of solutions in non-negative integers to the equation \[ a_1x_1 + \cdots +a_jx_j =b, \] where \(a_1, \ldots, a_j, b\) are given positive integers. The author proves that \(D_j(b) = D_{j-1}(b)\) if \(b<a_j\) and \(D_j(b) = D_{j-1}(b) + D_j(b - a_j)\) if \(b\ge a_j\). He interpretes his formulae graph-theoretically and describes an algorithm for finding the number of non-negative solutions as well as the solutions themselves. A numerical example is discussed in full detail. [For the entire collection see Zbl 0386.00003.]
Recommendations
Cited in
(13)- Efficient solution of linear diophantine equations
- A fast method for finding the basis of non-negative solutions to a linear diophantine equation
- Positive solutions to some systems of Diophantine equations
- A remark of Diophantine equantion ax+by=n
- Continuant, caterpillar, and topological index Z. III: Graph-theoretical algorithm for and interpretation of solving linear Diophantine equations
- The exact number of nonnegative integer solutions for a linear Diophantine inequality
- scientific article; zbMATH DE number 3908510 (Why is no real title available?)
- scientific article; zbMATH DE number 3918453 (Why is no real title available?)
- scientific article; zbMATH DE number 4077322 (Why is no real title available?)
- scientific article; zbMATH DE number 22639 (Why is no real title available?)
- scientific article; zbMATH DE number 1507932 (Why is no real title available?)
- Natural solutions of Diophantine linear equation with \(n\) unknowns
- scientific article; zbMATH DE number 205729 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4182585)