Rosetta Code

Sequence of primes by trial division: Difference between revisions

Page Discussion

Sequence of primes by trial division (view source)

Revision as of 11:28, 4 February 2024

105 bytes removed ,  3 months ago
m
→‎{{header|Wren}}: Minor tidy
(add task to arm assembly raspberry pi)
m (→‎{{header|Wren}}: Minor tidy)
 
(2 intermediate revisions by 2 users not shown)
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>
Line 1,322 ⟶ 1,319:
 
=={{header|Elena}}==
ELENA 46.x :
<syntaxhighlight lang="elena">import extensions;
import system'routines;
Line 1,328 ⟶ 1,325:
isPrime =
(n => new Range(2,(n.sqrt() - 1).RoundedInt).allMatchedBy::(i => n.mod:(i) != 0));
Primes =
(n => new Range(2, n - 2).filterBy:(isPrime));
public program()
Line 3,413 ⟶ 3,410:
{{libheader|Wren-fmt}}
Using a simple generator.
<syntaxhighlight lang="ecmascriptwren">import "./fmt" for Fmt
 
var primeSeq = Fiber.new {
PureFox
9,476

edits

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