## The Magic of Fibonacci Numbers

“Fibonacci Series”, sounds familiar, right? An Easy To Understand sequence represented as 0 1 1 2 3 5 8 13…. where each number is the… Read More »

- Sum of Fibonacci Numbers in a range
- Fibonacci Power
- Python | Find fibonacci series upto n using lambda
- Distinct pairs from given arrays (a[i], b[j]) such that (a[i] + b[j]) is a Fibonacci number
- Count the nodes whose sum with X is a Fibonacci number
- Count of cells in a matrix which give a Fibonacci number when the count of adjacent cells is added

“Fibonacci Series”, sounds familiar, right? An Easy To Understand sequence represented as 0 1 1 2 3 5 8 13…. where each number is the… Read More »

Given the value of n(n < 10), i.e, number of lines, print the Fibonacci triangle. Examples: Input : n = 5 Output : 1 1… Read More »

Given the upper limit limit, print factorials of all Fibonacci Numbers smaller than limit. Examples : Input : limit = 20 Output : 1 1… Read More »

Fibonomial Coefficient In mathematics, the Fibonomial coefficients or Fibonacci-binomial coefficients are defined as where n and k are non-negative integers, 0 ≤ k ≤ n,… Read More »

Fibonacci series = 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …….. Different methods to find nth Fibonacci number are already discussed. Another… Read More »

The Fibonnaci triangle or Hosoya’s triangle is a triangular arrangement of numbers based on Fibonacci numbers. Each number is the sum of two numbers above… Read More »

Like Fibonacci numbers, a Fibonacci word. is a specific sequence of binary digits (or symbols from any two-letter alphabet). The Fibonacci word is formed by… Read More »

Given a number ‘n’, write a function that prints the last two digits of n-th (‘n’ can also be a large number) Fibonacci number. Examples:… Read More »

Given n stairs and we have 2 colour yellow and green the task is that we have to paint given stairs by given colour with… Read More »

Given a number, find the numbers (smaller than or equal to n) which are both Fibonacci and prime. Examples: Input : n = 40 Output:… Read More »

Given an positive integer n. Count total number of ways to express ‘n’ as sum of odd positive integers. Input: 4 Output: 3 Explanation There… Read More »

The Fibonacci numbers are the numbers in the following integer sequence 0, 1, 1, 2, 3, 5, 8, 13… Mathematically Fibonacci numbers can be written… Read More »

The Leonardo numbers are a sequence of numbers given by the recurrence: The first few Leonardo Numbers are 1, 1, 3, 5, 9, 15, 25,… Read More »

There are N players which are playing a tournament. We need to find the maximum number of games the winner can play. In this tournament,… Read More »

We have been given an array and our task is to check if the element of array is present in Fibonacci series or not. If… Read More »