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, ..
Input : 8 Output : Yes Input : 34 Output : Yes Input : 41 Output : No
Following is an interesting property about Fibonacci numbers that can also be used to check if a given number is Fibonacci or not.
A number is Fibonacci if and only if one or both of (5*n2 + 4) or (5*n2 – 4) is a perfect square (Source: Wiki).
1 is a Fibonacci Number 2 is a Fibonacci Number 3 is a Fibonacci Number 4 is a not Fibonacci Number 5 is a Fibonacci Number 6 is a not Fibonacci Number 7 is a not Fibonacci Number 8 is a Fibonacci Number 9 is a not Fibonacci Number 10 is a not Fibonacci Number
Please refer complete article on How to check if a given number is Fibonacci number? for more details!
- Create Directory or Folder with C/C++ Program
- C Program to Swap two Numbers
- Check if absolute difference of consecutive nodes is 1 in Linked List
- Maximum number of 3-person teams formed from two groups
- C++ Program to concatenate two strings using Operator Overloading
- C++ Program to implement Symbol Table
- C++ Program for Bubble Sort
- C++ Program for Heap Sort
- C/C++ Program for n-th Fibonacci number
- C++ Program for ShellSort
- C++ Program for Longest Common Subsequence
- Greatest divisor which divides all natural number in range [L, R]
- C/C++ Program for Longest Increasing Subsequence
- C++ Program for Longest Increasing Subsequence
- C++ Program for GCD of more than two (or array) numbers