Skip to content

Commit 4c8aedc

Browse files
authored
Spacing
1 parent d39750f commit 4c8aedc

File tree

1 file changed

+2
-2
lines changed
  • 1-js/02-first-steps/12-while-for/7-list-primes

1 file changed

+2
-2
lines changed

1-js/02-first-steps/12-while-for/7-list-primes/task.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -6,12 +6,12 @@ importance: 3
66

77
An integer number greater than `1` is called a [prime](https://en.wikipedia.org/wiki/Prime_number) if it cannot be divided without a remainder by anything except `1` and itself.
88

9-
In other words, `n>1` is a prime if it can't be evenly divided by anything except `1` and `n`.
9+
In other words, `n > 1` is a prime if it can't be evenly divided by anything except `1` and `n`.
1010

1111
For example, `5` is a prime, because it cannot be divided without a remainder by `2`, `3` and `4`.
1212

1313
**Write the code which outputs prime numbers in the interval from `2` to `n`.**
1414

15-
For `n=10` the result will be `2,3,5,7`.
15+
For `n = 10` the result will be `2,3,5,7`.
1616

1717
P.S. The code should work for any `n`, not be hard-tuned for any fixed value.

0 commit comments

Comments
 (0)