Area of marked points on an infinite grid
Source: Romanian 2018 TST Day 1 Problem 3
May 25, 2020
combinatoricscombinatorial geometryratio
Problem Statement
Divide the plane into x squares formed by the lattice points. Let be the set-theoretic union of a finite number of such cells, and let be a positive real number less than or equal to 1/4.Show that S can be covered by a finite number of squares satisfying the following three conditions:
1) Each square in the cover is an array of x cells
2) The squares in the cover have pairwise disjoint interios and
3)For each square in the cover the ratio of the area to the area of Q is at least and at most