Abundant Numbers (Long)
Details
An abundant number is a number for which the sum of its proper divisors (divisors not including the number itself) is greater than the number itself. For example 12 is abundant because its proper divisors are 1, 2, 3, 4, and 6 which add up to 16.
Print all the abundant numbers from 1 to 1,000 inclusive, each on their own line.
0 bytes, 0 chars
Restore solution
Compiled from
AT&T syntax to x86-64 Linux. Use
syscalls to write output.
Clojure is an experimental language, no solutions will be saved.
Please leave feedback on the
GitHub issue.
ctrl + enter or