Sha256: 3b7b599b7c7043fed079252c114bcee36190179a0a10d3965e09a3393b4ae178

Contents?: true

Size: 1.94 KB

Versions: 74

Compression:

Stored size: 1.94 KB

Contents

# Perfect Numbers

Determine if a number is perfect, abundant, or deficient based on
Nicomachus' (60 - 120 CE) classification scheme for natural numbers.

The Greek mathematician [Nicomachus](https://en.wikipedia.org/wiki/Nicomachus) devised a classification scheme for natural numbers, identifying each as belonging uniquely to the categories of **perfect**, **abundant**, or **deficient** based on their [aliquot sum](https://en.wikipedia.org/wiki/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

- **Perfect**: aliquot sum = number
  - 6 is a perfect number because (1 + 2 + 3) = 6
  - 28 is a perfect number because (1 + 2 + 4 + 7 + 14) = 28
- **Abundant**: aliquot sum > number
  - 12 is an abundant number because (1 + 2 + 3 + 4 + 6) = 16
  - 24 is an abundant number because (1 + 2 + 3 + 4 + 6 + 8 + 12) = 36
- **Deficient**: aliquot sum < number
  - 8 is a deficient number because (1 + 2 + 4) = 7
  - Prime numbers are deficient

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**.

The Scala exercises assume an SBT project scheme. The exercise solution source
should be placed within the exercise directory/src/main/scala. The exercise
unit tests can be found within the exercise directory/src/test/scala.

To run the tests simply run the command `sbt test` in the exercise directory.

For more detailed info about the Scala track see the [help
page](http://exercism.io/languages/scala).


## Source

Taken from Chapter 2 of Functional Thinking by Neal Ford. [http://shop.oreilly.com/product/0636920029687.do](http://shop.oreilly.com/product/0636920029687.do)

## Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.

Version data entries

74 entries across 74 versions & 1 rubygems

Version Path
trackler-2.2.1.180 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.179 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.178 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.177 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.176 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.175 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.174 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.173 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.172 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.171 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.170 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.169 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.167 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.166 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.165 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.164 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.163 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.162 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.161 tracks/scala/exercises/perfect-numbers/README.md
trackler-2.2.1.160 tracks/scala/exercises/perfect-numbers/README.md