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
-
Replace NaNs with the number that appears to its left in the row.
3073 Solvers
-
Sum all integers from 1 to 2^n
18145 Solvers
-
Create matrix of replicated elements
402 Solvers
-
Find the position of first minimum value in an integer array with numbers
185 Solvers
-
1156 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!