Welcome To Tutorialspoint.dev
Officially launched 18th May 2019

# n’th multiple of a number in Fibonacci Series

Given two integers n and k. Find position the n&#x2019;th multiple of K in the Fibonacci series. Examples : Input : k = 2, n = 3 Output : 9 3&apos;rd multiple of 2 in...

# GCD and Fibonacci Numbers

You are given two positive numbers M and N. The task is to print greatest common divisor of M&#x2019;th and N&#x2019;th Fibonacci Numbers. The first few Fibonacci Num...

# The Magic of Fibonacci Numbers

&#x201C;Fibonacci Series&#x201D;, sounds familiar, right? An Easy To Understand sequence represented as 0 1 1 2 3 5 8 13&#x2026;. where each number is the sum of the ...

# Space efficient iterative method to Fibonacci number

Given a number n, find n-th Fibonacci Number. Note that F0 = 0, F1 = 1, F2 = 2, &#x2026;.. Examples : Input : n = 5 Output : 5 Input : n = 10 Output : 89 ...

# Program to print Fibonacci Triangle

Given the value of n(n &lt; 10), i.e, number of lines, print the Fibonacci triangle. Examples: Input : n = 5 Output : 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 ...

# Program for Fibonacci numbers

The Fibonacci numbers are the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, &#x2026;&#x2026;.. In mathematical terms, the s...

# Fibonacci number in an array

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 yes, then print that element. Examples: Input...

# Factorial of each element in Fibonacci series

Given the upper limit limit, print factorials of all Fibonacci Numbers smaller than limit. Examples : Input : limit = 20 Output : 1 1 1 2 6 120 40320 6227020800 Expla...

# Large Fibonacci Numbers in Java

Given a number n, find n-th Fibonacci Number. Note that n may be large. Examples: Input : 100 Output : 218922995834555169026 Input : 500 Output : 861682916002384507...

# Nth Even Fibonacci Number

Given a value n, find the n&#x2019;th even Fibonacci Number. Examples : Input : n = 3 Output : 34 Input : n = 4 Output : 144 Input : n = 7 Output : 10946 The F...