Advanced Search

The Markoff conjecture states that given a positive integer $c$, there is at most one triple $(a,b,c)$ of positive integers with $a\le b\le c$ that satisfies the equation $a^2+b^2+c^2=3abc$. The conjecture is known to be true when $c$ is a prime power or two times a prime power. We present an elementary proof of this result. We also show that if in the class group of forms of discriminant $d=9c^2-4$, every ambiguous form in the principal genus corresponds to a divisor of $3c-2$, then the conjecture is true. As a result, we obtain criteria in terms of...

We show that, with suitable modification, the upper bound estimates of Stolt for the fundamental integer solutions of the Diophantine equation Au²+Buv+Cv²=N, where A>0, N≠0 and B²-4AC is positive and nonsquare, in fact characterize the fundamental solutions. As a corollary, we get a corresponding result for the equation u²-dv²=N, where d is positive and nonsquare, in which case the upper bound estimates were obtained by Nagell and Chebyshev.