Counting Squares in a Square

How many grid squares are there in a grid square of size N×N?

Obviously, there is the N×N square itself and N² small, 1×1 squares. But, for N, say equal to 5, there are also 2×2, 3×3, and 4×4 squares. In general, for the N×N square there are smaller squares of all possible sizes, starting with 1×1 all through N×N. How do you count those?

The applet bellow suggests a way of counting M×M squares contained in an N×N square, N ≥ M. In the applet, the M×M square is draggable. Try it and see what happens. Imagine the 1×1 square in the upper left corner of the moveable square is filled with paint which leaks when the square moves, but only if it remain within the borders of the N×N square.

 

This applet requires Sun's Java VM 2 which your browser may perceive as a popup. Which it is not. If you want to see the applet work, visit Sun's website at http://www.java.com/en/download/index.jsp, download and install Java VM and enjoy the applet.


Buy this applet
What if applet does not run?

Explanation

|Activities| |Contact| |Front page| |Contents| |Algebra| |Store|

Copyright © 1996-2012 Alexander Bogomolny

The position of an M×M square is fully determined by its upper left 1×1 piece. (The upper left corner is chosen for convenience. Any other small square inside a bigger one determines uniquely the position of the latter.) Inside the N×N square this 1×1 piece may occupy a limited number of positions. These form a square of side (N - M + 1) in the upper right corner of the N×N square. It follows that the number of M×M squares inside the N×N square equals (N - M + 1)×(N - M + 1).

 

This applet requires Sun's Java VM 2 which your browser may perceive as a popup. Which it is not. If you want to see the applet work, visit Sun's website at http://www.java.com/en/download/index.jsp, download and install Java VM and enjoy the applet.


Buy this applet
What if applet does not run?

The total number T of grid squares within the N×N grid is the sum:

 T= ∑Nn = 1 (N - n + 1)²
  = ∑Nn = 1 n²,

the sum of the first N squares. This we know to be

 
T = 
N(N + 1)(2N + 1)

6

|Activities| |Contact| |Front page| |Contents| |Algebra| |Store|

Copyright © 1996-2012 Alexander Bogomolny

 40620058

A math books store at a unique math study site. Shopping at the store helps maintain the site. Thank you.
Sites for teachers
Sites for parents
Terms of use
Awards
Interactive Activities

CTK Exchange
CTK Wiki Math
CTK Insights - a blog
Math Help
Games & Puzzles
What Is What
Arithmetic
Algebra
Geometry
Probability
Outline Mathematics
Make an Identity
Book Reviews
Stories for Young
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
Visual Illusions
My Logo
Math Poll
Cut The Knot!
MSET99 Talk
Old and nice bookstore
Other Math sites
Front Page
Movie shortcuts
Personal info
Privacy Policy

Guest book
News sites

Recommend this site

Sites for parents

Education & Parenting

Search:
Keywords:

Google
Web CTK
Supported by
3wVentures