How many ways are there to fill a $m\times n$ rectangles with squares that have integer side lengths?

Both $m$ and $n$ are integers.

  • $\begingroup$ Dissections of a rectangle into squares can be very complicated, it is hard to even to obtain a general description for them, not saying even to count them. I think there is only hope to obtain some bounds. $\endgroup$ – Alex Ravsky Jun 18 '15 at 4:48
  • $\begingroup$ Also you may try to ask this question to Erich Friedman (efriedma@stetson.edu). $\endgroup$ – Alex Ravsky Jun 18 '15 at 4:56

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.