In the diagram formed of twenty O’s below, in how many ways may four be selected such that they form a square?
What is the least number of O’s that may be removed such that none of these squares remains intact?
O O
O O
O O O O O O
O O O O O O
O O
O O
Note: the horizontal and vertical spacing should be equal.
I just thought I'd point out that it hasn't been found yet.
|
Posted by Jer
on 2006-05-11 12:24:07 |