MathDB
Find the smallest integer n

Source: IMO LongList 1979 - P16

June 1, 2011
combinatorics proposedcombinatorics

Problem Statement

Let QQ be a square with side length 66. Find the smallest integer nn such that in QQ there exists a set SS of nn points with the property that any square with side 11 completely contained in QQ contains in its interior at least one point from SS.