diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md index 8e5382e3fad..a166c7e236e 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md @@ -8,7 +8,7 @@ dashedName: averagespythagorean-means # --description-- -Compute all three of the Pythagorean means of the set of integers $1$ through $10$ (inclusive). +Compute all three of the Pythagorean means of the set of integers $1$ through $10$ (inclusive). Show that $A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$ for this set of positive integers. diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md index 29860bd9076..c8cf067ffbe 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md @@ -48,7 +48,7 @@ Further properties of Mersenne numbers allow us to refine the process even more. Any factor `q` of 2P-1 must be of the form `2kP+1`, `k` being a positive integer or zero. Furthermore, `q` must be `1` or `7 mod 8`. -Finally any potential factor `q` must be prime. +Finally any potential factor `q` must be prime. As in other trial division algorithms, the algorithm stops when `2kP+1 > sqrt(N)`.These primarily tests only work on Mersenne numbers where `P` is prime. For example, M4=15 yields no factors using these techniques, but factors into 3 and 5, neither of which fit `2kP+1`. diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/least-common-multiple.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/least-common-multiple.md index d314aa74193..ed570104bf0 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/least-common-multiple.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/least-common-multiple.md @@ -8,7 +8,7 @@ dashedName: least-common-multiple # --description-- -The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either $m$ or $n$ is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of $m$, until you find one that is also a multiple of $n$. If you already have $gcd$ for greatest common divisor, then this formula calculates $lcm$. +The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either $m$ or $n$ is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of $m$, until you find one that is also a multiple of $n$. If you already have $gcd$ for greatest common divisor, then this formula calculates $lcm$. $$ \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/s-expressions.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/s-expressions.md index cbed4e26ff3..69312d26343 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/s-expressions.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/s-expressions.md @@ -8,7 +8,7 @@ dashedName: s-expressions # --description-- -S-Expressions are one convenient way to parse and store data. +S-Expressions are one convenient way to parse and store data. # --instructions-- diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/self-referential-sequence.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/self-referential-sequence.md index 4373609f25c..7fad04ada65 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/self-referential-sequence.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/self-referential-sequence.md @@ -8,7 +8,7 @@ dashedName: self-referential-sequence # --description-- -There are several ways to generate a self-referential sequence. One very common one (the Look-and-say sequence) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits: +There are several ways to generate a self-referential sequence. One very common one (the Look-and-say sequence) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits: 
0, 10, 1110, 3110, 132110, 1113122110, 311311222110 ...
diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md index baf2351683b..52c5b25034b 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md @@ -8,7 +8,7 @@ dashedName: sorting-algorithmsgnome-sort # --description-- -Gnome sort is a sorting algorithm which is similar to Insertion sort, except that moving an element to its proper place is accomplished by a series of swaps, as in Bubble Sort. +Gnome sort is a sorting algorithm which is similar to Insertion sort, except that moving an element to its proper place is accomplished by a series of swaps, as in Bubble Sort. The pseudocode for the algorithm is: diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md index fdb4563174d..9807fddbd11 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md @@ -8,7 +8,7 @@ dashedName: stern-brocot-sequence # --description-- -For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the Fibonacci sequence. +For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the Fibonacci sequence.
  1. The first and second members of the sequence are both 1:
    2. diff --git a/curriculum/challenges/english/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md b/curriculum/challenges/english/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md index 6802c22b557..47cee2ababe 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md +++ b/curriculum/challenges/english/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md @@ -8,7 +8,7 @@ dashedName: build-an-image-search-abstraction-layer # --description-- -Build a full stack JavaScript app that allows you to search for images like this: https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10 and browse recent search queries like this: https://image-search-abstraction-layer.freecodecamp.rocks/recent/. Use a site builder of your choice to complete the project. +Build a full stack JavaScript app that allows you to search for images like this: https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10 and browse recent search queries like this: https://image-search-abstraction-layer.freecodecamp.rocks/recent/. Use a site builder of your choice to complete the project. Here are the specific user stories you should implement for this project: