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

Authors

59

  1. FL
    Florian Luca

    Universidad Nacional Autónoma de México, Mexico

    4 publications · 64 citations

    4

    h-index

  2. SH
    Sean Hallgren

    Pennsylvania State University, United States

    3 publications · 329 citations

    3

    h-index

  3. AT
    Alain Togbé

    Purdue University Northwest, United States

    2 publications · 28 citations

    2

    h-index

  4. AP
    A. Pethö

    University of Debrecen, Hungary

    2 publications · 27 citations

    2

    h-index

  5. MA
    Michael A. Bennett

    University of British Columbia, Canada

    2 publications · 24 citations

    2

    h-index

1–5 of 59

Venues

  1. Journal of Number Theory

    3 publications · 49 citations

    3

    h-index

  2. Periodica Mathematica Hungarica

    2 publications · 24 citations

    2

    h-index

  3. ˜The œFibonacci quarterly

    2 publications · 245 citations

    2

    h-index

  4. Choice Reviews Online

    CRO · 2 publications · 53 citations

    2

    h-index

  5. Mathematics of Computation

    MCOM · 1 publications · 19 citations

    1

    h-index

1–5