## Hosoya’s Triangle

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 »

- Minimum number of Fibonacci jumps to reach end
- Nth XOR Fibonacci number
- Fibonacci Power
- Fibonacci Number modulo M and Pisano Period
- 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
- Find F(n) when F(i) and F(j) of a sequence are given
- Nth Fibonacci number using Pell's equation
- Find the Nth element of the modified Fibonacci series
- Find the next fibonacci number
- Program to find Nth odd Fibonacci Number
- C++ Program to print Fibonacci Series using Class template

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 »

Given a number N, the task is to evaluate below expression. Expected time complexity is O(1). f(n-1)*f(n+1) – f(n)*f(n) Where f(n) is the n-th Fibonacci… Read More »

The Fibonacci sequence is defined as = + where = 1 and = 1 are the seeds. For a given prime number p, consider a… Read More »

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,… Read More »

We are given a variable n, we need to find whether Fibonacci number will be multiple of 10 or not. Examples: Input : 15 Output… Read More »

Given an array with positive number the task is that we find largest subset from array that contain elements which are Fibonacci numbers. Asked in… Read More »