Search Results for ""

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 ...

A Pythagorean triangle is a right triangle with integer side lengths (i.e., whose side lengths (a,b,c) form a Pythagorean triple). A Pythagorean triangle with GCD(a,b,c)=1 is ...

The formula giving the roots of a quadratic equation ax^2+bx+c=0 (1) as x=(-b+/-sqrt(b^2-4ac))/(2a). (2) An alternate form is given by x=(2c)/(-b+/-sqrt(b^2-4ac)). (3)

A recurrence relation between the function Q arising in quota systems, Q(n,r)=Q(n-1,r-1)+Q(n-1,r).

The recurrence relation E_n=E_2E_(n-1)+E_3E_(n-2)+...+E_(n-1)E_2 which gives the solution to Euler's polygon division problem.