Markov triples with two Fibonacci components (Q2697600)

Summary: In this paper, we prove that there are at most finitely many pairs of Fibonacci numbers \((x, y) = (F_m, F_n)\) with the property that \(m \leq n\) and the pair \((m, n) \not\in \{(1, 2 r - 1), (1, 2), (2, 2 r + 1), (2 r + 1, 2 r + 3) : r \geq 1 \}\) such that \((x, y, z)\) is a Markov triple for some integer \(z\).