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
-
Extract leading non-zero digit
2251 Solvers
-
All your base are belong to us
579 Solvers
-
Basics: 'Find the eigenvalues of given matrix
439 Solvers
-
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
601 Solvers
-
537 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!