On the Unicity Conjecture for Markoff Numbers
Canadian mathematical bulletin, Tome 39 (1996) no. 1, pp. 3-9
Voir la notice de l'article provenant de la source Cambridge
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: x 2 + y 2 + m 2 = 3xym. We show this is true if either m, 3m — 2 or 3m + 2 is prime, twice a prime or four times a prime.
Baragar, Arthur. On the Unicity Conjecture for Markoff Numbers. Canadian mathematical bulletin, Tome 39 (1996) no. 1, pp. 3-9. doi: 10.4153/CMB-1996-001-x
@article{10_4153_CMB_1996_001_x,
author = {Baragar, Arthur},
title = {On the {Unicity} {Conjecture} for {Markoff} {Numbers}},
journal = {Canadian mathematical bulletin},
pages = {3--9},
year = {1996},
volume = {39},
number = {1},
doi = {10.4153/CMB-1996-001-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1996-001-x/}
}
Cité par Sources :