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 Solvers27
Suggested Problems
-
Remove any row in which a NaN appears
8783 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2052 Solvers
-
1388 Solvers
-
363 Solvers
-
Find the max element of the array
2281 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!
