On the Unicity Conjecture for Markoff Numbers
Arthur Baragar · Canadian Mathematical Bulletin · 1996
Abstract In 1913 Frobenius conjectured that for any positive integer m, there exists at most one pair of integers (x, y) with 0 ≤ x ≤ y ≤ m such that (x, y, m) is a solution to the Markoff equation: x2 + y2 + m2 = 3xym. We show this is true if either m, 3m — 2 or 3m + 2 is prime, twice a prime or four times a prime.