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 Solvers38
Suggested Problems
-
722 Solvers
-
Getting the row and column location from a matrix
301 Solvers
-
8179 Solvers
-
Find Out sum of principal diagonal element of given matrix
258 Solvers
-
Sum the squares of numbers from 1 to n
261 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!