On the Frobenius conjecture for Markoff numbers
A Markoff triple is a triple \((a,b,c)\) of non-negative integers with \(a \leq b \leq c\) such that \(a^2 + b^2 + c^2 = 3abc\). In 1913 Frobenius suggested that each Markoff triple can be uniquely identified by its largest member \(c\). The problem has a long and interesting history. In particular [J. Number Theory 87, No. 1, 77--95 (2001; Zbl 0983.11040)] \textit{J. O. Button} showed that uniqueness holds whenever \(c = kp^\ell\) with \(p\) a prime and \(k,\ell\) positive integers such that \(k \leq 10^{35}\). The authors here show that uniqueness holds when \(3c \pm 2\) is of that form and \(k \leq 10^{10}\). The techniques are elementary and distinct from Button's.
- On the Frobenius conjecture
- On a conjecture of Fiedler and Markham
- On Frobenius' conjecture
- A note on the Markoff conjecture
- On the Unicity Conjecture for Markoff Numbers
- On a conjecture by Wilf about the Frobenius number
- On a conjecture by Fiedler, Markham, and Neumann
- scientific article; zbMATH DE number 935497
- On a generalization of the Frobenius number
- scientific article; zbMATH DE number 4218300
This page was built for publication: On the Frobenius conjecture for Markoff numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444500)
