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
Solution Comments
Show comments
Loading...
Problem Recent Solvers37
Suggested Problems
-
Sum of first n terms of a harmonic progression
507 Solvers
-
Matrix with different incremental runs
585 Solvers
-
Simple equation: Annual salary
4261 Solvers
-
Sum of diagonals elements of a matrix
233 Solvers
-
366 Solvers
More from this Author18
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!