Problem 56458. Easy Sequences 80: Sum of the n-th Row of Fibonacci Square Triangle
where: and for .
We can see from the above list, that the first row contains the square of the first Fibonacci number (i.e. ), the 2nd row contains the squares of the next 2 Fibonacci numbers, the 3rd contains the next 3, the 4th contains the next 4, and so on.
In this problem, we are required to find the sum of the n-th row of the Fibonacci Square Triangle. For example for the 4th row, the sum is:
Since, Fibonacci number squares grows very fast, please present your answer as a row vector of 3 elements. The first element is the first 4 digits of the sum, the second element is the last 4 digits of the sum, and last element is the number of digits of the sum.
Therefore, for the 4th row, your program output should be .
Solution Stats
Problem Comments
-
1 Comment
GeeTwo
on 22 Dec 2022
Additional rules: no persistent, global, java, BigInteger.
Control structures allowed!
Solution Comments
Show commentsProblem Recent Solvers2
Suggested Problems
-
Remove element(s) from cell array
1529 Solvers
-
Self-similarity 1 - Every other term
59 Solvers
-
Splitting Triangle - Problem the first
39 Solvers
-
Easy Sequences 8: Triangles with integer sides and prime perimeters
9 Solvers
-
Easy Sequences 23: Hat Guessing Game!
26 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!