Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How do I prove that it is possible to cover the whole plane with squares with side 1?

Please suggest different approaches to the above problem.

Thank you.

share|cite|improve this question

closed as unclear what you're asking by ᴡᴏʀᴅs, Najib Idrissi, Mark Fantini, Willie Wong, Aaron Maroja Mar 31 '15 at 13:53

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question.If this question can be reworded to fit the rules in the help center, please edit the question.

Does it require proof? – André Nicolas Nov 26 '11 at 5:10
In English, statements such as "Suggest different approaches" can read as orders, or at least as somewhat rude. The polite way is to ask as question. E.g., "Could someone suggest an approach to the problem above?" – Arturo Magidin Nov 26 '11 at 5:12

If you aren't concerned about overlap (which you don't mention in your statement), then for every point x in the plane, include a square of side length 1 whose lower lefthand corner is x. Not only is everything covered, but each point gets its own personal square.

If you'd like a slightly less silly cover, then anchor the lower lefthand corner of a square at each point with integer coordinates. If you remove the top side and right side of your square, then this scheme will cover the entire plane without overlap.

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.