Zeckendorf’s Theorem
Zeckendorf's theorem states that every positive number can split into distinct non consecutive fibonacci numbers. For example.
Input : 32
OutPut : 21 8 3
Input : 64
OutPut : 55 + 8 + 1
Consecutive elements means in a fibonacci series neighbor element. For example.
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
Here given the code implementation process.

1) Zeckendorf's theorem in java
2) Zeckendorf's theorem in c++
3) Zeckendorf's theorem in c#
4) Zeckendorf's theorem in c
5) Zeckendorf's theorem in php
6) Zeckendorf's theorem in python
7) Zeckendorf's theorem in ruby
8) Zeckendorf's theorem in scala
9) Zeckendorf's theorem in swift
10) Zeckendorf's theorem in kotlin
11) Zeckendorf's theorem in node js
12) Zeckendorf's theorem in golang
13) Zeckendorf's theorem in vb.net
14) Zeckendorf's theorem in typescript
Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.
New Comment