In this paper we study how the number of nonnegative integer solutions of $s$ integer linear equations in $n |geq s$ unknowns varies as a function of the ...
In 1887 Runge [13] proved that a binary Diophantine equation $F(x, y) = 0$, with $F$ irreducible, in a class including those in which the leading form of $F$ is not a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback