algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-26 05:59:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
src/main/java/com/thealgorithms/maths/PronicNumber.java
View File

@ -5,34 +5,30 @@ package com.thealgorithms.maths;
* Pronic Number: A number n is a pronic number if
* it is equal to product of two consecutive numbers m and m+1.
* Wikipedia: https://en.wikipedia.org/wiki/Pronic_number
*
*
* Author: Akshay Dubey (https://github.com/itsAkshayDubey)
*
*
* */
public class PronicNumber {
/**
/**
* This method checks if the given number is pronic number or non-pronic number
*
* @param input_number Integer value which is to be checked if is a pronic number or not
* @param input_number Integer value which is to be checked if is a pronic number or not
* @return true if input number is a pronic number, false otherwise
*/
static boolean isPronic(int input_number) {
//Iterating from 0 to input_number
for(int i = 0; i <= input_number; i++) {
//Checking if product of i and (i+1) is equals input_number
if(i * (i+1) == input_number && i != input_number) {
//return true if product of i and (i+1) is equals input_number
return true;
}
}
//return false if product of i and (i+1) for all values from 0 to input_number is not equals input_number
return false;
}
static boolean isPronic(int input_number) {
//Iterating from 0 to input_number
for (int i = 0; i <= input_number; i++) {
//Checking if product of i and (i+1) is equals input_number
if (i * (i + 1) == input_number && i != input_number) {
//return true if product of i and (i+1) is equals input_number
return true;
}
}
//return false if product of i and (i+1) for all values from 0 to input_number is not equals input_number
return false;
}
}