Here you are asked to divide the large square into the fewest number of pieces which can be refitted into two squares.
This puzzle differs from the Pythagorean principe of cutting lines on the bias. We know that two squares can be divided by diagonal lines to produce one larger square, and vice versa, but in this puzzle we must cut on the lines only, so as not to destroy the pictures. It may also be mentioned, that students who have mastered the Pythagorean problem will not find much difficulty in discovering how many pictures there must be in the smaller squares.
In this problem the best solution doest not destroy any pictures or turn any of them upside down.
CLICK the picture
