Squares

You have many cardboard squares of sizes `1 times 1`, `2 times 2`, and `3 times 3`, and you must assemble them into a square of size `7 times 7`.
What is the smallest possible number of squares you will need?

Difficulty level (1 very easy - 10 very hard): 3

Topics:
Geometry Minimum and Maximum Problems / Optimization Problems Combinatorics -> Combinatorial Geometry -> Cut a Shape / Dissection Problems
Sources:
There are no comments yet.
Authentication required

You must log in to post a comment.

Log in