Search Results for ""

The Frobenius equation is the Diophantine equation a_1x_1+a_2x_2+...+a_nx_n=b, where the a_i are positive integers, b is an integer, and the solutions x_i are nonnegative ...

The Diophantine equation x_1^2+x_2^2+...+x_n^2=ax_1x_2...x_n which has no integer solutions for a>n.

The recurrence relation (n-1)A_(n+1)=(n^2-1)A_n+(n+1)A_(n-1)+4(-1)^n valid for n=4, 5, ... with A(2)=0 and A(3)=1 and which solves the married couples problem (Dörrie 1965, ...

The Diophantine equation x^2+y^2+z^2=3xyz. The Markov numbers m are the union of the solutions (x,y,z) to this equation and are related to Lagrange numbers.

A method used by Gauss to solve the quadratic Diophantine equation of the form mx^2+ny^2=A (Dickson 2005, pp. 391 and 407).

For a catastrophically unstable recurrence in one direction, any seed values for consecutive x_j and x_(j+1) will converge to the desired sequence of functions in the ...

An integer which is expressible in only one way in the form x^2+Dy^2 or x^2-Dy^2 where x^2 is relatively prime to Dy^2. If the integer is expressible in more than one way, it ...

For every k>1, there exist only finite many pairs of powers (p,p^') with p and p^' natural numbers and k=p^'-p.

An integer which is expressible in more than one way in the form x^2+Dy^2 or x^2-Dy^2 where x^2 is relatively prime to Dy^2. If the integer is expressible in only one way, it ...

Given a Pythagorean triple (a,b,c), the fractions a/b and b/a are called Pythagorean fractions. Diophantus showed that the Pythagorean fractions consist precisely of ...