This is a triomino piece:
(A 2 x 2 cell square with one of the corner cells removed)

Prove that a square, 2^n cells to the side, with one square cell removed from the corner can be covered with triomino pieces without any overlapping or going over the border for any natural value of n. The triominos can be rotated.

(For example if n = 1, the result is a triomino shape to begin with - a 2 x 2 square with one cell removed.)

to work out how many trios are need for a square it is the amount of suares in the previous square + the number of trios for that square
so for a 4X4 square which is 2^2 the prviois sqare was 2x2 so its 4 plus the number of trios to fill it which was 1 which gives 5
4+1=5, draw the 4x4 square, take out the corner square and try it

Posted by marty on 2002-05-22 22:36:40