Rosetta Code

Sequence of primes by trial division: Difference between revisions

Page Discussion

Sequence of primes by trial division (view source)

Revision as of 19:04, 8 September 2023

103 bytes removed ,  8 months ago
m
→‎{{header|EasyLang}}
(add task to arm assembly raspberry pi)
Line 947:
=={{header|EasyLang}}==
<syntaxhighlight lang="easylang">
func prime n .
proc isPrime num . result .
resultif n mod 2 = 0 and n > 2
if num < 2return 0
break 1▼
.
i = 3
if num mod 2 = 0 and num > 2▼
while i <= breaksqrt 1n
▲ if numn mod 2i = 0 and num > 2
.
for i = 3 step 2 toreturn sqrt num0
if num mod i = 0
break 2
.
▲ breaki 1+= 2
.
result =return 1
.
proc primeSequenceprimeSequ first last . sequencesequ[] .
for i = first to last
callif isPrimeprime i result= 1
if result sequ[] &= 1i
sequence[] &= i
.
.
.
callprimeSequ primeSequence 12 100 seq[]
print seq[]
</syntaxhighlight>
Chkas
1,995

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/352534"