Java: Check if a given number is Fibonacci number or not
Java Math Exercises: Exercise-27 with Solution
Write a Java program to check if a given number is a Fibonacci number or not.
Sample Solution:
Java Code:
import java.util.*;
class solution {
static boolean isPerfectSquare(int x)
{
int s = (int) Math.sqrt(x);
return (s*s == x);
}
static boolean isFibonacci(int x)
{
return isPerfectSquare(5*x*x + 4) ||
isPerfectSquare(5*x*x - 4);
}
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
System.out.print("Input a number: ");
int n = scan.nextInt();
if (n>0)
{
System.out.println("Is Fibonacci number? "+isFibonacci(n));
}
}
}
Sample Output:
Input a number: 55 Is Fibonacci number? true
Flowchart:
Java Code Editor:
Contribute your code and comments through Disqus.
Previous: Write a Java program to print all prime factors of a given number.
Next: Multiply two numbers using bitwise operators.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.
https://w3resource.com/java-exercises/math/java-math-exercise-27.php
- Weekly Trends and Language Statistics
- Weekly Trends and Language Statistics