Sequence of primes by trial division: Difference between revisions
m
→{{header|EasyLang}}
Line 827:
=={{header|EasyLang}}==
<syntaxhighlight lang="easylang">
if num < 2
▲ result$ = "false"
break 1
.
if num mod 2 = 0 and num > 2
break 1
.
for i = 3 step 2 to sqrt num
if num mod i = 0
break 2
.
.
result
.
for i = first to last
call isPrime i result
if result
sequence[] &= i
.
.
.
call primeSequence 1 100 seq[]
print seq[]
</syntaxhighlight>
|