A spider is building grids with matchsticks by adding unit squares to what he has already built according to the schema shown below. How many matchsticks does the spider have to add to the grid to build the
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Consider constructing the n t h grid from the ( n − 1 ) t h grid.
If we construct the top left and bottom right corner squares first, we have used 6 Matchsticks.
Then, if we construct the top row one square at a time (from the top left corner moving right), apart from the top right corner square, we will require 2 Matchsticks for each of the ( n − 2 ) squares, meaning we will need ( 2 n − 4 ) Matchsticks.
Similarly, if we construct the right column one square at a time (from the bottom right corner moving up), apart from the top right corner square, we will require ( 2 n − 4 ) Matchsticks.
Finally, the top right corner square will require 2 Matchsticks to finish the n t h grid.
This means that to construct the n t h grid from the ( n − 1 ) t h grid, we need 6 + 2 ( 2 n − 4 ) + 2 = 4 n Matchsticks.
In the case of the 1 0 0 0 t h grid, we require 4 ∗ 1 0 0 0 = 4 0 0 0 Matchsticks.