Calculates the greatest common divisors of two numbers utilizing the euclidean algorithm and/or calculates if a number is prime or not utilizing the non-brute-force method which allows it to calculate numbers in the hundred billions and higher in an efficient amount of time.
Dpats13/GCD-and-Prime-Number-Calculator
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|