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
-
Find the longest sequence of 1's in a binary sequence.
6695 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
1988 Solvers
-
Convert a vector into a number
615 Solvers
-
523 Solvers
-
644 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!
