You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: 1-js/02-first-steps/12-while-for/7-list-primes/task.md
+2-2Lines changed: 2 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -6,12 +6,12 @@ importance: 3
6
6
7
7
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.
8
8
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`.
10
10
11
11
For example, `5` is a prime, because it cannot be divided without a remainder by `2`, `3` and `4`.
12
12
13
13
**Write the code which outputs prime numbers in the interval from `2` to `n`.**
14
14
15
-
For `n=10` the result will be `2,3,5,7`.
15
+
For `n = 10` the result will be `2,3,5,7`.
16
16
17
17
P.S. The code should work for any `n`, not be hard-tuned for any fixed value.
0 commit comments