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
Parents
14
Donald L. M. Baxter · History of Philosophy Quarterly · 1988 · 48 citations
Christopher Morton · Journal of Material Culture · 2007 · 36 citations
1–5 of 14
16
University of North Carolina at Chapel Hill, United States
2 publications · 98 citations
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 16
11
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
2 publications
98 citations
Georgia State University
Atlanta, United States
1 h-index
1 publications
32 citations
University of Oxford
Oxford, United Kingdom
1 h-index
1 publications
36 citations

University of Birmingham
Birmingham, United Kingdom
1 h-index
1 publications
14 citations
Kozminski University
Warsaw, Poland
1 h-index
2 publications
24 citations
Bank of Korea
Seoul, South Korea
1 h-index
1 publications
19 citations
Harvard University
Cambridge, United States
1 h-index
1 publications
141 citations

Pennsylvania State University
State College, United States
1 h-index
1 publications
19 citations
1–8 of 11
2 publications · 37 citations
2
h-index
JHI · 1 publications · 11 citations
1
h-index
1 publications · 141 citations
1
h-index
HPQ · 1 publications · 48 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5