Divisibility Puzzles

Divisibility Puzzles is a formal mathematical task in the domain of numerical riddles that involves determining whether a given integer satisfies specific division-based constraints under predefined rules, distinguished by its reliance on modular arithmetic and factorization properties to derive logical solutions.

14

Publications

515

Citations

16

Authors

11

Institutions

Publications per year

2017–2026

0

Authors

16

  1. DA
    David A. Plaisted

    University of North Carolina at Chapel Hill, United States

    2 publications · 98 citations

    2

    h-index

  2. MA
    Michael A. Klein

    Rensselaer Polytechnic Institute, United States

    2 publications · 37 citations

    2

    h-index

  3. ŁM
    Łukasz Markiewicz

    Kozminski University, Poland

    1 publications · 12 citations

    1

    h-index

  4. WW
    Wayne Waxman

    University of Illinois Chicago, United States

    1 publications · 23 citations

    1

    h-index

  5. SC
    Susan Carey

    Harvard University, United States

    1 publications · 141 citations

    1

    h-index

1–5 of 16

Venues

  1. The Journal of Finance

    2 publications · 37 citations

    2

    h-index

  2. Journal of the History of Ideas

    JHI · 1 publications · 11 citations

    1

    h-index

  3. Cognitive Psychology

    1 publications · 141 citations

    1

    h-index

  4. History of Philosophy Quarterly

    HPQ · 1 publications · 48 citations

    1

    h-index

  5. American Mathematical Monthly

    1 publications · 14 citations

    1

    h-index

1–5