GitHub - IPCHALLIS/Find-the-Divisors: These two programs take a given integer n > 1 and return an array with all the integer's divisors (except 1 and the integer itself), from smallest to largest. If the integer is a prime number, it returns a string; '(integer) is prime'. Both programs deliver the same results, except one has imported modules, while the other does not.

IPCHALLIS / Find-the-Divisors Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

These two programs take a given integer n > 1 and return an array with all the integer's divisors (except 1 and the integer itself), from smallest to largest. If the integer is a prime number, it returns a string; '(integer) is prime'. Both programs deliver the same results, except one has imported modules, while the other does not.