Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update FibonacciNumber.java (#4195)

Browse Source
This commit is contained in:
Indrranil Pawar 2023-05-21 11:08:54 +05:30 committed by GitHub
parent deef2ae445
commit 9ce275c16d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 8 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
src/main/java/com/thealgorithms/maths/FibonacciNumber.java
View File

@ -17,7 +17,7 @@ public class FibonacciNumber {
* Check if a number is perfect square number * Check if a number is perfect square number
* *
* @param number the number to be checked * @param number the number to be checked
* @return <tt>true</tt> if {@code number} is perfect square, otherwise * @return <tt>true</tt> if {@code number} is a perfect square, otherwise
* <tt>false</tt> * <tt>false</tt>
*/ */
public static boolean isPerfectSquare(int number) { public static boolean isPerfectSquare(int number) {
@ -26,18 +26,17 @@ public class FibonacciNumber {
} }
/** /**
* Check if a number is fibonacci number This is true if and only if at * Check if a number is a Fibonacci number. This is true if and only if at
* least one of 5x^2+4 or 5x^2-4 is a perfect square * least one of 5x^2+4 or 5x^2-4 is a perfect square
* *
* @param number the number * @param number the number
* @return <tt>true</tt> if {@code number} is fibonacci number, otherwise * @return <tt>true</tt> if {@code number} is a Fibonacci number, otherwise
* <tt>false</tt> * <tt>false</tt>
* @link https://en.wikipedia.org/wiki/Fibonacci_number#Identification * @link https://en.wikipedia.org/wiki/Fibonacci_number#Identification
*/ */
public static boolean isFibonacciNumber(int number) { public static boolean isFibonacciNumber(int number) {
return ( int value1 = 5 * number * number + 4;
isPerfectSquare(5 * number * number + 4) || int value2 = 5 * number * number - 4;
isPerfectSquare(5 * number * number - 4) return isPerfectSquare(value1) || isPerfectSquare(value2);
);
} }
} }