In this problem, the author is imagining again an abstract pyramid made by layers of square matrices of zeros that decrease evenly until the top is reached (the top is made by ones; for instance, a pyramid of base 5(n) would be zeros(5)-> zeros(3) -> ones(1)). We are looking at the pyramid from the top view (that's why is flattened).
Maximum running product for a string of numbers
1113 Solvers
Number of 1s in the Binary Representation of a Number
358 Solvers
Sum all integers from 1 to 2^n
8445 Solvers
348 Solvers
Make a run-length companion vector
512 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!