Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for positive integers.
The Greek mathematician Nicomachus devised a classification scheme for positive integers, identifying each as belonging uniquely to the categories of perfect, abundant, or deficient based on their aliquot sum. The aliquot sum is defined as the sum of the factors of a number not including the number itself. For example, the aliquot sum of 15 is (1 + 3 + 5) = 9
Implement a way to determine whether a given number is perfect. Depending on your language track, you may also need to implement a way to determine whether a given number is abundant or deficient.
make chez if you're using ChezScheme or
make guile if you're using GNU Guile.
Sometimes the name for the scheme binary on your system will differ from the defaults.
When this is the case, you'll need to tell make by running
make chez chez=your-chez-binary or
make guile guile=your-guile-binary.
(load "test.scm")at the repl prompt.
perfect-numbers.scmreloading as you go.
(test)to check your solution.
If some of the test cases fail, you should see the failing input and the expected output.
The failing input is presented as a list because the tests call your solution by
(apply perfect-numbers input-list).
To learn more about
apply see The Scheme Programming Language -- Chapter 5