Merge branch 'en' of https://github.com/iliakan/javascript-tutorial into en

iliakan · iliakan · commit 0ff5058daddd · 2016-10-21T11:21:12.000+03:00
diff --git a/1-js/2-first-steps/15-while-for/7-list-primes/solution.md b/1-js/2-first-steps/15-while-for/7-list-primes/solution.md
@@ -14,7 +14,7 @@ The code using a label:
 
 ```js run
 nextPrime:
-for (let i = 2; i < 10; i++) { // for each i...
+for (let i = 2; i <= 10; i++) { // for each i...
 
   for (let j = 2; j < i; j++) { // look for a divisor..
     if (i % j == 0) continue nextPrime; // not a prime, go next i
@@ -25,4 +25,3 @@ for (let i = 2; i < 10; i++) { // for each i...
 ```
 
 Surely, there's a lot of space to opimize it. Like, we could look for the divisors from `2` to square root of `i`. But anyway, if we want to be really efficient for large intervals, we need change the approach and rely heavily on advanced maths and algorithms like [Quadratic sieve](https://en.wikipedia.org/wiki/Quadratic_sieve), [General number field sieve](https://en.wikipedia.org/wiki/General_number_field_sieve) etc.
-
