The Fibonacci series is a series of elements where, the previous two elements are added to get the next element, starting with 0 and 1. In this article, we will learn...

Share

Problem – Write an assembly language program in 8085 microprocessor to generate Fibonacci series.
Example – Assume Fibonacci series is stored at startin...

Share

Given a number n then print n terms of fibonacci series in reverse order.
Examples:
Input : n = 5
Output : 3 2 1 1 0
Input : n = 8
Output : 13 8 5 3 2 1 1 0
Recomm...

Share

Print the Fibonacci sequence. The first Fibonacci numbers are:
C++
// Simple CPP Program to print Fibonacci 
// sequence
#include <iostream>...

Share

Given a number k, find the required minimum number of Fibonacci terms whose sum equal to k. We can choose a Fibonacci number multiple times.
Examples:
Input : k = 4
...

Share

We know Fibonacci number, Fn = Fn-1 + Fn-2.
First few Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, …. .
Here are ...

Share

Given a number ‘n’, how to check if n is a Fibonacci number. First few Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 141, ..
Examples ...

Share

Fibonacci series = 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ……..
Different methods to find nth Fibonacci number are already discussed. Another simple way of fin...

Share

Zeckendorf’s theorem states that every positive Every positive integer can be written uniquely as a sum of distinct non-neighbouring Fibonacci numbers. Two Fi...

Share

Fibonacci coding encodes an integer into binary number using Fibonacci Representation of the number. The idea is based on Zeckendorf’s Theorem which states th...

Share