Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Do integers nn greater than 2 exist such that all the squares of sides 1, 2, 3, ..., nn can be partitioned into two or more sets (none a singleton) each of whose squares can be used to tile a rectangle?
Do integers n greater than 2 exist such that all the squares of sides 1, 2, 3, ..., n can be partitioned into two or more sets each of whose squares can be used to tile a rectangle?
Do integers n greater than 2 exist such that all the squares of sides 1, 2, 3, ..., n can be partitioned into two or more sets (none a singleton) each of whose squares can be used to tile a rectangle?
Tiling rectangles using all squares of sides 1, 2, 3, ..., n
Do integers n greater than 2 exist such that all the squares of sides 1, 2, 3, ..., n can be partitioned into two or more sets each of whose squares can be used to tile a rectangle?
