Remainder Sequences

Remainder Sequences is a mathematical construct defined as the ordered sequence of non-negative integers generated iteratively by applying the division algorithm in the Euclidean Algorithm, where each term is the remainder resulting from the division of the preceding two terms, terminating upon reaching zero.

42

Publications

3.5K

Citations

69

Authors

38

Institutions

Publications per year

2017–2026

1

Variants

Euclidean Remainder Sequences

Authors

69

  1. GB
    Gerald B. Folland

    University of Washington, United States

    2 publications · 33 citations

    2

    h-index

  2. MK
    Mutsuko K. Sasaki

    RIKEN, Japan

    2 publications · 35 citations

    2

    h-index

  3. GE
    George E. Collins

    University of Wisconsin–Madison, United States

    2 publications · 370 citations

    2

    h-index

  4. SC
    S. Cabay

    University of Alberta, Canada

    1 publications · 13 citations

    1

    h-index

  5. GE
    G. E. Collins

    1 publications · 25 citations

    1

    h-index

1–5 of 69

Venues

  1. American Mathematical Monthly

    5 publications · 110 citations

    5

    h-index

  2. Focus on learning problems in mathematics

    2 publications · 52 citations

    2

    h-index

  3. SIAM Journal on Computing

    2 publications · 48 citations

    2

    h-index

  4. Journal of Symbolic Computation

    2 publications · 33 citations

    2

    h-index

  5. eCommons (Cornell University)

    Repository · 1 publications · 17 citations

    1

    h-index

1–5