On a Diophantine Problem

1957/01/01 by J. B. Roberts, Joe Roberts · 1 citation
Mathematics · Computer Science · #Commutative Algebra and Its Applications #Polynomial and algebraic computation

paper · pdf · doi:10.4153/cjm-1957-025-8

Abstract

If a 1 , a 2 , … , a k are relatively prime positive integers then the equation always has solutions in non-negative x i for n sufficiently large. Sylvester called the number of non-negative solutions of (1) the denumerant of the equation. We shall denote the denumerant by n (a 1 , … , a k ).

Cited by

• A Linear Diophantine Problem

Related

• A Linear Diophantine Problem
• On the number of integer non-negative solutions of a linear Diophantine equation
• Some Diophantine equations and inequalities with primes
• Multivariate Diophantine equations with many solutions
• Small systems of Diophantine equations with a prescribed number of solutions in non-negative integers