TODO:
- Use efficient algorithm for Euler's Totient function (something with prime factorization)
- Use efficient algorithms on LCM and GCD
- Make output of divisors print in order
Minds-Eye/gmath
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
| Name | Name | Last commit date | ||
|---|---|---|---|---|