On the Number of Solutions to a Diophantine Equation.
Abstract
Let A sub 1, ..., A sub r, x sub 1 primed, ..., x sub r primed and A be known positive integers. Let f(A) be the number of integer solutions (x sub 1, ..., x sub r) satisfying the Diophantine equation the summation from j=1 to r of ((A sub j) x sub j = A) and the conditions O < or = x sub j < or = x sub j primed, j = 1, ..., r. This paper expresses f(A) recursively as a linear function of f(0), f(1), ..., f(A-1). (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 12, 1970
- Accession Number
- AD0714795
Entities
People
- Bruce Faaland
Organizations
- Stanford University