首页 / 资料库 / 文献详情

Pell Equation. IV. Fastest algorithm for solving the Pell equation

Haruo Hosoya

2007Institutional Repositories DataBase (IRDB)Engineering被引 1开放获取

摘要

The fastest algorithm for solving the Pell equations, x^2-Dy^2=1 (called Pell-1) and x^2-Dy^2=-1 (Llep-1) , are demonstrated with two typical examples. The essence of the algorithm is i) to obtain the periodic continued fraction expression for the square root of D, ii) to prepare four caterpillar graphs by using the terms derived above, and iii) to set a 3×3(for Pell) or 2×2(for Llep) determinant whose elements are the topological indices (Z’s) of those graphs, and iv) to calculate the determinant. The dramatic shortening of the procedure comes from the finding that the continuant is equivalent to the topological index of the caterpillar graph directly derived from the continued fraction expansion of the square root of D.

引用本文（GB/T 7714）