Arthur Baragar
Abstract
Open-access reader
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.
OpenAlex reports 31 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Mathematics, Conjecture, Integer (computer science), Prime (order theory), Combinatorics, Prime factor, Discrete mathematics, Programming language