Pell Equation Algorithms
Pell Equation Algorithms is a class of computational methods designed to solve Pell equations of the form \(x^2 - dy^2 = 1\) by leveraging continued fraction expansions or recurrence relations that systematically generate integer solutions through the fundamental unit of the associated real quadratic field.
40
Publications
1.5K
Citations
59
Authors
48
Institutions
Publications per year
2017–2026
7
Parents
40
Pell and Pell-Lucas Polynomials
A. F. Horadam, J. M. Mahon · The Fibonacci quarterly · 1985 · 225 citations
On the number of solutions of simultaneous Pell equations
Pingzhi Yuan · Acta Arithmetica · 2002 · 86 citations · Full text
H. W. Lenstra · 2008 · 85 citations
1–5 of 40
59
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 59
48

University of Debrecen
Debrecen, Hungary
3 h-index
3 publications
46 citations

University of the Witwatersrand
Johannesburg, South Africa
3 h-index
3 publications
41 citations

University of Ostrava
Ostrava, Czechia
2 h-index
2 publications
24 citations
California Institute of Technology
Pasadena, United States
2 h-index
2 publications
183 citations

Fort Hays Tech Northwest
Goodland, United States
2 h-index
3 publications
39 citations
Purdue University Northwest
Hammond, United States
2 h-index
3 publications
39 citations

University of Calgary
Calgary, Canada
1 h-index
1 publications
19 citations
Guangdong University of Technology
Guangzhou, China
1 h-index
1 publications
17 citations
1–8 of 48
3 publications · 49 citations
3
h-index
2 publications · 24 citations
2
h-index
2 publications · 245 citations
2
h-index
CRO · 2 publications · 53 citations
2
h-index
MCOM · 1 publications · 19 citations
1
h-index
1–5