Forgot password? New user? Sign up

Existing user? Log in

The diagram above shows 40 matchsticks arranged in a square grid.

What is the fewest number of matchsticks that need to be removed so that there are no squares (of any size) remaining?

Try the problem on a smaller grid first.

Problem Loading...

Note Loading...

Set Loading...