• 1.0 Initial Release
  • 1.0.6

• fibonacciSequence
• isPrimeNumber
• nPrimeNumbers
• greatestCD
• leastCM
• factorial
• factorialSequence
• doubleFactorial
• getFactors
• isAbundantNumber
• isDeficientNumber
• isPerfectNumber

Added the Javadoc to each method.

• Full reestructuration of the project, now everything is organized in different classes and packages for better organization as the project grows.
• From now on, all methods from classes will be sorted alphabetically top-down.
• Testing environment added for almost all classes and methods. Inputs for testing are also provided in (/src/test/resources).
• With the addition of testing environments, JUnit5 is required to perform those tests. JUnit5 Repository on GitHub.

Modified the first constructor to properly set the value of the fraction.
Added getDenominator().
Added getNumerator().
Added getValue().
Added setDenominator().
Added setNumerator().

Modified method name, isPrimeNumber to isPrime.
Modified method name, getNextPrime to getNext.
Modified method name, nPrimeNumbers to nPrimes.

Fixed getNext() bug, now checks if n equals 2 before checking if n is multiple of 2 (Since 2 is prime, but not its multiples).

Modified method name primeFactors to getPrimeFactors.

Fixed getFactors() bug that returned just [1] for all prime numbers. Now returns [1, (prime)].
Fixed getFactors() bug that returned the same input for 0 and 1. Now evaluates 0 and 1 separately.

Modified method name isAbundantNumber to isAbundant.
Modified method name isDeficientNumber to isDeficient.
Modified method name isPerfectNumber to isPerfect.

Modified method name fibonacciSequence to fibonacci

Modified all methods to be sorted alphabetically (To search quicker).
Added doubleFactorialList().