Fix a few typos

lunatech-labs · Sep 11, 2023 · 2971bd4 · 2971bd4
1 parent 951ccf2
commit 2971bd4
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 4 deletions.
diff --git a/exercises/exercise_002_calculating_with_prime_numbers/README.md b/exercises/exercise_002_calculating_with_prime_numbers/README.md
@@ -15,11 +15,11 @@ numbers starting from 2 upto a given number.
 
 # Steps
 
-- Create a new object `SumOfPrimes`
+- Create a new object `Primes`
 - Define a method `sumOfPrimesBelow` with a single parameter
  `limit` of type `Int`.
 - Implement the method to return the sum of all primes numbers
   below `limit`.
 - What should the return type of `sumOfPrimesBelow` be?
 
-- Run `test` from the `sbt` prompt and check if all tests pass.
+- Run `test` from the `sbt` prompt and check if all tests pass.
diff --git a/exercises/exercise_003_checking_method_arguments/README.md b/exercises/exercise_003_checking_method_arguments/README.md
@@ -1,4 +1,4 @@
-# Calculating prime factors for a give number
+# Calculating prime factors for a given number
 
 The [Fundamental theorem of Mathematics](https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic) states that
 
@@ -36,4 +36,4 @@ value of 3,000,001) into its prime factors
 
 - Why did we ask the return type to be `Vector[Int]` and not `Seq[Int]`?
 
-- Run `test` from the `sbt` prompt and check if all tests pass.
+- Run `test` from the `sbt` prompt and check if all tests pass.