BaseLibraries/JavaClasses
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/javaclasses.git synced 2025-12-06 15:03:58 -05:00
Code Issues Packages Projects Releases Wiki Activity

Fixed typo

Browse Source
This commit is contained in:
Mattrixwv
2020-06-16 11:30:39 -04:00
parent 7921241b1b
commit 1443e5bc57
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/main/java/mattrixwv/Algorithms.java
View File

@@ -417,7 +417,7 @@ public class Algorithms{
//If you find one add it and the number it creates to the list //If you find one add it and the number it creates to the list
if((goalNumber % possibleDivisor) == 0){ if((goalNumber % possibleDivisor) == 0){
divisors.add(possibleDivisor); divisors.add(possibleDivisor);
//Accound for the possibility of sqrt(goalNumber) being a divisor //Account for the possibility of sqrt(goalNumber) being a divisor
if(possibleDivisor != topPossibleDivisor.intValue()){ if(possibleDivisor != topPossibleDivisor.intValue()){
divisors.add(goalNumber / possibleDivisor); divisors.add(goalNumber / possibleDivisor);
} }
@@ -451,7 +451,7 @@ public class Algorithms{
//If you find one add it and the number it creates to the list //If you find one add it and the number it creates to the list
if((goalNumber % possibleDivisor) == 0){ if((goalNumber % possibleDivisor) == 0){
divisors.add(possibleDivisor); divisors.add(possibleDivisor);
//Accound for the possibility of sqrt(goalNumber) being a divisor //Account for the possibility of sqrt(goalNumber) being a divisor
if(possibleDivisor != topPossibleDivisor.longValue()){ if(possibleDivisor != topPossibleDivisor.longValue()){
divisors.add(goalNumber / possibleDivisor); divisors.add(goalNumber / possibleDivisor);
} }
@@ -485,7 +485,7 @@ public class Algorithms{
//If you find one add it and the number it creates to the list //If you find one add it and the number it creates to the list
if(goalNumber.mod(possibleDivisor).equals(BigInteger.valueOf(0))){ if(goalNumber.mod(possibleDivisor).equals(BigInteger.valueOf(0))){
divisors.add(possibleDivisor); divisors.add(possibleDivisor);
//Accound for the possibility of sqrt(goalNumber) being a divisor //Account for the possibility of sqrt(goalNumber) being a divisor
if(!possibleDivisor.equals(topPossibleDivisor)){ if(!possibleDivisor.equals(topPossibleDivisor)){
divisors.add(goalNumber.divide(possibleDivisor)); divisors.add(goalNumber.divide(possibleDivisor));
} }