Yes, it was discovered (officially) by Lucas.
(Though it is not an effcient formula for fibonacci numbers.
If you discovered that by thyself then good job.
Hehe, no I didn't. I was just googling at Fibonacci numbers or something like that and happened to find it. Then I started to think about how to do to show it's true, but I realized I don't know.
Another thing you can gather from this is that the "diagonal" sum is growing with an approximate factor of , the golden ratio, while the horozontal sum in growing with a factor of 2. So when you take steps withe the diagonal, the factor of growing is , while it would require only steps for the sum to grow as much if the sum would have been taking from a horitzonal line, where . So which means it requires times as many steps to make the diagonal sum grow with as big factor as the horitzonal sum does.
But I don't know what you can use this to.
Here's an interesting Fibonacci-related item.
Those familiar with Fibonacci numbers probably know Binet's formula for finding the nth Fibonacci number.
Here's a way to find out how many digits are in that nth Fibonacci number:
Of course, you use logs.
Let's try an easy one for a check of the formula:
Enter n=20 into  and we get: 3.83026780283
The number of digits in a number is 1+the whole part of the log.
Therefore, there are 4 digits in the 20th Fibonacci number.
Now, what are those first digits?.
10 to the power of the frac part of the log.
As we can see from Binet's formula or listing them out, the 20th Fibonacci number is 6765.
Try the 1,000,000th for fun.
It has 208988 digits and starts with 195..........
Btw I think you use to have for the small value. Then I'm not sure whether the definition is or if it is . If it is the second, then both values can be derived from the equation , cause then you will get the answer . On the other hand, if it is the first definition then both values can be given by the equation . Hm, I got the equation can be derived from the equation , or , I wonder where that equation comes from...