..

Author: nicklatch

gleam/perfect-numbers/.exercism/config.json

@@ -0,0 +1,23 @@
+{
+  "authors": [
+    "jiegillet"
+  ],
+  "files": {
+    "solution": [
+      "src/perfect_numbers.gleam"
+    ],
+    "test": [
+      "test/perfect_numbers_test.gleam"
+    ],
+    "example": [
+      ".meta/example.gleam"
+    ],
+    "invalidator": [
+      "gleam.toml",
+      "manifest.toml"
+    ]
+  },
+  "blurb": "Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for positive integers.",
+  "source": "Taken from Chapter 2 of Functional Thinking by Neal Ford.",
+  "source_url": "https://www.oreilly.com/library/view/functional-thinking/9781449365509/"
+}

gleam/perfect-numbers/.exercism/metadata.json

@@ -0,0 +1 @@
+{"track":"gleam","exercise":"perfect-numbers","id":"05a9ec6e71ca413fbe81f9eea619d6de","url":"https://exercism.org/tracks/gleam/exercises/perfect-numbers","handle":"nicklatch","is_requester":true,"auto_approve":false}

gleam/perfect-numbers/.gitignore

@@ -0,0 +1,4 @@
+*.beam
+*.ez
+build
+erl_crash.dump

gleam/perfect-numbers/HELP.md

@@ -0,0 +1,32 @@
+# Help
+
+## Running the tests
+
+To run the tests, run the command `gleam test` from within the exercise directory.
+
+## Submitting your solution
+
+You can submit your solution using the `exercism submit src/perfect_numbers.gleam` command.
+This command will upload your solution to the Exercism website and print the solution page's URL.
+
+It's possible to submit an incomplete solution which allows you to:
+
+- See how others have completed the exercise
+- Request help from a mentor
+
+## Need to get help?
+
+If you'd like help solving the exercise, check the following pages:
+
+- The [Gleam track's documentation](https://exercism.org/docs/tracks/gleam)
+- The [Gleam track's programming category on the forum](https://forum.exercism.org/c/programming/gleam)
+- [Exercism's programming category on the forum](https://forum.exercism.org/c/programming/5)
+- The [Frequently Asked Questions](https://exercism.org/docs/using/faqs)
+
+Should those resources not suffice, you could submit your (incomplete) solution to request mentoring.
+
+To get help if you're having trouble, you can use one of the following resources:
+
+- [gleam.run](https://gleam.run/documentation/) is the gleam official documentation.
+- [Discord](https://discord.gg/Fm8Pwmy) is the discord channel.
+- [StackOverflow](https://stackoverflow.com/questions/tagged/gleam) can be used to search for your problem and see if it has been answered already. You can also ask and answer questions.

gleam/perfect-numbers/README.md

@@ -0,0 +1,38 @@
+# Perfect Numbers
+
+Welcome to Perfect Numbers on Exercism's Gleam Track.
+If you need help running the tests or submitting your code, check out `HELP.md`.
+
+## Instructions
+
+Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for positive integers.
+
+The Greek mathematician [Nicomachus][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][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**.
+
+[nicomachus]: https://en.wikipedia.org/wiki/Nicomachus
+[aliquot-sum]: https://en.wikipedia.org/wiki/Aliquot_sum
+
+## Source
+
+### Created by
+
+- @jiegillet
+
+### Based on
+
+Taken from Chapter 2 of Functional Thinking by Neal Ford. - https://www.oreilly.com/library/view/functional-thinking/9781449365509/

gleam/perfect-numbers/gleam.toml

@@ -0,0 +1,11 @@
+name = "perfect_numbers"
+version = "0.1.0"
+
+[dependencies]
+gleam_bitwise = "~> 1.2"
+gleam_otp = "~> 0.7 or ~> 1.0"
+gleam_stdlib = "~> 0.32 or ~> 1.0"
+simplifile = "~> 1.0"
+
+[dev-dependencies]
+exercism_test_runner = "~> 1.4"

gleam/perfect-numbers/manifest.toml

@@ -0,0 +1,26 @@
+# This file was generated by Gleam
+# You typically do not need to edit this file
+
+packages = [
+  { name = "argv", version = "1.0.1", build_tools = ["gleam"], requirements = [], otp_app = "argv", source = "hex", outer_checksum = "A6E9009E50BBE863EB37D963E4315398D41A3D87D0075480FC244125808F964A" },
+  { name = "exercism_test_runner", version = "1.7.0", build_tools = ["gleam"], requirements = ["argv", "gap", "glance", "gleam_community_ansi", "gleam_erlang", "gleam_json", "gleam_stdlib", "simplifile"], otp_app = "exercism_test_runner", source = "hex", outer_checksum = "2FC1BADB19BEC2AE77BFD2D3A606A014C85412A7B874CAFC4BA8CF04B0B257CD" },
+  { name = "gap", version = "1.1.0", build_tools = ["gleam"], requirements = ["gleam_community_ansi", "gleam_stdlib"], otp_app = "gap", source = "hex", outer_checksum = "2EE1B0A17E85CF73A0C1D29DA315A2699117A8F549C8E8D89FA8261BE41EDEB1" },
+  { name = "glance", version = "0.8.2", build_tools = ["gleam"], requirements = ["gleam_stdlib", "glexer"], otp_app = "glance", source = "hex", outer_checksum = "ACF09457E8B564AD7A0D823DAFDD326F58263C01ACB0D432A9BEFDEDD1DA8E73" },
+  { name = "gleam_bitwise", version = "1.3.1", build_tools = ["gleam"], requirements = [], otp_app = "gleam_bitwise", source = "hex", outer_checksum = "B36E1D3188D7F594C7FD4F43D0D2CE17561DE896202017548578B16FE1FE9EFC" },
+  { name = "gleam_community_ansi", version = "1.4.0", build_tools = ["gleam"], requirements = ["gleam_community_colour", "gleam_stdlib"], otp_app = "gleam_community_ansi", source = "hex", outer_checksum = "FE79E08BF97009729259B6357EC058315B6FBB916FAD1C2FF9355115FEB0D3A4" },
+  { name = "gleam_community_colour", version = "1.3.0", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "gleam_community_colour", source = "hex", outer_checksum = "A49A5E3AE8B637A5ACBA80ECB9B1AFE89FD3D5351FF6410A42B84F666D40D7D5" },
+  { name = "gleam_erlang", version = "0.24.0", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "gleam_erlang", source = "hex", outer_checksum = "26BDB52E61889F56A291CB34167315780EE4AA20961917314446542C90D1C1A0" },
+  { name = "gleam_json", version = "1.0.0", build_tools = ["gleam"], requirements = ["gleam_stdlib", "thoas"], otp_app = "gleam_json", source = "hex", outer_checksum = "8B197DD5D578EA6AC2C0D4BDC634C71A5BCA8E7DB5F47091C263ECB411A60DF3" },
+  { name = "gleam_otp", version = "0.10.0", build_tools = ["gleam"], requirements = ["gleam_erlang", "gleam_stdlib"], otp_app = "gleam_otp", source = "hex", outer_checksum = "0B04FE915ACECE539B317F9652CAADBBC0F000184D586AAAF2D94C100945D72B" },
+  { name = "gleam_stdlib", version = "0.36.0", build_tools = ["gleam"], requirements = [], otp_app = "gleam_stdlib", source = "hex", outer_checksum = "C0D14D807FEC6F8A08A7C9EF8DFDE6AE5C10E40E21325B2B29365965D82EB3D4" },
+  { name = "glexer", version = "0.7.0", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "glexer", source = "hex", outer_checksum = "4484942A465482A0A100936E1E5F12314DB4B5AC0D87575A7B9E9062090B96BE" },
+  { name = "simplifile", version = "1.5.0", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "simplifile", source = "hex", outer_checksum = "EB9AA8E65E5C1E3E0FDCFC81BC363FD433CB122D7D062750FFDF24DE4AC40116" },
+  { name = "thoas", version = "0.4.1", build_tools = ["rebar3"], requirements = [], otp_app = "thoas", source = "hex", outer_checksum = "4918D50026C073C4AB1388437132C77A6F6F7C8AC43C60C13758CC0ADCE2134E" },
+]
+
+[requirements]
+exercism_test_runner = { version = "~> 1.4" }
+gleam_bitwise = { version = "~> 1.2" }
+gleam_otp = { version = "~> 0.7 or ~> 1.0" }
+gleam_stdlib = { version = "~> 0.32 or ~> 1.0" }
+simplifile = { version = "~> 1.0" }

gleam/perfect-numbers/src/perfect_numbers.gleam

@@ -0,0 +1,31 @@
+import gleam/list
+import gleam/int.{compare, sum}
+import gleam/order.{Eq, Gt, Lt}
+
+pub type Classification {
+  Perfect
+  Abundant
+  Deficient
+}
+
+pub type Error {
+  NonPositiveInt
+}
+
+pub fn classify(number: Int) -> Result(Classification, Error) {
+  case number > 0 {
+    True ->
+      case compare(alq_sum(number), number) {
+        Lt -> Ok(Deficient)
+        Eq -> Ok(Perfect)
+        Gt -> Ok(Abundant)
+      }
+    False -> Error(NonPositiveInt)
+  }
+}
+
+fn alq_sum(number: Int) -> Int {
+  list.range(1, number / 2)
+  |> list.filter(fn(num) { num != number && number % num == 0 })
+  |> sum
+}

gleam/perfect-numbers/test/perfect_numbers_test.gleam

@@ -0,0 +1,72 @@
+import exercism/should
+import exercism/test_runner
+import perfect_numbers.{Abundant, Deficient, NonPositiveInt, Perfect}
+
+pub fn main() {
+  test_runner.main()
+}
+
+pub fn perfect_numbers_smallest_perfect_number_is_classified_correctly_test() {
+  perfect_numbers.classify(6)
+  |> should.equal(Ok(Perfect))
+}
+
+pub fn perfect_numbers_medium_perfect_number_is_classified_correctly_test() {
+  perfect_numbers.classify(28)
+  |> should.equal(Ok(Perfect))
+}
+
+pub fn perfect_numbers_large_perfect_number_is_classified_correctly_test() {
+  perfect_numbers.classify(33_550_336)
+  |> should.equal(Ok(Perfect))
+}
+
+pub fn abundant_numbers_smallest_abundant_number_is_classified_correctly_test() {
+  perfect_numbers.classify(12)
+  |> should.equal(Ok(Abundant))
+}
+
+pub fn abundant_numbers_medium_abundant_number_is_classified_correctly_test() {
+  perfect_numbers.classify(30)
+  |> should.equal(Ok(Abundant))
+}
+
+pub fn abundant_numbers_large_abundant_number_is_classified_correctly_test() {
+  perfect_numbers.classify(33_550_335)
+  |> should.equal(Ok(Abundant))
+}
+
+pub fn deficient_numbers_smallest_prime_deficient_number_is_classified_correctly_test() {
+  perfect_numbers.classify(2)
+  |> should.equal(Ok(Deficient))
+}
+
+pub fn deficient_numbers_smallest_non_prime_deficient_number_is_classified_correctly_test() {
+  perfect_numbers.classify(4)
+  |> should.equal(Ok(Deficient))
+}
+
+pub fn deficient_numbers_medium_deficient_number_is_classified_correctly_test() {
+  perfect_numbers.classify(32)
+  |> should.equal(Ok(Deficient))
+}
+
+pub fn deficient_numbers_large_deficient_number_is_classified_correctly_test() {
+  perfect_numbers.classify(33_550_337)
+  |> should.equal(Ok(Deficient))
+}
+
+pub fn deficient_numbers_edge_case_no_factors_other_than_itself_is_classified_correctly_test() {
+  perfect_numbers.classify(1)
+  |> should.equal(Ok(Deficient))
+}
+
+pub fn invalid_inputs_zero_is_rejected_as_it_is_not_a_positive_integer_test() {
+  perfect_numbers.classify(0)
+  |> should.equal(Error(NonPositiveInt))
+}
+
+pub fn invalid_inputs_negative_integer_is_rejected_as_it_is_not_a_positive_integer_test() {
+  perfect_numbers.classify(-1)
+  |> should.equal(Error(NonPositiveInt))
+}