Izvorni znanstveni članak
On the number of solutions of the Diophantine equation of Frobenius - General case
T. Komatsu
Sažetak
We determine the number of solutions of the equation $a_1 x_1+a_2
x_2+\cdots+a_m x_m=b$ in non-negative integers $x_1$, $x_2$,
$\dots$, $x_n$. If $m=2$, then the largest $b$ for which no
solution exists is $a_1 a_2-a_1-a_2$, and an explicit formula for
the number of solutions is known. In this paper we give the method
for computing the desired number. The method is illustrated with
several examples.
Ključne riječi
Diophantine problem of Frobenius; number of solutions
Hrčak ID:
730
URI
Datum izdavanja:
22.12.2003.
Posjeta: 2.313 *