Jump to content

User:Bhpsngum

From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Derived a new formula from Binet's Formula

Simplification

Binet's formula can be expressed like this: (with n )

Now, simplify the formula:

let , we have:

Rewrite in another form

Now, let's do some examples with n=1,2,3,4:

n
1
2
3
4
5
6

And we have this result:

n simplified
1
2
3
4
5
6

To the examples, we have:

  • n is odd:
  • n is even:

Hence:

Final Steps and Conclusion

Substitute (2) to (1):

Finally, we have a new formula derived from Binet's Formula:

(with )

Expand to negative numbers

The Fibonacci's sequence can also be extended to negative index n called "negafibonnaci" numbers below:

F−8 F−7 F−6 F−5 F−4 F−3 F−2 F−1 F0 F1 F2 F3 F4 F5 F6 F7 F8
−21 13 −8 5 −3 2 −1 1 0 1 1 2 3 5 8 13 21

We can see with n<0: when n is even and vice versa.

Hence, the formula can also express like this:

All formulae (with )

Closed-form

(Binet's Formula)

Summation formulae

(Derived from Binet's Formula)

(The sums of the "shallow" diagonals of Pascal's triangle)

with and