Skoči na glavni sadržaj

Mathematical Communications, Vol. 8 No. 2, 2003.

Izvorni znanstveni članak

On the number of solutions of the Diophantine equation of Frobenius - General case

T. Komatsu

Puni tekst: engleski pdf 150 Kb

str. 195-206

preuzimanja: 2.059

citiraj

Sažetak

We determine the number of solutions of the equation a1x1+a2x2+⋯+amxm=b in non-negative integers x1, x2,
…, xn. If m=2, then the largest b for which no
solution exists is a1a2−a1−a2, 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

https://hrcak.srce.hr/730

Datum izdavanja:

22.12.2003.

Posjeta: 2.920 *

accessibility

closePristupačnostrefresh

Ako želite spremiti trajne postavke, kliknite Spremi, ako ne - vaše će se postavke poništiti kad zatvorite preglednik.