Sum Combinations

Sum Combinations is a mathematical construct in the field of arithmetic that denotes the set of all possible pairwise additions of elements from a given finite set of numbers, distinguished by its focus on exhaustively generating resultant sums through systematic combination rather than on individual operational instances.

13

Publications

1.3K

Citations

22

Authors

14

Institutions

Publications per year

2017–2026

0

Authors

22

  1. AJ
    Arthur J. Baroody

    University of Illinois Urbana-Champaign, United States

    2 publications · 145 citations

    2

    h-index

  2. RS
    Renzo Sprugnoli

    University of Florence, Italy

    1 publications · 329 citations

    1

    h-index

  3. WA
    Wojciech A. Trybulec

    1 publications · 32 citations

    1

    h-index

  4. BS
    Bob Speiser

    Brigham Young University, United States

    1 publications · 11 citations

    1

    h-index

  5. ML
    Margaret L. Lowe

    Southern Illinois University Carbondale, United States

    1 publications · 48 citations

    1

    h-index

1–5 of 22

Venues

  1. Early Education and Development

    1 publications · 103 citations

    1

    h-index

  2. The Journal of Mathematical Behavior

    JMB · 1 publications · 11 citations

    1

    h-index

  3. PubMed

    Repository · 1 publications · 42 citations

    1

    h-index

  4. Journal of Applied Behavior Analysis

    JABA · 1 publications · 48 citations

    1

    h-index

  5. Philosophical Studies

    1 publications · 14 citations

    1

    h-index

1–5