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 Solvers31
Suggested Problems
-
5973 Solvers
-
Check if number exists in vector
13912 Solvers
-
507 Solvers
-
Return fibonacci sequence do not use loop and condition
855 Solvers
-
28 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!
