The sequence of Fibonacci is a sequence of integers in which each term is the sum of the two terms that precede it:
it begins with the terms 0 and 1;
the 3rd term is therefore 0 + 1 = 1;
the 4th term is 1 + 1 = 2;
and so on: 3, 5, 8, 13, 21 ...
Challenge:
Find with LabVIEW the first term in the Fibonacci suite whose sum of digits equals the input number.
In input you have an integer N between 1 and 100, in exit give the rank of the term T and the number of the solution S
Example:
If the number supplied as input N is 24 then the solution S is 987, T is the 17th term (counting 0) since 9 + 8 + 7 = 24
So which one is for 28? 80 or all N less than 100?
