Borrowing the idea from Pascal Triangle, the following operation can be performed. Starting with an array of numbers from 1 to N (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
Solution Comments
Show comments
Loading...
Problem Recent Solvers30
Suggested Problems
-
Sum all integers from 1 to 2^n
17395 Solvers
-
Sum of diagonal of a square matrix
1634 Solvers
-
Make a vector of prime numbers
965 Solvers
-
644 Solvers
-
07 - Common functions and indexing 2
421 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!
