Sequence of primes by trial division: Difference between revisions
Content added Content deleted
(add RPL) |
mNo edit summary |
||
| Line 3,270: | Line 3,270: | ||
0 OK, 0:136</pre> |
0 OK, 0:136</pre> |
||
=={{header|V (Vlang)}}== |
|||
<syntaxhighlight lang="Vlang"> |
|||
import math |
|||
fn main() { |
|||
for idx in 1..101 {if is_prime(idx) {println("${idx}")}} |
|||
} |
|||
fn is_prime(num int) bool { |
|||
if num < 2 {return false} |
|||
if num < 4 {return true} |
|||
if num % 2 == 0 {return false} |
|||
for idx := 3; idx <= math.sqrt(num); idx += 2 { |
|||
if num % idx == 0 {return false} |
|||
} |
|||
return true |
|||
} |
|||
</syntaxhighlight> |
|||
=={{header|Wren}}== |
=={{header|Wren}}== |
||