What is the smallest possible number of whole 2-by-3 non-overlapping rectangles needed to cover a square region exactly, without extra over-hangs and without gaps?
Question:
What is the smallest possible number of whole 2-by-3 non-overlapping rectangles needed to cover a square region exactly, without extra over-hangs and without gaps?
Answer:
Let's think step by step.

user
6
What is the smallest possible number of whole 2-by-3 non-overlapping rectangles needed to cover a square region exactly, without extra over-hangs and without gaps?
train