論部分馬可夫數之解 On the Solutions of Certain Markoff Numbers

Abstract
這篇論文主要是,藉由探討馬可夫方程式的解(a,b,c)與斐波那契(Fibnacci)數列、佩爾(pell)數列間特殊的關係,加以證明:當c是5乘以一個質數的n次方的形式時,其中這個質數被4除餘1,若a<13,此方程式只有(2,169,985)唯一一組解。
In this dissertation, by virtue of the relation between the solutions (a, b, c) of the Markoff equation and Fibonacci numbers, Pell numbers, we show that if c = 5p^n where p is a prime congruent to 1 modulo 4, and a< 13 then (2, 169, 985) is the unique solution of Markoff equation.
Description
Keywords
馬可夫方程式, 馬可夫數, Markoff equation, Markoff number
Citation
Collections