Borrowing the idea from Pascal Triangle, the following operation can be performed. Starting with an array of the first N odd numbers (where N is greater than 1), the following upside-down triangle of numbers can be formed where starting from the second row, the number is determined by adding the two neighboring numbers in the previous row.
Given N, determine the last number at the bottom of the triangle (i.e., the red number in the illustration above).
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers29
Suggested Problems
-
Determine whether a vector is monotonically increasing
23495 Solvers
-
144 Solvers
-
Magic is simple (for beginners)
11724 Solvers
-
Back to basics - mean of corner elements of a matrix
467 Solvers
-
Return fibonacci sequence do not use loop and condition
873 Solvers
More from this Author180
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
