Without using recursion and cycles, find the sum of the numbers of the Fibonacci range from 1 to n.
Answer 1, Authority 100%
The amount of elements to n is simply f (n + 2) – 1 . That is, it is necessary to find the number of fibonacci through one of the n and subtract the unit.
How to find a Fibonacci number to you already wrote Stanislav.
Answer 2, Authority 25%
This is done very simply using Bina Formula , which expresses the value of the number depending on its sequence number in Fibonacci row.
Answer 3, Authority 25%
The first identity – just what you need.
The formula for the N-CO member is written higher.