Java Math Exercises: 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 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: Java Sorting Exercises Home.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
Java: Tips of the Day
How to sort an ArrayList?
Collections.sort(testList); Collections.reverse(testList);
That will do what you want. Remember to import Collections though!
Ref: https://bit.ly/32urdSe
- New Content published on w3resource:
- HTML-CSS Practical: Exercises, Practice, Solution
- Java Regular Expression: Exercises, Practice, Solution
- Scala Programming Exercises, Practice, Solution
- Python Itertools exercises
- Python Numpy exercises
- Python GeoPy Package exercises
- Python Pandas exercises
- Python nltk exercises
- Python BeautifulSoup exercises
- Form Template
- Composer - PHP Package Manager
- PHPUnit - PHP Testing
- Laravel - PHP Framework
- Angular - JavaScript Framework
- Vue - JavaScript Framework
- Jest - JavaScript Testing Framework