On the number of solutions to a Diophantine equation

DOI10.1016/0097-3165(72)90023-4zbMath0249.10016OpenAlexW2130235097MaRDI QIDQ2556350

Bruce Faaland

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(72)90023-4

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Linear Diophantine equations (11D04)

Related Items (4)

F-signature function of quotient singularities ⋮ An algorithm for the 0/1 Knapsack problem ⋮ An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players ⋮ On the least common multiple of several random integers

Cites Work

• Unnamed Item
• A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables
• Partitions - a survey

This page was built for publication: On the number of solutions to a Diophantine equation