Abstract
This research investigates a function, informally named WAK(x), that describes the number of ways to divide an integer square into integer subsquares counting only the list of parts. Previous research has shown values up to 28, though finding these values is computationally complex and requires a long runtime using computer algorithms. We attempt to find patterns in the values and many aspects of the values, hoping to find a general solution. We are unsure if a solution exists, but we have ideas for how to move forward in finding a solution.
Faculty Advisor
Keith Dreiling
Department/Program
Math
Submission Type
in-person poster
Date
4-13-2026
Rights
Copyright the Author(s)
Recommended Citation
Dreiling, Keith M.; Leanna, Austin; and Mooney, William
(2026)
"Unique Combinations of Packing Integer Squares,"
SACAD: Scholarly Activities: Vol. 2026, Article 86.
Available at:
https://scholars.fhsu.edu/sacad/vol2026/iss2026/86
