An algorithm starts with a single square and on each of its next iterations adds new squares all around the outside as shown below.
S
S S S S
S S S S S S S S S
S S S S
S
n = 1 n = 2 n = 3 How many unit squares will there be after the nth iteration?
Solution Stats
Problem Comments
Problem Recent Solvers15
Suggested Problems
-
2756 Solvers
-
Change the sign of even index entries of the reversed vector
217 Solvers
-
311 Solvers
-
488 Solvers
-
95 Solvers
More from this Author18
Problem Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)