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
-
Find the sum of the elements in the "second" diagonal
1204 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
587 Solvers
-
5106 Solvers
-
Find the Nth Root of a Given Number
365 Solvers
-
Matlab Basics - Convert a row vector to a column vector
680 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!