Consider the integer triangle below:
It follows the same rule as Pascal's Triangle, except that instead of affixing 1's at the sides of each row, the row number minus 1, is affixed (on first row 0 is affixed; at row 2, 1 is affixed on each side, etc.). Any inner number, as in Pascal's Triangle, is the sum of the left and right numbers on its previous row.
Given a number n find 
, which is the sum of the n-th row. Hence, 
and 
.
, which is the sum of the n-th row. Hence, and . We could be getting large numbers here, therefore please concatenate the total number of digits with the last 3 digits of and output a single concatenated integer. For example the 
, hence the output should be 
.
and output a single concatenated integer. For example the , hence the output should be .Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers11
Suggested Problems
-
Remove the polynomials that have positive real elements of their roots.
1743 Solvers
-
576 Solvers
-
Remove from a 2-D matrix all the rows that contain at least one element less than or equal to 4
140 Solvers
-
1683 Solvers
-
Project Euler: Problem 18, Maximum path sum I
149 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
